Sharp load thresholds for cuckoo hashing
Sharp load thresholds for cuckoo hashing
复制标题
布谷鸟哈希的急剧负载阈值
DOI：
10.1002/rsa.20426
复制
发表时间：
2009
影响因子：
1
通讯作者：
K. Panagiotou
中科院分区：
文献类型：
--
作者：
N. Fountoulakis;K. Panagiotou
许多选择的范式都显着影响了有效的数据结构的设计，最值得注意的是哈希表。握住一个项目。成功分配可用的项目到所选位置？ k，例如4或5。
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 each location can hold one item. Each item to be inserted chooses randomly k ≥ 2 locations and has to be placed in any one of them. How much load can cuckoo hashing handle before collisions prevent the successful assignment of the available items to the chosen locations? Practical evaluations and theoretical analysis of this method have shown that one can allocate a number of elements that is a large proportion of the size of the table, being very close to 1 even for small values of k such as 4 or 5.
用于检索和近似成员资格的简洁数据结构
DOI：
10.1007/978-3-540-70575-8_32
发表时间：
2008
期刊：
影响因子：
--
作者：
Martin Dietzfelbinger;Rasmus Pagh
通讯作者：
Rasmus Pagh
关于使用带有简单通用哈希类的布谷鸟哈希的风险
DOI：
10.1137/1.9781611973068.87
发表时间：
2009
期刊：
影响因子：
--
作者：
Martin Dietzfelbinger;Ulf Schellbach
通讯作者：
Ulf Schellbach