Cache-oblivious R-trees

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2005, Pages 170-179

  Arge, Lars ^a   De Berg, Mark ^b   Haverkort, Herman ^a  

^a AARHUS UNIVERSITY   (Denmark)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Cache oblivious data structures; Geometric data structures; I O efficiency; R trees

Indexed keywords

BUFFER STORAGE; DATA STRUCTURES; DATA TRANSFER; PROBLEM SOLVING;

CACHE-OBLIVIOUS DATA STRUCTURES; GEOMETRIC DATA STRUCTURES; I/O-EFFICIENCY; R-TREES;

TREES (MATHEMATICS);

EID: 33244493775     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1064092.1064120     Document Type: Conference Paper

References (29)

1. P. K. Agarwal, L. Arge, A. Danner, and B. Holland-Minkley. Cache-oblivious data structures for orthogonal range searching. In Proc. ACM Symposium on Computational Geometry, pages 237-245, 2003.
2. P. K. Agarwal, L. Arge, O. Procopiuc, and J. S. Vitter. A framework for index bulk loading and dynamization. In Proc. International Colloquium on Automata, Languages, and Programming, pages 115-127, 2001.
3. P. K. Agarwal, M. de Berg, J. Gudmundsson, M. Hammar, and H. J. Haverkort. Box-trees and R-trees with near-optimal query time. Discr. Comput. Geom. 28: 291-312 (2002).
4. P. K. Agarwal and J. Erickson. Geometric range searching and its relatives. In B. Chazelle, J. E. Goodman, and R. Pollack, editors, Advances in Discrete and Computational Geometry, volume 223 of Contemporary Mathematics, pages 1-56. American Mathematical Society, Providence, RI, 1999.
5. A. Aggarwal and J. S. Vitter. The Input/Output complexity of sorting and related problems. Communications of the ACM, 31(9):1116-1127, 1988.
6. L. Arge. External memory data structures. In J. Abello, P. M. Pardalos, and M. G. C. Resende, editors, Handbook of Massive Data Sets, pages 313-358. Kluwer Academic Publishers, 2002.
7. L. Arge, M. Bender, E. Demaine, B. Holland-Minkley, and J. I. Munro. Cache-oblivious priority-queue and graph algorithms. In Proc. ACM Symposium on Theory of Computation, pages 268-276, 2002.
8. L. Arge, M. de Berg, H. J. Haverkort, and K. Yi. The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree. Symp. of the ACM Special Interest Group on Management of Data (SIGMOD), Paris, 2004, pages 347-358.
9. L. Arge and J. Vahrenhold. I/O-efficient dynamic planar point location. Computational Geometry: Theory and Applications, 29(2):147-162, 2004.
10. R. Bayer and E. McCreight. Organization and maintenance of large ordered indexes. Acta Informatica, 1:173-189, 1972.
11. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: An efficient and robust access method for points and rectangles. In Proc. SIGMOD International Conference on Management of Data, pages 322-331, 1990.
12. M. A. Bender, R. Cole, and R. Raman. Exponential structures for cache-oblivious algorithms. In Proc. International Colloquium on Automata, Languages, and Programming, pages 195-207, 2002.
13. M. A. Bender, E. D. Demaine, and M Farach-Colton. Cache-oblivious B-trees. In Proc. IEEE Symposium on Foundations of Computer Science, pages 339-409, 2000.
14. M. A. Bender, Z. Duan, J. Iacono, and J. Wu. A locality-preserving cache-oblivious dynamic dictionary. In Proc. ACM-SIAM Symposium on Discrete Algorithms, pages 29-38, 2002.
15. J. L. Bentley. Decomposable searching problems. Information Processing Letters, 8(5):244-251, 1979.
16. G. S. Brodal, R. Fagerberg, and R. Jacob. Cache oblivious search trees via binary trees of small height. In Proc. ACM-SIAM Symposium on Discrete Algorithms, pages 39-48, 2002.
17. G. S. Brodal and R. Fagerberg. Funnel heap - a cache oblivious priority queue. In Proc. International Symposium on Algorithms and Computation, LNCS 2518, pages 219-228, 2002.
18. D. Comer. The ubiquitous B-tree. ACM Computing Surveys, 11(2):121-137, 1979.
19. M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In Proc. IEEE Symposium on Foundations of Computer Science, pages 285-298, 1999.
20. V. Gaede and O. Günther. Multidimensional access methods. ACM Computing Surveys, 30(2):170-231, 1998.
21. A. Guttman. R-trees: A dynamic index structure for spatial searching. In Proc. SIGMOD International Conference on Management of Data, pages 47-57, 1984.
22. H. J. Haverkort. Results on Geometric Networks and Data Structures. PhD thesis, Utrecht University, 2004.
23. I. Kamel and C. Faloutsos. Hilbert R-tree: An improved R-tree using fractals. In Proc. International Conference on Very Large Databases, pages 500-509, 1994.
24. K. V. R. Kanth and A. K. Singh. Optimal dynamic range searching in non-replicating index structures. In Proc. International Conference on Database Theory, LNCS 1540, pages 257-276, 1999.
25. Y. Manolopoulos, A. Nanopoulos, A. N. Papadopoulos, and Y. Theodoridis. R-trees have grown everywhere. Submitted to ACM Computing Surveys, 2003.
26. H. Prokop. Cache-oblivious algorithms. Master's thesis, Massachusetts Institute of Technology, Cambridge, MA, June 1999.
27. N. Rahman, R. Cole, and R. Raman. Optimized predecessor data structures for internal memory. In Proc. Workshop on Algorithm Engineering, LNCS 2141, pages 67-78, 2001.
28. +-tree: A dynamic index for multi-dimensional objects. In Proc. International Conference on Very Large Databases, pages 507-518, 1987.
29. J. S. Vitter. External memory algorithms and data structures: Dealing with MASSIVE data. ACM Computing Surveys, 33(2):209-271, 2001.