Cache-oblivious data structures for orthogonal range searching

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2003, Pages 237-245

  Agarwal, Pankaj K ^a   Arge, Lars ^a   Danner, Andrew ^a   Holland Minkley, Bryan ^a  

^a Duke University   (United States)

Author keywords

Cache oblivious; Orthogonal range searching

Indexed keywords

ALGORITHMS; CACHE MEMORY; COMPUTATIONAL COMPLEXITY; HIERARCHICAL SYSTEMS; PROBLEM SOLVING; QUERY LANGUAGES; SET THEORY;

MULTILEVEL MEMORY HIERARCHY;

DATA STRUCTURES;

EID: 0038038206     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/777825.777828     Document Type: Conference Paper

References (26)

1. P. K. Agarwal, L. Arge. O. Procopiuc, and J. S. Vitter. A framework for index bulk loading and dynamization. In Proc. Annual International Colloquium on Automata, Languages, and Programming, pages 115-127, 2001.
2. P. K. Agarwal, L. Arge, O. Procopiuc, and J. S. Vitter. Bkd-tree: A dynamic scalable kd-tree. Manuscript, 2002.
3. 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.
4. A. Aggarwal and J. S. Vitter. The Input/Output complexity of sorting and related problems. Communications of the ACM, 31(9):1116-1127, 1988.
5. A. Andersson and M. Thorup. Tight(er) worst-case bounds on dynamic searching and priority queues. In Proc. ACM Symp. on Theory of Computation, pages 335-342, 2000.
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 Symp. on Theory of Computation, pages 268-276, 2002.
8. L. Arge, V. Samoladas, and J. S. Vitter. On two-dimensional indexability and optimal range search indexing. In Proc. ACM Symp. Principles of Database Systems, pages 346-357, 1999.
9. R. Bayer and E. McCreight. Organization and maintenance of large ordered indexes. Acta Informatica, 1:173-189, 1972.
10. M. Bender, R. Cole, E. Demaine, and M. Farach-Colton. Scanning and traversing: Maintaining data for traversals in memory hierarchy. In Proc. Annual European Symposium on Algorithms, pages 152-164, 2002.
11. M. A. Bender, R. Cole, and R. Raman. Exponential structures for cache-oblivious algorithms. In Proc. Annual International Colloquium on Automata, Languages, and Programming, pages 195-207, 2002.
12. M. A. Bender, E. D. Demaine, and M. Farach-Colton. Cache-oblivious B-trees. In Proc. IEEE Symp. on Foundations of Comp. Sci., pages 339-409, 2000.
13. M. A. Bender, Z. Duan, J. Iacono, and J. Wu. A locality-preserving cache-oblivious dynamic dictionary. In Proc. ACM-SIAM Symp. on Discrete Algorithms, pages 29-38, 2002.
14. J. L. Bentley. Multidimensional binary search trees used for associative searching. Communications of the ACM, 18:509-517, 1975.
15. J. L. Bentley. Decomposable searching problems. Information Processing Letters, 8(5):244-251, 1979.
16. G. S. Brodal and R. Fagerberg. Cache oblivious distribution sweeping. In Proc. Annual International Colloquium on Automata, Languages, and Programming, pages 426-438, 2002.
17. G. S. Brodal, R. Fagerberg, and R. Jacob. Cache oblivious search trees via binary trees of small height. In Proc. ACM-SIAM Symp. on Discrete Algorithms, pages 39-48, 2002.
18. B. Chazelle. Filtering search: a new approach to query-answering. SIAM J. Comput., 15(3):703-724, 1986.
19. B. Chazelle. A functional approach to data structures and its use in multidimensional searching. SIAM J. Comput., 17(3):427-462, June 1988.
20. B. Chazelle. Lower bounds for orthogonal range searching: I. the reporting case. Journal of the ACM, 37(2):200-212, Apr. 1990.
21. D. Comer. The ubiquitous B-tree. ACM Computing Surveys, 11(2):121-137, 1979.
22. M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In Proc. IEEE Symp. on Foundations of Comp. Sci., pages 285-298, 1999.
23. H. Prokop. Cache-oblivious algorithms. Master's thesis, Massachusetts Institute of Technology, Cambridge, MA, June 1999.
24. 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.
25. J. Robinson. The K-D-B tree: A search structure for large multidimensional dynamic indexes. In Proc. SIGMOD Intl. Conf. on Management of Data, pages 10-18, 1981.
26. J. S. Vitter. External memory algorithms and data structures: Dealing with MASSIVE data. ACM Computing Surveys, 33(2):209-271, 2001.