Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket

2014/04/01 by David Eppstein, Eppstein, David, Michael T. Goodrich +7
Computer Science · #Advanced Image and Video Retrieval Techniques #Advanced Steganography and Watermarking Techniques #Algorithms and Data Compression #B.8.2 #Caching and Content Delivery #Data Structures and Algorithms (cs.DS) #E.2 #F.2.2 #FOS: Computer and information sciences #cs.DS

paper · pdf · doi:10.48550/arxiv.1404.0286

13 pages, 1 table, 7 figures; to appear at the 13th Symposium on Experimental Algorithms (SEA 2014)

arxiv created 2014/04/01 · openalex publication_date 2014/04/01 · arxiv updated 2014/04/02 · openalex created_date 2021/05/24 · openalex updated_date 2026/07/28

Abstract

We study wear-leveling techniques for cuckoo hashing, showing that it is possible to achieve a memory wear bound of loglog n+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.

Citations

• Real-time parallel hashing on the GPU
• Phase Change Memory

Related

• Insertion Time of Random Walk Cuckoo Hashing below the Peeling Threshold
• De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
• Load Thresholds for Cuckoo Hashing with Overlapping Blocks
• A cuckoo hashing variant with improved memory utilization and insertion time
• Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash