ST2B-tree: A self-tunable spatio-temporal B+-tree index for moving objects

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2008, Pages 29-42

  Chen, Su ^a   Ooi, Beng Chin ^a   Tan, Kian Lee ^a   Nascimento, Mario A ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b UNIVERSITY OF ALBERTA   (Canada)

Author keywords

Data distribution; Index tuning; Location based services; Moving object indexing; Self tuning

Indexed keywords

ARSENIC; LOCATION; SETTLING TANKS; TRACKING (POSITION); TUNING; WIRELESS TELECOMMUNICATION SYSTEMS;

DATA DISTRIBUTION; INDEX TUNING; LOCATION-BASED SERVICES; MOVING OBJECT INDEXING; SELF-TUNING;

TREES (MATHEMATICS);

EID: 57149126356     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1376616.1376622     Document Type: Conference Paper

References (20)

1. SpADE: A SPatio-temporal Autonomic Database Engine for location-aware services. http://www.comp.nus.edu.sg/spade/.
2. TPR*-tree. http://www.rtreeportal.org/code.html.
3. M. Ankerst, M. M. Breunig, H.-P. Kriegel, and J. Sander. OPTICS: Ordering Points To Identify the Clustering Structure. In SIGMOD Conference, pages 49-60, 1999.
4. S. Chaudhuri and V. R. Narasayya. An Efficient Cost-Driven Index Selection Tool for Microsoft SQL Server. In VLDB, pages 146-155, 1997.
5. +-tree Index for Moving Objects. Technical Report, 2007.
6. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In KDD, pages 226-231, 1996.
7. S. Guo, Z, Huang, H. V. Jagadish, B. C. Ooi, and Z. Zhang. Relaxed Space Bounding for Moving Objects: A Case for the Buddy Tree. SIGMOD Record, 35(4):24-29, 2006.
8. +-Tree Based Indexing of Moving Objects. In VLDB, pages 768-779, 2004.
9. +-Tree-Based Indexing of Moving Objects. In MDM, page 12, 2006.
10. P. L. Lehman and S. B. Yao. Efficient Locking for Concurrent Operations on B-trees. ACM Trans. Database Syst., 6(4):650-670, 1981.
11. M. F. Mokbel, X. Xiong, and W. G. Aref. SINA: Scalable Incremental Processing of Continuous Queries in Spatio-temporal Databases. In SIGMOD Conference, pages 623-634, 2004.
12. B. Moon, H. V. Jagadish, C. Faloutsos, and J. H. Saltz. Analysis of the Clustering Properties of the Hilbert Space-Filling Curve. TKDE, 13(1): 124-141, 2001.
13. K. Mouratidis, D. Papadias, and M. Hadjieleftheriou. Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring. In SIGMOD Conference, pages 634-645, 2005.
14. J. M. Patel, Y. Chen, and V. P. Chakka. STRIPES: An Efficient Index for Predicted Trajectories. In SIGMOD Conference, pages 637-646, 2004.
15. S. Saltenis, C. S. Jensen, S. T. Leutenegger, and M. A. Lopez. Indexing the Positions of Continuously Moving Objects. In SIGMOD Conference, pages 331-342, 2000.
16. B. Seeger and H.-P. Kriegel. The Buddy Tree: An Efficient and Robust Access Method for Spatial Database. In VLDB, pages 590-601, San Francisco, CA, USA, 1990. Morgan Kaufmann Publishers Inc.
17. Y. Tao, D. Papadias, and J. Sun. The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries. In VLDB, pages 790-801, 2003.
18. Y. Tao, J. Zhang, D. Papadias, and N. Mamoulis. An Efficient Cost Model for Optimization of Nearest Neighbor Search in Low and Medium Dimensional Spaces. TKDE, 16(10):1169-1184, 2004.
19. X. Xiong, M. F. Mokbel, and W. G. Aref. SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases. In ICDE, pages 643-654, 2005.
20. dual-Tiee: Indexing Moving Objects by Space Filling Curves in the Dual Space. VLDB J., accepted for publication, 2008.