## Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation (2010)

### Cached

### Download Links

Citations: | 7 - 3 self |

### BibTeX

@MISC{Arbitman10backyardcuckoo,

author = {Yuriy Arbitman and Moni Naor and Gil Segev},

title = {Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation},

year = {2010}

}

### OpenURL

### Abstract

The performance of a dynamic dictionary is measured mainly by its update time, lookup time, and space consumption. In terms of update time and lookup time there are known constructions that guarantee constant-time operations in the worst case with high probability, and in terms of space consumption there are known constructions that use essentially optimal space. In this paper we settle two fundamental open problems: • We construct the first dynamic dictionary that enjoys the best of both worlds: we present a two-level variant of cuckoo hashing that stores n elements using (1+ϵ)n memory words, and guarantees constant-time operations in the worst case with high probability. Specifically, for any ϵ = Ω((log log n / log n) 1/2) and for any sequence of polynomially many operations, with high probability over the randomness of the initialization phase, all operations are performed in constant time which is independent of ϵ. The construction is based on augmenting cuckoo hashing with a “backyard ” that handles a large fraction of the elements, together with a de-amortized perfect hashing scheme for eliminating the dependency on ϵ.