Cache-oblivious Search
Cache-Oblivious Search is a cache-oblivious algorithmic paradigm designed for efficient data retrieval in hierarchically structured memory systems, distinguished by its optimal performance across all levels of the memory hierarchy without explicit knowledge of hardware parameters such as block size or cache capacity.
30
Publications
1.2K
Citations
66
Authors
37
Institutions
Publications per year
2017–2026
2
30
Speedup Graph Processing by Graph Ordering
Hao Wei, Jeffrey Xu Yu, Can Lu et al. · 2016 · 154 citations
Hierarchical A *: searching abstraction hierarchies efficiently
Robert C. Holte, M. B. Perez, Robert Zimmer et al. · 1996 · 136 citations
Cache-oblivious string B-trees
Michael A. Bender, Martı́n Farach-Colton, Bradley C. Kuszmaul · 2006 · 77 citations
1–5 of 30
66
8
h-index
8
h-index
4
h-index
4
h-index
Massachusetts Institute of Technology, United States
3 publications · 112 citations
3
h-index
1–5 of 66
37

Aarhus University
Aarhus, Denmark
10 h-index
18 publications
836 citations
Stony Brook University
Stony Brook, United States
5 h-index
12 publications
317 citations

University of Southern Denmark
Odense, Denmark
4 h-index
4 publications
98 citations

University of Pisa
Pisa, Italy
3 h-index
5 publications
208 citations

University of Waterloo
Waterloo, Canada
2 h-index
2 publications
42 citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
2 h-index
4 publications
473 citations
Fudan University
Shanghai, China
2 h-index
2 publications
35 citations
Dalhousie University
Halifax, Canada
2 h-index
3 publications
41 citations
1–8 of 37
JEA · 2 publications · 53 citations
2
h-index
2 publications · 62 citations
2
h-index
TOPC · 1 publications · 14 citations
1
h-index
Repository · 1 publications · 14 citations
1
h-index
Repository · 1 publications · 51 citations
1
h-index
1–5