Cache-oblivious B-trees

Cache-Oblivious B-Trees is a cache-oblivious data structure that generalizes the B-tree model to achieve optimal block-aligned memory access patterns without explicit knowledge of cache parameters, thereby enabling asymptotically efficient search, insertion, and deletion operations in external memory models.

8

Publications

658

Citations

19

Authors

13

Institutions

Publications per year

2017–2026

0

Authors

19

  1. MA
    Michael A. Bender

    Stony Brook University, United States

    5 publications · 592 citations

    5

    h-index

  2. MF
    Martı́n Farach-Colton

    Rutgers, The State University of New Jersey, United States

    4 publications · 505 citations

    4

    h-index

  3. BC
    Bradley C. Kuszmaul

    Massachusetts Institute of Technology, United States

    3 publications · 306 citations

    3

    h-index

  4. JT
    Jeremy T. Fineman

    Georgetown University, United States

    2 publications · 229 citations

    2

    h-index

  5. ED
    Erik D. Demaine

    Massachusetts Institute of Technology, United States

    2 publications · 286 citations

    2

    h-index

1–5 of 19

Venues

  1. ACM Transactions on Algorithms

    TALG · 1 publications · 11 citations

    1

    h-index

  2. SIAM Journal on Computing

    1 publications · 129 citations

    1

    h-index

1–2