Optimal worst-case operations for implicit cache-oblivious search trees

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

Volumn 2748, Issue , 2003, Pages 114-126

  Franceschini, Gianni ^a   Grossi, Roberto ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES;

BLOCK SIZES; BLOCK TRANSFER; CACHE-OBLIVIOUS; MEMORY CELL; MEMORY HIERARCHY; SEARCH TREES; SINGLE CELLS;

CACHE MEMORY;

EID: 35248884409     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45078-8_11     Document Type: Article

References (20)

1. Alfred V. Aho, John E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, 1974.
2. L. Arge and J. S. Vitter. Optimal dynamic interval management in external memory. In IEEE, editor, 37th Annual Symposium on Foundations of Computer Science: October 14-16, 1996, Burlington, Vermont, pages 560-569, USA, 1996. IEEE Computer Society Press.
3. M. A. Bender, E. D. Demaine, and M. Farach-Colton. Cache-oblivious B-trees. In IEEE, editor, 41st Annual Symposium on Foundations of Computer Science: proceedings: 12-14 November, 2000, Redondo Beach, California, pages 399-409, USA, 2000. IEEE Computer Society Press.
4. Michael A. Bender, Richard Cole, and Rajeev Raman. Exponential structures for efficient cache-oblivious algorithms. International Colloquium on Automata, Languages and Programming, LNCS, 2380:195-206, 2002.
5. Gerth Stølting Brodal, Rolf Fagerberg, and Riko Jacob. Cache-oblivious search trees via trees of small height. In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 39-48, 2002.
6. P. Dietz and D. Sleator. Two algorithms for maintaining order in a list. In Alfred Aho, editor, Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pages 365-372, 1987. ACM Press.
7. Gianni Franceschini and Roberto Grossi. Implicit dictionaries supporting searches and amortized updates in O(log n log log n). In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'03), pages 670-678. SIAM, 2003.
8. Gianni Franceschini and Roberto Grossi. Optimal cache-oblivious implicit dictionaries. International Colloquium on Automata, Languages and Programming, LNCS, 2003.
9. Gianni Franceschini and Roberto Grossi. Optimal implicit and cache-oblivious dictionaries over unbounded universes. Full version, 2003.
10. Gianni Franceschini and Roberto Grossi. Optimal space-time dictionaries over an unbounded universe with flat implicit trees. Technical report TR-03-03, January 30, 2003.
11. Gianni Franceschini, Roberto Grossi, J. Ian Munro, and Linda Pagli. Implicit B-trees: New results for the dictionary problem. In IEEE Symposium on Foundations of Computer Science (FOCS), 2002.
12. Greg N. Frederickson. Implicit data structures for the dictionary problem. Journal of the ACM, 30(1):80-94, 1983.
13. M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In IEEE, editor, 40th Annual Symposium on Foundations of Computer Science: October 17-19, 1999, New York City, New York, pages 285-297, 1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA, 1999. IEEE Computer Society Press.
14. Alon Itai, Alan G. Konheim, and Michael Rodeh. A sparse table implementation of priority queues. In Shimon Even and Oded Kariv, editors, International Colloquium on Automata, Languages and Programming, volume 115 of Lecture Notes in Computer Science, pages 417-431, 1981.
15. D. E. Knuth. The Art of Computer Programming III: Sorting and Searching. Addison-Wesley, Reading, Massachusetts, 1973.
16. 2 n) time. Journal of Computer and System Sciences, 33(1):66-74, 1986.
17. J. Ian Munro and Hendra Suwanda. Implicit data structures for fast search and update. Journal of Computer and System Sciences, 21(2):236-250, 1980.
18. Dan E. Willard. A density control algorithm for doing insertions and deletions in a sequentially ordered file in good worst-case time. Information and Computation, 97(2):150-204, April 1992.
19. J. W. J. Williams. Algorithm 232: Heapsort. Communications of the ACM, 7:347-348, 1964.
20. Andrew C. Yao. Should tables be sorted? J. Assoc. Comput. Mach., 31:245-281, 1984.