Abstract
We consider a natural variation of cuckoo hashing proposed by Lehman and Panigrahy (2009). Each of cn objects is assigned k = 2 intervals of size ℓ in a linear hash table of size n and both starting points are chosen independently and uniformly at random. Each object must be placed into a table cell within its intervals, but each cell can only hold one object. Experiments suggested that this scheme outperforms the variant with blocks in which intervals are aligned at multiples of ℓ. In particular, the load threshold is higher, i.e., the load c that can be achieved with high probability. For instance, Lehman and Panigrahy (2009) empirically observed the threshold for ℓ = 2 to be around 96.5% as compared to roughly 89.7% using blocks. They pinned down the asymptotics of the thresholds for large ℓ, but the precise values resisted rigorous analysis.
We establish a method to determine these load thresholds for all ℓ ≥ 2, and, in fact, for general k ≥ 2. For instance, for k = ℓ = 2, we get ≈ 96.4995%. We employ a theorem due to Leconte, Lelarge, and Massoulié (2013), which adapts methods from statistical physics to the world of hypergraph orientability. In effect, the orientability thresholds for our graph families are determined by belief propagation equations for certain graph limits. As a side note, we provide experimental evidence suggesting that placements can be constructed in linear time using an adapted version of an algorithm by Khosla (2013).
- [1] . 2004. The Objective Method: Probabilistic Combinatorial Optimization and Local Weak Convergence. Springer, Berlin, 1–72.
DOI: Google ScholarCross Ref - [2] . 2012. Analysis of the Linear Probing Variant of Cuckoo Hashing. Master’s Thesis. Technische Universität Ilmenau. Retrieved from http://gso.gbv.de/DB=2.1/PPNSET?PPN=685166759.Google Scholar
- [3] . 2007. The random graph threshold for \(k\)-orientiability and a fast algorithm for optimal multiple-choice allocation. In Proceedings of the 18th SODA. 469–476. Retrieved from http://dl.acm.org/citation.cfm?id=1283383.1283433.Google Scholar
- [4] . 2010. Tight thresholds for cuckoo hashing via XORSAT. In Proceedings of the 37th ICALP (1). 213–225.
DOI: Google ScholarCross Ref - [5] . 2005. Balanced allocation and dictionaries with tightly packed constant size bins. In Proceedings of the 32nd ICALP. 166–178.
DOI: Google ScholarDigital Library - [6] . 2007. Balanced allocation and dictionaries with tightly packed constant size bins. Theor. Comput. Sci. 380, 1-2 (2007), 47–68.
DOI: Google ScholarDigital Library - [7] . 2007. The \(k\)-orientability Thresholds for \(G_{n,p}\). In Proceedings of the 18th SODA. 459–468. Retrieved from http://dl.acm.org/citation.cfm?id=1283383.1283432.Google Scholar
- [8] . 2005. Space efficient hash tables with worst case constant access time. Theory Comput. Syst. 38, 2 (2005), 229–248.
DOI: Google ScholarCross Ref - [9] . 2011. The multiple-orientability thresholds for random hypergraphs. In Proceedings of the 22nd SODA. 1222–1236. Retrieved from http://www.siam.org/proceedings/soda/2011/SODA11_092_fountoulakisn.pdf.Google ScholarCross Ref
- [10] . 2010. Orientability of random hypergraphs and the power of multiple choices. In Proceedings of the 37th ICALP (1). 348–359.
DOI: Google ScholarCross Ref - [11] . 2012. Sharp load thresholds for cuckoo hashing. Random Struct. Algorithms 41, 3 (2012), 306–333.
DOI: Google ScholarDigital Library - [12] . 2012. Maximum matchings in random bipartite graphs and the space utilization of cuckoo hash tables. Random Struct. Algorithms 41, 3 (2012), 334–364.
DOI: Google ScholarDigital Library - [13] . 2010. Load balancing and orientability thresholds for random hypergraphs. In Proceedings of the 42nd STOC. 97–104.
DOI: Google ScholarDigital Library - [14] . 2007. A simple solution to the k-core problem. Random Struct. Algorithms 30, 1-2 (2007), 50–62.
DOI: Google ScholarCross Ref - [15] . 2013. Balls into bins made faster. In Proceedings of the 21st ESA. 601–612.
DOI: Google ScholarCross Ref - [16] . 2019. A faster algorithm for cuckoo insertion and bipartite matching in large graphs. Algorithmica 81, 9 (2019), 3707–3724.
DOI: Google ScholarDigital Library - [17] . 2013. Double hashing thresholds via local weak convergence. In Proceedings of the 51st Annual Allerton Conference. 131–137.
DOI: Google ScholarCross Ref - [18] . 2013. Convergence of multivariate belief propagation, with applications to cuckoo hashing and load balancing. In Proceedings of the 24th SODA. 35–46. http://dl.acm.org/citation.cfm?id=2627817.2627820.Google ScholarCross Ref
- [19] . 2009. 3.5-way cuckoo hashing for the price of 2-and-a-Bit. In Proceedings of the 17th ESA. 671–681.
DOI: Google ScholarCross Ref - [20] . 2012. A new approach to the orientation of random hypergraphs. In Proceedings of the 23rd SODA. 251–264. Retrieved from http://dl.acm.org/citation.cfm?id=2095139.Google ScholarCross Ref
- [21] . 2018. Load thresholds for cuckoo hashing with double hashing. In SWAT (Leibniz International Proceedings in Informatics (LIPIcs’18)), (Ed.), Vol. 101. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 29:1–29:9.
DOI: Google ScholarCross Ref - [22] . 2005. Cores in random hypergraphs and Boolean formulas. Random Struct. Algorithms 27, 1 (2005), 124–135.
DOI: Google ScholarCross Ref - [23] . 2004. Cuckoo hashing. J. Algorithms 51, 2 (2004), 122–144.
DOI: Google ScholarDigital Library - [24] . 2012. A cuckoo hashing variant with improved memory utilization and insertion time. In Proceedings of the 22nd DCC.
DOI: Google ScholarDigital Library
Index Terms
- Load Thresholds for Cuckoo Hashing with Overlapping Blocks
Recommendations
Sharp load thresholds for cuckoo hashing
The paradigm of many choices has influenced significantly the design of efficient data structures and, most notably, hash tables. Cuckoo hashing is a technique that extends this concept. There, we are given a table with n locations, and we assume that ...
A precise analysis of Cuckoo hashing
Cuckoo hashing was introduced by Pagh and Rodler in 2001. Its main feature is that it provides constant worst-case search time. The aim of this article is to present a precise average case analysis of Cuckoo hashing. In particular, we determine the ...
An Analysis of Random-Walk Cuckoo Hashing
APPROX '09 / RANDOM '09: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and TechniquesIn this paper, we provide a polylogarithmic bound that holds with high probability on the insertion time for cuckoo hashing under the random-walk insertion method. Cuckoo hashing provides a useful methodology for building practical, high-performance ...
Comments