Cache-oblivious string dictionaries

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 581-590

  Brodal, Gerth Stølting ^a   Fagerberg, Rolf ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

CACHE MEMORY; DATA STRUCTURES; MATHEMATICAL MODELS; QUERY LANGUAGES; SET THEORY; TREES (MATHEMATICS);

LINEAR SPACES; QUERY COSTS; UNBOUNDED ALPHABETS;

GLOSSARIES;

EID: 33244460885     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109621     Document Type: Conference Paper

References (27)

1. A. Aggarwal and J. S. Vitter. The Input/Output complexity of sorting and related problems. Communications of the ACM, 31(9);1116-1127, 1988.
2. 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.
3. L. Arge, M. A. Bender, E. D. Demaine, B. Holland-Minkley, and J. I. Munro. Cathe-oblivious priority queue and graph algorithm applications. In Proc. 34th Ann. ACM Symposium on Theory of Computing, pages 268-276, 2002.
4. L. Arge, G. S. Brodai, and R. Fagerberg. Cache-oblivious data structures. In D. Mehta and S. Sahni, editors, Handbook on Data Structures and Applications. CRC Press, 2005.
5. L. Arge, P. Ferragina, R. Grossi, and J. Vitter. On sorting strings in external memory. In Proc. Ann. ACM Symposium on Theory of Computation, pages 540-548, 1997.
6. J. Bentley and R. Sedgewick. Fast algorithms for sorting and searching strings. In Proc. 8th ACM-SIAM Symposium on Discrete Algorithms, pages 360-369, 1997.
7. G. S. Brodai. Cache-oblivious algorithms and data structures. In Proc. 9th Scandinavian Workshop on Algorithm Theory, volume 3111 of Lecture Notes in Computer Science, pages 3-13. Springer Verlag, 2004.
8. G. S. Brodai and R. Fagerberg. Cache oblivious distribution sweeping. In Proc. 29th International Colloquium on Automata, Languages, and Programming, volume 2380 of Lecture Notes in Computer Science, pages 426-438. Springer Verlag, 2002.
9. G. S. Brodal and R. Fagerberg. On the limits of cacheobliviousness. In Proc. 35th Ann. ACM Symposium on Theory of Computing, pages 307-315, 2003.
10. G. S. Brodal, R. Fagerberg, and R. Jacob. Cache-oblivious search trees via binary trees of small height. In Proc. 13th Ann. ACM-SIAM Symposium on Discrete Algorithms, pages 39-48, 2002.
11. E. Demaine, J. Iacono, and S. Langerman. Worst-case optimal tree layout in a memory hierarchy. Technical Report cs.DS/0410048, arXiv web repository, 2004.
12. E. D. Demaine. Cache-oblivious data structures and algorithms. In Proc. EFF summer school on massive data sets, Lecture Notes in Computer Science. Springer, To appear.
13. M. Farach. Optimal suffix tree construction with large alphabets. In 38th Ann. Symposium on Foundations of Computer Science, pages 137-143, 1997.
14. M. Farach-Colton, P. Ferragina, and S. Muthukrishnan. On the sorting-complexity of suffix tree construction. J. ACM, 47(6):987-1011, 2000.
15. P. Ferragina and R. Grossi. The string B-tree: a new data structure for string search in external memory and its applications. J. ACM, 46(2):236-280, 1999.
16. E. Fredkin. Trie memory. Communications of the ACM, 3(9):490-499, Sept. 1960.
17. M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache oblivious algorithms. In Proc. 40th Ann. Symposium on Foundations of Computer Science, pages 285-298, 1999.
18. D. Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, 1997.
19. D. Hutchinson, A. Maheshwari, and N. Zeh. An externalmemory data structure for shortest path queries. In Proc. Ann. Combinatorics and Computing Conference, volume 1627 of Lecture Notes in Computer Science, pages 51-60. Springer Verlag, 1999.
20. J. Kärkkäinen and P. Sanders. Simple linear work suffix array construction. In Proc. 30th Int. Colloquium on Automata, Languages and Programming, volume 2719 of Lecture Notes in Computer Science, pages 943-955. Springer Verlag, 2003.
21. D. E. Knuth, J. H. Morris, and V. R. Pratt. Fast pattern matching in strings. SIAM Journal on Computing, 6:323-350, 1977.
22. U. Meyer, P. Sanders, and J. F. Sibeyn, editors. Algorithms for Memory Hierarchies, volume 2625 of Lecture Notes in Computer Science. Springer Verlag, 2003.
23. D. R. Morrison. PATRICIA - practical algorithm to retrieve information coded in alphanumeric. Journal of the ACM, 15(4):514-534, Oct. 1968.
24. H. Prokop. Cache-oblivious algorithms. Master's thesis, Massachusetts Institute of Technology, Cambridge, MA, June 1999.
25. J. S. Vitter. External memory algorithms and data structures: Dealing with MASSIVE data. ACM Computing Surveys, 33(2):209-271, 2001.
26. J. S. Vitter. Geometric and spatial data structures in external memory. In D. Mehta and S. Sahni, editors, Handbook on Data Structures and Applications. CRC Press, 2005.
27. P. Weiner. Linear pattern matching algorithm. In Proc. 14th Ann. IEEE Symposium on Switching and Automata Theory, pages 1-11, 1973.