Wear Minimization For Cuckoo Hashing How Not To Throw A Lot Of Eggs Into One Basket

Eppstein David, Goodrich Michael T., Mitzenmacher Michael, Pszona Paweł. Arxiv 2014

[Paper]    
ARXIV

We study wear-leveling techniques for cuckoo hashing, showing that it is possible to achieve a memory wear bound of $loglogn+O(1)$ after the insertion of $n$ items into a table of size $Cn$ for a suitable constant $C$ using cuckoo hashing. Moreover, we study our cuckoo hashing method empirically, showing that it significantly improves on the memory wear performance for classic cuckoo hashing and linear probing in practice.

Similar Work

• Cuckoo Hashing In Cryptography Optimal Parameters Robustness And Applications
• On The Insertion Time Of Random Walk Cuckoo Hashing
• Sichash -- Small Irregular Cuckoo Tables For Perfect Hashing
• On The Insertion Time Of Cuckoo Hashing