Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
An algorithm for approximate membership checking with application to password security
Information Processing Letters
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Journal of Algorithms
GNU Scientific Library Reference Manual - Third Edition
GNU Scientific Library Reference Manual - Third Edition
Real-time parallel hashing on the GPU
ACM SIGGRAPH Asia 2009 papers
Load balancing and orientability thresholds for random hypergraphs
Proceedings of the forty-second ACM symposium on Theory of computing
Tight thresholds for cuckoo hashing via XORSAT
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Orientability of random hypergraphs and the power of multiple choices
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
The multiple-orientability thresholds for random hypergraphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
A downside of cuckoo hashing is that it requires lookups to multiple locations, making it a less compelling alternative when lookups are expensive. One such setting is when memory is arranged in large pages, and the major cost is the number of page accesses. We propose the study of cuckoo hashing with pages, advocating approaches where each key has several possible locations, or cells, on a single page, and additional choices on a second backup page. We show experimentally that with k cell choices on one page and a single backup cell choice, one can achieve nearly the same loads as when each key has k + 1 random cells to choose from, with most lookups requiring just one page access, even when keys are placed online using a simple algorithm. While our results are currently experimental, they suggest several interesting new open theoretical questions for cuckoo hashing with pages.