Spatio-Temporal Indexing: Current Scenario, Challenges and Approaches

With rapid advancements in computing hardware, tracking devices such as GPS receivers and sensors have become pervasive, generating a large amount of spatio-temporal data, such as measurements of temperature, pressure, air quality, traffic, etc. using sensors, GPS data from mobile phones and data from radars that capture location information about people and other moving objects such as cars and aeroplanes. This has enabled a wide variety of spatio-temporal applications, resulting in a renewed interest in techniques for handling spatio-temporal data. Over the past two decades or so, a large number of indexes for supporting spatial, temporal and spatio-temporal data have been independently proposed in the database and data mining communities. However, there exists no clear-cut guidelines or a prescriptive formula for pointing out which index should be chosen when specific needs of the underlying application are known. In addition, since spatio-temporal indexes have been proposed under various domains, it is hard for researchers and practitioners to determine whether some specified indexes are indeed available to address the problem at hand. For instance, an index like PO-Tree [7] is suitable for monitoring static spatio-temporal objects (such as sensors, cell-phone towers, etc.) but it is completely undesirable for handling moving object data (e.g., location tracking of cell-phone users, GPS tracking of vehicles and so on). Likewise, if the semantics of the application require indexing trajectories of moving objects, only a specific set of indexes (such as PA-Tree [6]) are useful whereas others such as (APR-Tree [3]) are undesirable.

[1]  Christian S. Jensen,et al.  Indexing the positions of continuously moving objects , 2000, SIGMOD '00.

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

[3]  Steven L. Tanimoto,et al.  Quad-Trees, Oct-Trees, and K-Trees: A Generalized Approach to Recursive Decomposition of Euclidean Space , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  James F. Allen Maintaining knowledge about temporal intervals , 1983, CACM.

[5]  Beng Chin Ooi,et al.  Spatial kd-Tree: A Data Structure for Geographic Database , 1987, BTW.

[6]  Sunil Prabhakar,et al.  Q+Rtree: efficient indexing for moving object databases , 2003, Eighth International Conference on Database Systems for Advanced Applications, 2003. (DASFAA 2003). Proceedings..

[7]  Jan van Leeuwen,et al.  Dynamic multi-dimensional data structures based on quad- and k—d trees , 1982, Acta Informatica.

[8]  Christos Faloutsos,et al.  The R+-Tree: A Dynamic Index for Multi-Dimensional Objects , 1987, VLDB.

[9]  Chin-Wan Chung,et al.  An adaptive indexing technique using spatio-temporal query workloads , 2004, Inf. Softw. Technol..

[10]  Timos K. Sellis,et al.  Review - The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles , 2000, ACM SIGMOD Digital Review.

[11]  Jimeng Sun,et al.  The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries , 2003, VLDB.

[12]  Robert Laurini,et al.  The Po-tree: a Real-time Spatiotemporal Data Indexing Structure , 2004, SDH.

[13]  Chinya V. Ravishankar,et al.  PA-Tree: A Parametric Indexing Scheme for Spatio-temporal Trajectories , 2005, SSTD.

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

[15]  Suman Nath,et al.  COLR-Tree: Communication-Efficient Spatio-Temporal Indexing for a Sensor Data Web Portal , 2008, 2008 IEEE 24th International Conference on Data Engineering.