Cache-Oblivious Hashing
Summary: Proposes a cache-oblivious hash table that can match cache-aware search cost t_q = 1 + 1/2^{Ω(b)} for external hashing, i.e., near-perfect single-access searches across all blockings. Achieves this only under two realistic but non-model assumptions—b a power of two and blocks aligned to b—otherwise the best possible is t_q = 1 + O(α/b), the same as linear probing. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Rasmus Pagh
- 2. Zhewei Wei
- 3. Ke Yi
- 4. Qin Zhang
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,314 | Can Learned Models Replace Hash Functions? | 2023 | VLDB | 5.5724608e-05 |
| 7,378 | Cache-Oblivious Query Processing | 2007 | CIDR | 4.7480163e-05 |
| 4,086 | External Perfect Hashing | 1985 | SIGMOD | 6.4608969e-05 |
| 14,324 | External hashing with limited internal storage | 1982 | PODS | - |
| 12,893 | Fast Search In Main Memory Databases | 1992 | SIGMOD | 4.1945683e-05 |
| 2,742 | Cache-Efficient Aggregation: Hashing Is Sorting | 2015 | SIGMOD | 8.1906104e-05 |
| 8,820 | Hashing in Practice, Analysis of Hashing and Universal Hashing | 1988 | SIGMOD | 4.4419702e-05 |
| 1,523 | Concurrency and Linear Hashing | 1985 | PODS | 0.00011518774 |
| 1,696 | A Seven-Dimensional Analysis of Hashing Methods and its Implications on Query Processing | 2016 | VLDB | 0.00010881034 |
| 1,195 | Buffering Accesses to Memory-Resident Index Structures | 2003 | VLDB | 0.00013406526 |