Cache-oblivious string B-trees

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2006, Pages 233-242

  Bender, Michael A ^a   Farach Colton, Martin ^b   Kuszmaul, Bradley C ^c  

^a STONY BROOK UNIVERSITY   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Cache oblivious string B tree; Locality preserving front compression; Packed memory array; Range query; Rebalance

Indexed keywords

CACHE OBLIVIOUS STRING B-TREE; LOCALITY PRESERVING FRONT COMPRESSION; PACKED-MEMORY ARRAY; RANGE QUERY; REBALANCE;

DATA COMPRESSION; DIGITAL LIBRARIES; HIERARCHICAL SYSTEMS; QUERY LANGUAGES; SEARCH ENGINES;

DATA STRUCTURES;

EID: 34250689978     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1142351.1142385     Document Type: Conference Paper

References (32)

1. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Commun. ACM, 31(9): 1116-1127, Sept. 1988.
2. S. Alstrup, M. A. Bender, E. D. Demaine, M. Farach-Colton, T. Rauhe, and M. Thorup. Efficient tree layout in a multilevel memory hierarchy. arXiv:cs.DS/0211010,2004. http://www.arXiv.org/pdf/cs.DS/0211010.
3. A. Amir, M. Farach, and Y. Matias. Efficient randomized dictionary matching algorithms (extended abstract). In Proc. 3rd Symp. on Combinatorial Pattern Matching (CPM), pp. 262-275,Tucson, Arizona, Apr. 1992.
4. R. Bayer and E. M. McCreight. Organization and maintenance of large ordered indexes. Acta Inf., 1(3):173-189, Feb. 1972.
5. R. Bayer and K. Unterauer. Prefix B-trees. ACM Trans. Database Syst., 2(1):11-26, 1977.
6. M. A. Bender, R. Cole, E. Demaine, M. Farach-Colton, and J. Zito. Two simplified algorithms for maintaining order in a list. In Proc. 10th European Symp. on Algorithms (ESA), pp. 152-164, Rome, Italy, Sept. 2002.
7. M. A. Bender, R. Cole, E. D. Demaine, and M. Farach-Colton. Scanning and traversing: Maintaining data for traversals in a memory hierarchy. In Proc. 10th Annual European Symp. on Algorithms (ESA), pp. 139-151, Rome, Italy, Sept. 2002.
8. M. A. Bender, E. Demaine, and M. Farach-Colton. Cache-oblivious B-trees. In Proc. 41st Annual Symp. on Foundations of Computer Science (FOCS), pp. 399-409, Redondo Beach, California, 2000.
9. M. A. Bender, E. Demaine, and M. Farach-Colton. Cache-oblivious B-trees. SIAM J. Comput., 35(2):341-358, 2005.
10. M. A. Bender, Z. Duan, J. Iacono, and J. Wu. A locality-preserving cacheoblivious dynamic dictionary. In Proc. 13th Annual Symp. on Discrete Mathematics (SODA), pp. 29-38, San Francisco, California, Jan. 2002.
11. M. A. Bender, Z. Duan, J. Iacono, and J. Wu. A locality-preserving cacheoblivious dynamic dictionary. J. Algorithms, 3(2): 115-136, 2004.
12. G. S. Brodai and R. Fagerberg. Cache-oblivious string dictionaries. In Proc. 17th Annual Symposium on Discrete Algorithm (SODA), pp. 581-590, Miami, Florida, Jan. 2006.
13. G. S. Brodai, R. Fagerberg, and R. Jacob. Cache oblivious search trees via binary trees of small height. In Proc. 13th Annual Symposium on Discrete Algorithms (SODA), pp. 39-48, San Francisco, California, Jan. 2002.
14. H. K. Chang. Compressed indexing method. IBM Technical Disclosure Bulletin, 11(11):1400-1401, 1969.
15. W. A. Clark IV, K. A. Salmond, and T. A. Stafford. Method and means for generating compressed keys. US Patent 3,593,309,3 Jan. 1969.
16. D. Comer. The ubiquitous B-tree. ACM Comput. Surv., 11(2):121-137, June 1979.
17. E. D. Demaine, J. Iacono, and S. Langerman. Worst-case optimal tree layout in a memory hierarchy. Manuscript. arXiv:DS/0410048, 2004. http://john2.poly.edu/papers/manu04/paper.pdf.
18. P. F. Dietz and D. D. Sleator. Two algorithms for maintaining order in a list. In Proc. 19th Annual Symposium on Theory of Computing (STOC), pp. 365-372, 1987.
19. 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, Mar. 1999.
20. M. L. Fredman and D. E. Willard. Surpassing the information theoretic bound with fusion trees. J. Comput. Syst. Science, 47:424-436, 1994.
21. M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In Proc. 40th Annual Symp. on Foundations of Computer Science (FOCS), pp. 285-297, New York, New York, Oct. 1999.
22. J. Gil and A. Itai. How to pack trees. J. Algorithms, 32(2): 108-132, 1999.
23. A. Itai, A. G. Konheim, and M. Rodeh. A sparse table implementation of priority queues. In Proc. 8th Internationl Colloquium on Automata, Languages, and Programming (ICALP), vol. 115, pp. 417-431, Acre (Akko), Israel, July 1981.
24. R. M. Karp and M. O. Rabin. Efficient randomized pattern-matching algorithms. IBM J. Res. Dev., 31(2):249-260, Mar. 1987.
25. I. Katriel. Implicit data structures based on local reorganizations. Master's thesis, Technion, Israel Inst. of Tech., Haifa, May 2002.
26. D. E. Knuth. Sorting and Searching, vol. 3 of The Art of Computer Programming. Addison-Wesley, Reading, Massachusetts, 1973.
27. K. Mehlhorn. Data Structures and Algorithms 1: Sorting and Searching, pp. 198-199. Springer-Verlag, Berlin, 1984.
28. M. Naor. String matching with preprocessing of text and pattern. In Prac. 18th International Colloquium on Automata, Languages and Programming (ICALP), pp. 739-750, 1991.
29. H. Prokop. Cache-oblivious algorithms. Master's thesis, Department of Electrical Engineering and Computer Science, Massachusetts Inst. of Tech., June 1999.
30. Sleepycat Software. The Berkeley Database. http://www.sleepyoat.com, 2005.
31. K. A. Smith and M. I. Seltzer. File system aging - increasing the relevance of file system benchmarks. In Proc. 1997 ACM SIGMETRICS Conf. on Measurement and Modeling of Computer Systems, pp. 203-213, Seattle, Washington, 1997.
32. R. E. Wagner. Indexing design considerations. IBM Syst. J., 12(4):351-367, 1973.