Indexing spatio-temporal data warehouses

Spatio-temporal databases store information about the positions of individual objects over time. In many applications, however, such as traffic supervision or mobile communication systems, only summarized data, like the average number of cars in an area for a specific period, or the number of phones serviced by a cell each day, is required. Although this information can be obtained from operational databases, its computation is expensive, rendering online processing inapplicable. A vital solution is the construction of a spatio-temporal data warehouse. In this paper, we describe a framework for supporting OLAP operations over spatio-temporal data. We argue that the spatial and temporal dimensions should be modeled as a combined dimension on the data cube and we present data structures which integrate spatio-temporal indexing with pre-aggregation. While the well-known materialization techniques require a-priori knowledge of the grouping hierarchy, we develop methods that utilize the proposed structures for efficient execution of ad-hoc group-bys. Our techniques can be used for both static and dynamic dimensions.

[1]  Markus Schneider,et al.  A foundation for representing and querying moving objects , 2000, TODS.

[2]  Sharad Mehrotra,et al.  Progressive approximate aggregate queries with a multi-resolution tree structure , 2001, SIGMOD '01.

[3]  Forouzan Golshani,et al.  Proceedings of the Eighth International Conference on Data Engineering , 1992 .

[4]  Inderpal Singh Mumick,et al.  Selection of Views to Materialize Under a Maintenance Cost Constraint , 1999, ICDT.

[5]  Myoung-Ho Kim,et al.  Effective Temporal Aggregation Using Point-Based Trees , 1999, DEXA.

[6]  Panos Kalnis,et al.  Efficient OLAP Operations in Spatial Data Warehouses , 2001, SSTD.

[7]  Richard T. Snodgrass,et al.  Computing temporal aggregates , 1995, Proceedings of the Eleventh International Conference on Data Engineering.

[8]  Christian S. Jensen,et al.  Lopez: "Indexing the Positions of Continuously Moving Objects , 2000, SIGMOD 2000.

[9]  Dieter Pfoser,et al.  Novel Approaches to the Indexing of Moving Object Trajectories , 2000, VLDB.

[10]  S JensenChristian,et al.  Indexing the positions of continuously moving objects , 2000 .

[11]  Christian S. Jensen,et al.  R-Tree Based Indexing of Now-Relative Bitemporal Data , 1998, VLDB.

[12]  Alberto O. Mendelzon,et al.  Temporal Queries in OLAP , 2000, VLDB.

[13]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[14]  Hans-Joachim Lenz,et al.  The R/sub a/*-tree: an improved R*-tree with materialized data for supporting range queries on OLAP-data , 1998, Proceedings Ninth International Workshop on Database and Expert Systems Applications (Cat. No.98EX130).

[15]  Hamid Pirahesh,et al.  Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals , 1996, Data Mining and Knowledge Discovery.

[16]  Bernhard Seeger,et al.  Query Processing Techniques for Multiversion Access Methods , 1996, VLDB.

[17]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[18]  Jeffrey D. Ullman,et al.  Implementing data cubes efficiently , 1996, SIGMOD '96.

[19]  Mario A. Nascimento,et al.  Towards historical R-trees , 1998, SAC '98.

[20]  Jiawei Han,et al.  Object-Based Selective Materialization for Efficient Implementation of Spatial Data Cubes , 2000, IEEE Trans. Knowl. Data Eng..

[21]  Jeffrey F. Naughton,et al.  Materialized View Selection for Multidimensional Datasets , 1998, VLDB.

[22]  Jiawei Han,et al.  Selective Materialization: An Efficient Method for Spatial Data Cube Construction , 1998, PAKDD.