Reinhard Kutzelnigg - A further analysis of Cuckoo Hashing with a Stash and Random Graphs of Excess r

dmtcs:495 - Discrete Mathematics & Theoretical Computer Science, January 1, 2010, Vol. 12 no. 3 -
A further analysis of Cuckoo Hashing with a Stash and Random Graphs of Excess rArticle

Authors: Reinhard Kutzelnigg 1

  • 1 Institute of Discrete Mathematics and Geometry [Vienne]

Cuckoo hashing is a hash table data structure offering constant access time, even in the worst case. As a drawback, the construction fails with small, but practically significant probability. However, Kirsch et al. (2008) showed that a constant-sized additional memory, the so called stash, is sufficient to reduce the failure rate drastically. But so far, using a modified insertion procedure that demands additional running time to look for an admissible key is required. As a major contribution of this paper, we show that the same bounds on the failure probability hold even without this search process and thus, the performance increases. Second, we extend the analysis to simplified cuckoo hashing, a variant of the original algorithm offering increased performance. Further, we derive some explicit asymptotic approximations concerning the number of usual resp. bipartite graphs related to the data structures. Using these results, we obtain much more precise asymptotic expansions of the success rate. These calculations are based on a generating function approach and applying the saddle point method. Finally, we provide numerical results to support the theoretical analysis.

Volume: Vol. 12 no. 3
Section: Analysis of Algorithms
Published on: January 1, 2010
Imported on: March 26, 2015
Keywords: Hashing,Cuckoo hashing,Algorithms,Generating functions,Random graphs,Saddle point method,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

2 Documents citing this article

Consultation statistics

This page has been seen 380 times.
This article's PDF has been downloaded 553 times.