开放寻址无重排的最优界
Optimal Bounds for Open Addressing Without Reordering
AI总结:
本文证明开放寻址哈希表无需重排即可实现优于先前认知的期望搜索复杂度,并否证了 Yao 的均匀哈希最优猜想,所有结果均配有匹配下界。
摘要:
在本文中,我们重新审视数据结构中最简单的问题之一:将元素插入开放寻址哈希表,以便后续能够以尽可能少的探测次数检索元素。我们证明,即使不随时间对元素进行重排,也可以构造出比先前认为可能实现的期望搜索复杂度(包括均摊和 worst-case)远为更优的哈希表。在此过程中,我们否证了 Yao 在其开创性论文“均匀哈希是最优的”中留下的中心猜想。我们所有结果均配有匹配的下界。
英文摘要:
In this paper, we revisit one of the simplest problems in data structures: the task of inserting elements into an open-addressed hash table so that elements can later be retrieved with as few probes as possible. We show that, even without reordering elements over time, it is possible to construct a hash table that achieves far better expected search complexities (both amortized and worst-case) than were previously thought possible. Along the way, we disprove the central conjecture left by Yao in his seminal paper ``Uniform Hashing is Optimal''. All of our results come with matching lower bounds.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。