Cache-Oblivious Range Searching is a cache-oblivious data structure designed to efficiently answer range queries in multidimensional space by optimizing memory access patterns across all levels of a memory hierarchy without prior knowledge of its parameters.
11
Publications
422
Citations
30
Authors
15
Institutions
Publications per year
2017–2026
0
Publications
11
Cache-oblivious streaming B-trees
Michael A. Bender, Martı́n Farach-Colton, Jeremy T. Fineman et al. · 2007 · 142 citations · Full text
Concurrent cache-oblivious b-trees
Michael A. Bender, Jeremy T. Fineman, Seth Gilbert et al. · 2005 · 87 citations
Cache-oblivious data structures for orthogonal range searching
Pankaj K. Agarwal, Lars Arge, Andrew Danner et al. · 2003 · 37 citations
Cache-oblivious planar orthogonal range searching and counting
Lars Arge, Gerth Stølting Brodal, Rolf Fagerberg et al. · 2005 · 23 citations
1–5 of 11
Authors
30
- LA
3
h-index
- NZ
3
h-index
- BCBradley C. Kuszmaul
Massachusetts Institute of Technology, United States
2 publications · 229 citations
2
h-index
- PA
2
h-index
- HH
2
h-index
1–5 of 30
Institutions
15
Aarhus University
Aarhus, Denmark
4 h-index
6 publications
112 citations
Dalhousie University
Halifax, Canada
3 h-index
5 publications
75 citations
Stony Brook University
Stony Brook, United States
3 h-index
7 publications
435 citations
Massachusetts Institute of Technology
Cambridge, United States
2 h-index
6 publications
687 citations
IIT@MIT
Cambridge, United States
2 h-index
6 publications
687 citations
University of California, Irvine
Irvine, United States
2 h-index
2 publications
35 citations
NEC (United States)
Irving, United States
2 h-index
5 publications
92 citations
Center for Massive Data Algorithmics
Aarhus, Denmark
1 h-index
1 publications
17 citations
1–8 of 15
Venues
- Journal of Grid Computing
1 publications · 22 citations
1
h-index
- Computational Geometry
1 publications · 17 citations
1
h-index
1–2