Relaxed space bounding for moving objects: A case for the buddy tree

SIGMOD Record

Volumn 35, Issue 4, 2006, Pages 24-29

  Guo, Shuqiao ^a   Huang, Zhiyong ^a   Jagadish, H V ^b   Ooi, Beng Chin ^a   Zhang, Zhenjie ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; POSITION MEASUREMENT; PROBLEM SOLVING; TRACKING (POSITION); WIRELESS TELECOMMUNICATION SYSTEMS;

BUDDY TREE; MINIMUM BOUNDING RECTANGLE (MBR); RELAXED SPACE BOUNDING;

TREES (MATHEMATICS);

EID: 33847035228     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/1228268.1228272     Document Type: Article

References (17)

1. N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger. The R*-tree: an efficient and robust access method for points and rectangles. In the Proceedings of ACM SIGMOD, 1990.
2. H. D. Chon, D. Agrawal, and A. E. Abbadi. Using space-time grid for efficient management of moving objects. In the Second ACM international workshop on Data engineering for wireless and mobile access, 2001.
3. D. Comer. The ubiquitous b-tree. ACM Computing Surveys, 11(2):121-137, 1979.
4. B. Cui, D. Lin, and K. L. Tan. Towards optimal utilization of main memory for moving object indexing. In Proceedings of DASFAA, 2005.
5. A. Guttman. R-trees: A dynamic index structure for spatial searching. In the Proceedings of ACM SIGMOD, 1984.
6. C. S. Jensen, D. Lin, and B. C. Ooi. Query and update efficient b+-tree based indexing of moving objects. In Proceedings of VLDB, 2004.
7. G. Kollios, D. Gunopulos, and V. J. Tsotras. Nearest neighbor queries in a mobile environment. In Proceedings of the International Workshop on Spatio-Temporal Database Management, 1999.
8. G. Kollios, D. Gunopulos, and V. J. Tsotras. On indexing mobile objects, pages 261-272, 1999.
9. M. Komacker and D. Banks. High-concurrency locking in r-trees. In Proceedings of VLDB, pages 134-145, 1995.
10. P. Lehman and S. Yao. Efficient locking for concurrent operations on b-trees. ACMTODS, 6(4), Dec. 1981.
11. J. Nievergelt, H. Hinterberger, and K. C. Sevcik. The Grid File: An adaptable, symmetric multikey file structure. ACM TODS, 9(1):38-71, 1984.
12. B. C. Ooi, K. L. Tan, and C. Yu. Frequent update and efficient retrieval: an oxymoron on moving object indexes? In Proceedings of International Web GIS Workshop, 2002.
13. S. Saltenis, C. S. Jensen, S. T. Leutenegger, and M. A. Lopez. Indexing the positions of continuously moving objects. In the Proceedings of ACM SIGMOD, pages 331-342, 2000.
14. B. Seeger and H. P. Krieger. The buddy-tree: An efficient and robust access method for spatial data base systems. In Proceedings of VLDB, pages 590-601, Aug. 1990.
15. A. P. Sistla, O. Wolfson, S. Chamberlain, and S. Dao. Modeling and querying moving objects. In the Proceedings of ICDE, pages 422-432, 1997.
16. Z. Song and N. Roussopoulos. Hashing moving objects. In the Proceedings of the 2nd International Conference on Mobile Data Management, 2001.
17. Y. Tao, D. Papadias, and J. Sun. The TPR*-tree: An optimized spatio-temporal access method for predictive queries. In the Proceedings of VLDB, 2003.