Wear minimization for cuckoo hashing: How not to throw a lot of eggs into one basket

Abstract. We study wear-leveling techniques for cuckoo hashing, showing that it is possible to achieve a memory wear bound of log logn + O(1) after the insertion of n items into a table of sizeCn for a suitable constantC 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. “I did throw a lot of eggs into one basket, as you do in your teenage years...” —Dylan Moran [31]