Cache-oblivious dynamic dictionaries with update/query tradeoffs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2010, Pages 1448-1456

  Brodal, Gerth Stølting ^a   Demaine, Erik D ^b   Fineman, Jeremy T ^b   Iacono, John ^c   Langerman, Stefan ^d   Munro, J Ian ^e  

^a AARHUS UNIVERSITY   (Denmark)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c POLYTECHNIC UNIVERSITY   (United States)

^d UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^e UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; PSYCHOPHYSIOLOGY; TREES (MATHEMATICS);

BLOCK SIZES; CACHE-OBLIVIOUS; DYNAMIC DICTIONARIES; EXTERNAL MEMORY MODELS; INSERTIONS AND DELETIONS; OPTIMAL TRADEOFFS; PREDECESSOR QUERIES; UPDATE COSTS;

CACHE MEMORY;

EID: 77951676777     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973075.117     Document Type: Conference Paper

References (10)

1. Alok Aggarwal and Jeffrey Scott Vitter. The input/output complexity of sorting and related problems. Communications of the ACM, 31(9):1116-1127, September 1988.
2. Rudolf Bayer and Edward M. McCreight. Organization and maintenance of large ordered indexes. Acta Informatica, 1(3):173-189, February 1972.
3. Michael A. Bender, Erik D. Demaine, and Martin Farach-Colton. Cache-oblivious B-trees. SIAM Journal on Computing, 35(2):341-358, 2005.
4. Michael A. Bender, Ziyang Duan, John Iacono, and Jing Wu. A locality-preserving cache-oblivious dynamic dictionary. Journal of Algorithms, 53(2):115-136, 2004.
5. Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Yonatan R. Fogel, Bradley C. Kuszmaul, and Jelani Nelson. Cache-oblivious streaming B-trees. In Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 81-92, San Diego, CA, June 2007.
6. Gerth Stølting Brodai and Rolf Fagerberg. Lower bounds for external memory dictionaries. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 546-554, Baltimore, MD, January 2003.
7. Gerth Stølting Brodal, Rolf Fagerberg, and Riko Jacob. Cache oblivious search trees via binary trees of small height. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 39-48, San Francisco, CA, January 2002.
8. Bernard Chazelle and Leonidas J. Guibas. Fractional cascading: I. A data structuring technique. Algorithmica, 1(2):133-162, 1986.
9. Matteo Frigo, Charles E. Leiserson, Harald Prokop, and Sridhar Ramachandran. Cache-oblivious algorithms. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pages 285-297, New York, NY, 1999.
10. Harald Prokop. Cache-oblivious algorithms. Master's thesis, Massachusetts Institute of Technology, Cambridge, MA, June 1999.