Cache-oblivious hashing
From MaRDI portal
Publication:472489
DOI10.1007/s00453-013-9763-6zbMath1307.68032OpenAlexW2048064086MaRDI QIDQ472489
Zhewei Wei, Ke Yi, Rasmus Pagh, Qin Zhang
Publication date: 19 November 2014
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-013-9763-6
Analysis of algorithms (68W40) Searching and sorting (68P10) Database theory (68P15) Data structures (68P05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cache-oblivious range reporting with optimal queries requires superlinear space
- The cost of cache-oblivious searching
- Optimality in external memory hashing
- New hash functions and their use in authentication and set equality
- The effect of table expansion on the program complexity of perfect hash functions
- Universal classes of hash functions
- The limits of buffering
- Linear Probing with 5-wise Independence
- On the limits of cache-obliviousness
- Cuckoo hashing
- Chernoff–Hoeffding Bounds for Applications with Limited Independence
- Cache-Oblivious B-Trees
This page was built for publication: Cache-oblivious hashing