Cache oblivious search trees via binary trees of small height

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 39-48

  Brodal, Gerth Stølting ^a   Fagerberg, Rolf ^a   Jacob, Riko ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

BINS; CACHE MEMORY; DATA STRUCTURES; PSYCHOPHYSIOLOGY; TREES (MATHEMATICS);

CACHE-OBLIVIOUS; COMPLEXITY BOUNDS; DATA ELEMENTS; ELEMENT SIZES; EMPIRICAL - COMPARISONS; RANGE QUERY; SEARCH TREES; SPACE UTILIZATION;

BINARY TREES;

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

References (23)

1. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Communications of the ACM, 31(9):1116-1127, Sept. 1988.
2. A. Andersson and T. W. Lai. Fast updating of well-balanced trees. In SWAT 90, 2nd Scandinavian Workshop on Algorithm Theory, volume 447 of Lecture Notes in Computer Science, pages 111-121. Springer, 1990.
3. L. Arge and J. S. Vitter. Optimal dynamic interval management in external memory. In Proc. 37th Ann. Symp. on Foundations of Computer Science, pages 560-569. IEEE Computer Society Press, 1996.
4. R. Bayer and E. McCreight. Organization and maintenance of large ordered indexes. Acta Informatica, 1:173-189, 1972.
5. M. A. Bender, E. Demaine, and M. Farach-Colton. Cache-oblivious B-trees. In Proc. 41ist Ann. Symp. on Foundations of Computer Science, pages 399-409. IEEE Computer Society Press, 2000.
6. M. A. Bender, Z. Duan, J. Iacono, and J. Wu. A locality-preserving cache-oblivious dynamic dictionary. In Proc. 13th Ann. ACM-SIAM Symp. on Discrete Algorithms, 2002.
7. S. Carlsson, P. V. Poblete, and J. I. Munro. An implicit binomial queue with constant insertion time. In Proc. 1st Scandinavian Workshop on Algorithm Theory, volume 318 of Lecture Notes in Computer Science, pages 1-13. Springer Verlag, Berlin, 1988.
8. S. Chatterjee, V. V. Jain, A. R. Lebeck, S. Mundhra, and M. Thottethodi. Nonlinear array layouts for hierarchical memory systems. In Proceedings of the 1999 Conference on Supercomputing, ACM SIGARCH, pages 444-453. ACM Press, 1999.
9. P. F. Dietz and J. Zhang. Lower bounds for monotonie list labeling. In J. R. Gilbert and R. G. Karlsson, editors, SWAT 90, 2nd Scandinavian Workshop on Algorithm Theory, volume 447 of Lecture Notes in Computer Science, pages 173-180. Springer, 1990.
10. R. Fagerberg. The complexity of rebalancing a binary search tree. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, 19, 1999.
11. A. Fiat, J. I. Munro, M. Naor, A. A. Schäffer, J. P. Schmidt, and A. Siegel. An implicit data structure for searching a multikey table in logarithmic time. Journal of Computer and System Sciences, 43(3):406-424, 1991.
12. M. Frigo, C. E. Leiserson, H. Prokop, and S. Ra-machandran. Cache-oblivious algorithms. In 40th Annual Symposium on Foundations of Computer Science, pages 285-297. IEEE Computer Society Press, 1999.
13. J. L. Hennessy and D. A. Patterson. Computer Architecture: A Quantitative Approach. Morgan Kaufmann, second edition, 1996.
14. A. Itai, A. G. Konheim, and M. Rodeh. A sparse table implementation of priority queues. In Automata, Languages and Programming, 8th Colloquium, volume 115 of Lecture Notes in Computer Science, pages 417-431. Springer-Verlag, 1981.
15. D. W. Jones. An Empirical Comparison of Priority-Queue and Event-Set Implementations. Communications of the ACM, 29(4):300-311, 1986.
16. A. LaMarca and R. E. Ladner. The influence of caches on the performance of heaps. A CM Journal of Experimental Algorithms, 1:4, 1996.
17. K. Mehlhorn and S. Näher. LED A: A Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999.
18. J. I. Munro. An implicit data structure supporting insertion, deletion, and search in O(log2 n) time. Journal of Computer and System Sciences, 33(1):66-74, 1986.
19. H. Prokop. Cache-oblivious algorithms. Master's thesis, Massachusetts Institute of Technology, June 1999.
20. N. Rahman, R. Cole, and R. Raman. Optimized predecessor data structures for internal memory. In WAE 2001, 5th Int. Workshop on Algorithm Engineering, volume 2141 of LNCS, pages 67-78. Springer, 2001.
21. P. van Emde Boas. Preserving order in a forest in less than logarithmic time and linear space. Inf. Process. Lett., 6:80-82, 1977.
22. P. van Emde Boas, R. Kaas, and E. Zijlstra. Design and implementation of an efficient priority queue. Mathematical Systems Theory, 10:99-127, 1977.
23. J. W. J. Williams. Algorithm 232: Heapsort. Communications of the ACM, 7(6):347-348, 1964.