Indexing spatio-temporal data warehouses

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2002, Pages 166-175

  Papadias, Dimitris ^a   Tao, Yufei ^a   Kalnis, Panos ^a   Zhang, Jun ^a  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

DATA REDUCTION; DATA STORAGE EQUIPMENT; DATA STRUCTURES; MATHEMATICAL MODELS; MOBILE TELECOMMUNICATION SYSTEMS; TELECOMMUNICATION TRAFFIC;

SPATIO-TEMPORAL DATA WAREHOUSES;

DATA WAREHOUSES;

EID: 0036203124     PISSN: 10844627     EISSN: None     Source Type: Journal    
DOI: 10.1109/ICDE.2002.994706     Document Type: Article

References (22)

1. R-tree based indexing of now-relative bitemporal data
2. The R*-tree: An efficient and robust access method for points and rectangles
3. R-trees: A dynamic index structure for spatial searching
4. A foundation for representing and querying moving objects
5. Data cube: A relational aggregation operator generalizing group-by, cross-tabs and subtotals
6. Selection of views to materialize under a maintenance-time constraint
7. Implementing data cubes efficiently
8. Selective materialization: An efficient method for spatial data cube construction
9. a*-tree: An improved R-tree with materialized data for supporting range queries on OLAP-data
10. Effective temporal aggregation using point-based trees
11. Computing temporal aggregates
12. Progressive approximate aggregate queries with a multi-resolution tree structure
13. Temporal queries in OLAP
14. Towards historical R-trees
15. Novel approaches to the indexing of moving object trajectories
16. Efficient OLAP operations in spatial data warehouses
17. Materialized view selection for multidimensional datasets
18. Object-based selective materialization for efficient implementation of spatial data cubes
19. Indexing the positions of continuously moving objects
20. Query processing techniques for multiversion access methods
21. Incremental computation of temporal aggregates