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

preprint2014arXivOpen access

Abstract

We study wear-leveling techniques for cuckoo hashing, showing that it is possible to achieve a memory wear bound of log⁡log⁡n+O(1)\log\log n+O(1) after the insertion of nn items into a table of size CnCn for a suitable constant CC 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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.