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
8
Michael A. Bender, Erik D. Demaine, Martı́n Farach-Colton · 2002 · 157 citations
Cache-oblivious streaming B-trees
Michael A. Bender, Martı́n Farach-Colton, Jeremy T. Fineman et al. · 2007 · 142 citations · Full text
Michael A. Bender, Erik D. Demaine, Martı́n Farach-Colton · SIAM Journal on Computing · 2005 · 129 citations
Concurrent cache-oblivious b-trees
Michael A. Bender, Jeremy T. Fineman, Seth Gilbert et al. · 2005 · 87 citations
Cache-oblivious string B-trees
Michael A. Bender, Martı́n Farach-Colton, Bradley C. Kuszmaul · 2006 · 77 citations
1–5 of 8
19
5
h-index
Rutgers, The State University of New Jersey, United States
4 publications · 505 citations
4
h-index
Massachusetts Institute of Technology, United States
3 publications · 306 citations
3
h-index
2
h-index
2
h-index
1–5 of 19
13
Stony Brook University
Stony Brook, United States
5 h-index
11 publications
983 citations
IIT@MIT
Cambridge, United States
2 h-index
6 publications
687 citations
Massachusetts Institute of Technology
Cambridge, United States
2 h-index
6 publications
687 citations
Sandia National Laboratories California
Livermore, United States
1 h-index
1 publications
16 citations

University of Waterloo
Waterloo, Canada
1 h-index
1 publications
157 citations

École Normale Supérieure de Lyon
Lyon, France
1 h-index
1 publications
16 citations
Google (United States)
Mountain View, United States
1 h-index
1 publications
157 citations
Rutgers Sexual and Reproductive Health and Rights
Utrecht, Netherlands
1 h-index
1 publications
77 citations
1–8 of 13
TALG · 1 publications · 11 citations
1
h-index
1 publications · 129 citations
1
h-index
1–2