The COST Benchmark-Comparison and Evaluation of Spatio-temporal Indexes

An infrastructure is emerging that enables the positioning of populations of on-line, mobile service users. In step with this, research in the management of moving objects has attracted substantial attention. In particular, quite a few proposals now exist for the indexing of moving objects, and more are underway. As a result, there is an increasing need for an independent benchmark for spatio-temporal indexes. This paper characterizes the spatio-temporal indexing problem and proposes a benchmark for the performance evaluation and comparison of spatio-temporal indexes. Notably, the benchmark takes into account that the available positions of the moving objects are inaccurate, an aspect largely ignored in previous indexing research. The concepts of data and query enlargement are introduced for addressing inaccuracy. As proof of concepts of the benchmark, the paper covers the application of the benchmark to three spatio-temporal indexes—the TPR-, TPR*-, and Bx-trees. Representative experimental results and consequent guidelines for the usage of these indexes are reported.

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

[2]  Jim Gray,et al.  Benchmark Handbook: For Database and Transaction Processing Systems , 1992 .

[3]  Kotagiri Ramamohanarao,et al.  Guidelines for presentation and comparison of indexing techniques , 1996, SGMD.

[4]  P. Werstein A Performance Benchmark for Spatiotemporal Databases , 1998 .

[5]  Dieter Pfoser,et al.  Capturing the Uncertainty of Moving-Object Representations , 1999, SSD.

[6]  Yannis Theodoridis,et al.  On the Generation of Spatiotemporal Datasets , 1999 .

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

[8]  Geoffrey Blewitt,et al.  Basics of the GPS Technique : Observation Equations , 2000 .

[9]  Yannis Theodoridis,et al.  Generating spatiotemporal datasets on the WWW , 2000, SGMD.

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

[11]  Jussi Myllymaki,et al.  LOCUS: A Testbed for Dynamic Spatial Indexing. , 2002 .

[12]  Pankaj K. Agarwal,et al.  STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects , 2002, ALENEX.

[13]  Christian S. Jensen,et al.  Indexing of moving objects for location-based services , 2002, Proceedings 18th International Conference on Data Engineering.

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

[15]  Jussi Myllymaki,et al.  DynaMark: A Benchmark for Dynamic Spatial Indexing , 2003, Mobile Data Management.

[16]  Yannis Theodoridis,et al.  Ten Benchmark Database Queries for Location-based Services , 2003, Comput. J..

[17]  Sharad Mehrotra,et al.  Approximate selection queries over imprecise data , 2004, Proceedings. 20th International Conference on Data Engineering.

[18]  A. Prasad Sistla,et al.  Updating and Querying Databases that Track Mobile Units , 1999, Distributed and Parallel Databases.

[19]  Yannis Manolopoulos,et al.  Benchmarking access methods for time-evolving regional data , 2004, Data Knowl. Eng..

[20]  Jignesh M. Patel,et al.  STRIPES: an efficient index for predicted trajectories , 2004, SIGMOD '04.

[21]  Sunil Prabhakar,et al.  Querying imprecise data in moving object environments , 2003, IEEE Transactions on Knowledge and Data Engineering.

[22]  Christian S. Jensen,et al.  Efficient tracking of moving objects with precision guarantees , 2004, The First Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services, 2004. MOBIQUITOUS 2004..

[23]  Beng Chin Ooi,et al.  Query and Update Efficient B+-Tree Based Indexing of Moving Objects , 2004, VLDB.

[24]  Yufei Tao,et al.  Indexing Multi-Dimensional Uncertain Data with Arbitrary Probability Density Functions , 2005, VLDB.