Main-memory operation buffering for efficient R-tree update

33rd International Conference on Very Large Data Bases, VLDB 2007 - Conference Proceedings

Volumn , Issue , 2007, Pages 591-602

  Biveinis, Laurynas ^a   Šaltenis, Simonas ^a   Jensen, Christian S ^a  

^a AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ANALYTICAL COSTS; DATABASE TECHNOLOGY; EMPIRICAL STUDIES; INDEXING TECHNIQUES; MULTIPLE OPERATIONS; NEW APPLICATIONS; NOCV2; SENSOR TECHNOLOGIES; SPATIAL INDEXES;

DECISION TREES;

EID: 85011016545     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. L. Arge. The buffer tree: A new technique for optimal I/O-algorithms (extended abstract). In Proc. WADS, Volume 955 of Lecture Notes in Computer Science, pp. 334-345. Springer Verlag, 1995.
2. L. Arge, K. Hinrichs, J. Vahrenhold, and J. S. Vitter. Efficient bulk operations on dynamic R-trees. Algorithmica, 33(1): 104-128, 2002.
3. ∗-tree: an efficient and robust access method for points and rectangles. Proc. ACM SIGMOD, pp. 322-331, 1990.
4. J. Van den Bercken, B. Blohsfeld, J.-P. Dittrich, J. Krämer, T. Schäfer, M. Schneider, and B. Seeger. XXL - a library approach to supporting efficient implementations of advanced database queries. In Proc. SSD, pp. 91-108, 1999.
5. J. Van den Bercken and B. Seeger. An evaluation of generic bulk loading techniques. In Proc. VLDB, pp. 461-470, 2001.
6. S. Brakatsoulas, D. Pfoser, and Y. Theodoridis. Revisiting R-tree construction principles. In Proc. ADBIS, pp. 149-162, 2002.
7. R. Choubey, L. Chen, and E. A. Rundensteiner. GBI: A generalized R-tree bulk-insertion strategy. In Proc. SSD, pp. 91-108, 1999.
8. A. Čivilis, C. S. Jensen, and S. Pakalnis. Techniques for efficient road-network-based tracking of moving objects. IEEE TKDE, 17(5): 698-712, 2005.
9. G. Graefe. B-tree indexes for high update rates. SIGMOD Record, 35(1): 39-44, 2006.
10. G. Graefe. Master-detail clustering using merged B-tree indexes. Manuscript, 19 pages, 2007.
11. A. Guttman. R-trees: a dynamic index structure for spatial searching. In Proc. ACM SIGMOD, pp. 47-57, 1984.
12. +-tree-based indexing of moving objects. In Proc. MDM, p. 12, 2006 (e-proceedings).
13. C. S. Jensen, D. Tiešytė, and N. Tradišauskas. The COST benchmark-comparison and evaluation of spatio-temporal indexes. In Proc. DASFAA pp. 125-140, 2006.
14. M.-L. Lee, W. Hsu, C. S. Jensen, B. Cui, and K. L. Teo. Supporting frequent updates in R-trees: a bottom-up approach. In Proc. VLDB, pp. 608-619, 2003.
15. B. Lin and J. Su. Handling frequent updates of moving objects. In Proc. CIKM, pp. 493-500, 2005.
16. D. B. Lomet. Grow and post index trees: roles, techniques and future potential. In Proc. SSD, pp. 183-206, 1991.
17. K. Pollari-Malmi, E. Soisalon-Soininen, and T. Ylönen. Concurrency control in B-trees with batch updates. IEEE TKDE, 8(6):975-984, 1996.
18. M. Raab and A. Steger. "Balls into bins" - a simple and tight analysis. In Proc. RANDOM, pp. 159-170, 1998.
19. S. Šaltenis, C. S. Jensen, S T. Leutenegger, and M. A. Lopez. Indexing the positions of continuously moving objects. In Proc ACM SIGMOD, pp. 331-342, 2000.
20. V. Srinivasan and M. J. Carey. Performance of on-line index construction algorithms. In Proc. EDBT, pp. 293-309, 1992.
21. O. Wolfson, A. P. Sistla, S. Chamberlain, and Y. Yesha. Updating and querying databases that track mobile units. Distributed and Parallel Databases 7(3): 257-387, 1999.
22. O. Wolfson, B. Xu, S. Chamberlain, and L. Jiang. Moving objects databases: issues and solutions. In Proc. SSDBM, pp. 111-122, 1998.
23. X. Xiong and W. G. Aref. R-trees with update memos. In Proc. ICDE, p. 22, 2006 (e-proceedings).
24. X. Xiong, M. F. Mokbel, and W. G. Aref. LUGrid: update-tolerant grid-based indexing for moving objects. In Proc. MDM, p. 13, 2006 (e-proceedings).