Paper by Erik D. Demaine

Michael A. Bender, Erik D. Demaine, and Martin Farach-Colton, “Cache-Oblivious B-Trees”, SIAM Journal on Computing, volume 35, number 2, 2005, pages 341–358.

This paper presents two dynamic search trees attaining near-optimal performance on any hierarchical memory. The data structures are independent of the parameters of the memory hierarchy, e.g., the number of memory levels, the block-transfer size at each level, and the relative speeds of memory levels. The performance is analyzed in terms of the number of memory transfers between two memory levels with an arbitrary block-transfer size of B; this analysis can then be applied to every adjacent pair of levels in a multilevel memory hierarchy. Both search trees match the optimal search bound of Θ(1 + logB+1 N) memory transfers. This bound is also achieved by the classic B-tree data structure on a two-level memory hierarchy with a known block-transfer size B. The first search tree supports insertions and deletions in Θ(1 + logB+1 N) amortized memory transfers, which matches the B-tree's worst-case bounds. The second search tree supports scanning S consecutive elements optimally in Θ(1 + S/B) memory transfers, and supports insertions and deletions in Θ(1 + logB+1 N + (log2 N)/B) amortized memory transfers, matching the performance of the B-tree for B = Ω(log N log log N).

This paper is also available from SIAM.

The paper is 19 pages.

The paper is available in PostScript (530k), gzipped PostScript (210k), and PDF (303k).
See information on file formats.
[Google Scholar search]

Related papers:
FOCS2000b (Cache-Oblivious B-Trees)

See also other papers by Erik Demaine.
These pages are generated automagically from a BibTeX file.
Last updated October 16, 2017 by Erik Demaine.