Cache-oblivious Dictionaries
Cache-Oblivious Dictionaries is a cache-efficient data structure that supports dictionary operations such as insertion, deletion, and search in a cache-oblivious manner by optimizing memory access patterns across all levels of a memory hierarchy without explicit knowledge of cache parameters.
7
Publications
375
Citations
17
Authors
11
Institutions
Publications per year
2017–2026
0
7
Cache-oblivious streaming B-trees
Michael A. Bender, Martı́n Farach-Colton, Jeremy T. Fineman et al. · 2007 · 142 citations · Full text
On searching compressed string collections cache-obliviously
Paolo Ferragina, Roberto Grossi, Ankur Gupta et al. · 2008 · 50 citations
A locality-preserving cache-oblivious dynamic dictionary
Michael A. Bender, Ziyang Duan, John Iacono et al. · 2002 · 48 citations
A locality-preserving cache-oblivious dynamic dictionary
Michael A. Bender, Ziyang Duan, John Iacono et al. · Journal of Algorithms · 2004 · 44 citations
1–5 of 7
17
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 17
11
State University of New York
Albany, United States
2 h-index
6 publications
276 citations
Stony Brook University
Stony Brook, United States
2 h-index
5 publications
416 citations

Aarhus University
Aarhus, Denmark
2 h-index
2 publications
64 citations

University of Southern Denmark
Odense, Denmark
2 h-index
2 publications
64 citations
Butler University
Indianapolis, United States
1 h-index
1 publications
50 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
1 h-index
1 publications
142 citations
IIT@MIT
Cambridge, United States
1 h-index
3 publications
426 citations

University of Pisa
Pisa, Italy
1 h-index
2 publications
100 citations
1–8 of 11
Repository · 1 publications · 40 citations
1
h-index
1 publications · 44 citations
1
h-index
Repository · 1 publications · 27 citations
1
h-index
Conference · 1 publications · 24 citations
1
h-index
1–4