Efficient tree layout in a multilevel memory hierarchy

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2461, Issue , 2002, Pages 165-173

  Bender, Michael A ^a   Demaine, Erik D ^b   Farach Colton, Martin ^c,d  

^a Stony Brook University   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c GOOGLE INC   (United States)

^d RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FORESTRY; MEMORY ARCHITECTURE; PROBABILITY DISTRIBUTIONS;

CONSTANT FACTORS; GREEDY ALGORITHMS; HIERARCHICAL MEMORY; HIGH COMPLEXITY; MULTI-LEVEL MEMORY HIERARCHY; NUMBER OF BLOCKS; QUERY PERFORMANCE; SEARCH OPERATIONS;

CACHE MEMORY;

ALGORITHMS; PROBLEM SOLVING;

EID: 84938059710     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45749-6_18     Document Type: Conference Paper

References (22)

1. A. Aho, J. Hopcroft, and J. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974. 166
2. L. Arge, M. A. Bender, E. D. Demaine, B. Holland-Minkley, and J. I. Munro. Cache-oblivious priority queue and graph algorithm applications. In Proc. 34th Annual ACM Symposium on Theory of Computing, pages 268–276, 2002. 166
3. M. Baker, J. Hartman, M. Kupfer, K. Shirriff, and J. Ousterhout. Measurements of a distributed file system. In Proc. 13th Symposium on Operating Systems Principles, pages 198–212, 1991. 165
4. R. Bayer and E.M. McCreight. Organization and maintenance of large ordered indexes. Acta Informatica, 1(3):173–189, February 1972. 165
5. M. A. Bender, R. Cole, and R. Raman. Exponential structures for efficient cacheoblivious algorithms. In Proc. 29th International Colloquium on Automata, Languages, and Programming, 2002. To appear. 166
6. M. A. Bender, E. Demaine, and M. Farach-Colton. Cache-oblivious B-trees. In Proc. 41st Annual Symposium on Foundations of Computer Science, pages 399-409, 2000. 166
7. M. A. Bender, Z. Duan, J. Iacono, and J. Wu. A locality-preserving cacheoblivious dynamic dictionary. In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 29–38, 2002. 166
8. G. S. Brodal, R. Fagerberg, and R. Jacob. Cache oblivious search trees via binary trees of small height (extended abstract). In Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms, 2002. 166
9. M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In Proc. 40th Annual Symposium on Foundations of Computer Science, pages 285–297, New York, October 1999. 166
10. J. Gil and A. Itai. Packing trees. In Proc. 3rd Annual European Symposium on Algorithms, pages 113–127, 1995. 166, 167
11. J. Gil and A. Itai. How to pack trees. Journal of Algorithms, 32(2):108–132,1999. 166, 167
12. T. C. Hu and P. A. Tucker. Optimal alphabetic trees for binary search. Information Processing Letters, 67(3):137–140, 1998. 166
13. D. A. Huffman. A method for the construction of minimum-redundancy codes. Proc. IRE, 40(9):1098–1101, 1952. 166
14. J. Iacono. Alternatives to splay trees with O(log n) worst-case access times. In Proc. 11th Symposium on Discrete Algorithms, pages 516–522, 2001. 166
15. D.E. Knuth. The Art of Computer Programming, V. 3: Sorting and Searching. Addison-Wesley, Reading, 1973. 166
16. J. K. Ousterhout, H.D. Costa, D. Harrison, J. A. Kunze, M. Kupfer, and J.G. Thompson. At race-driven analysis of the UNIX 4.2 BSD File System. In Proc. 10th Symposium on Operating Systems Principles, pages 15–24, 1985. 165
17. H. Prokop. Cache-oblivious algorithms. Master’s thesis, Massachusetts Institute of Technology, Cambridge, MA, June 1999. 166
18. N. Rahman, R. Cole, and R. Raman. Optimized predecessor data structures for internal memory. In Proc. 5th Workshop on Algorithms Engineering, pages 67–78, 2001. 166
19. D. Roselli, J. Lorch, and T. Anderson. A comparison of file system workloads. In Proc. 2000 USENIX Annual Technical Conference, pages 41–54, 2000. 165
20. D.D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32(3):652–686, July 1985. 166
21. S. Thite. Optimum binary search trees on the hierarchical memory model. Master’sthesis, Department of Computer Science, University of Illinios at Urbana-Champaign, 2001. 166
22. W. Vogels. File system usage inWindows NT 4.0. In Proc. 17th ACM Symposiumon Operating Systems Principles, pages 93–109, 1999. 165