Cuckoo Hashing with Pages
Cuckoo Hashing with Pages
复制标题
布谷鸟哈希与页面
DOI:
10.1007/978-3-642-23719-5_52
复制
发表时间:
2011
期刊:
影响因子:
--
通讯作者:
Michael Rink
中科院分区:
文献类型:
--
作者:
Martin Dietzfelbinger;Michael Mitzenmacher;Michael Rink
A downside of cuckoo hashing is that it requires lookups to multiple locations, making it a less compelling alternative when lookups are expensive. One such setting is when memory is arranged in large pages, and the major cost is the number of page accesses. We propose the study of cuckoo hashing with pages, advocating approaches where each key has several possible locations, or cells, on a single page, and additional choices on a second backup page. We show experimentally that withkcell choices on one page and a single backup cell choice, one can achieve nearly the same loads as when each key hask+ 1 random cells to choose from, with most lookups requiring just one page access, even when keys are placed online using a simple algorithm. While our results are currently experimental, they suggest several interesting new open theoretical questions for cuckoo hashing with pages.
登录
查看更多内容
DOI:
--
发表时间:
2006
期刊:
International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
影响因子:
--
作者:
Philipp Woelfel
通讯作者:
Philipp Woelfel
DOI:
--
发表时间:
2009
期刊:
Embedded Systems and Applications
影响因子:
--
作者:
E. Lehman;R. Panigrahy
通讯作者:
R. Panigrahy
DOI:
--
发表时间:
2009
期刊:
Random Struct. Algorithms
影响因子:
--
作者:
A. Frieze;Páll Melsted
通讯作者:
Páll Melsted
DOI:
--
发表时间:
2010
期刊:
International Colloquium on Automata, Languages and Programming
影响因子:
--
作者:
N. Fountoulakis;K. Panagiotou
通讯作者:
K. Panagiotou