arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0612055cs.DScs.DB
收藏

常数独立线性探测

Linear Probing with Constant Independence

Anna Pagh, Rasmus Pagh, Milan Ruzic

摘要:

使用线性探测的散列可以追溯到20世纪50年代,并且是研究最多的算法之一。近年来,它已经成为最重要的哈希表组织之一,因为它很好地利用了现代计算机的缓存。不幸的是,以前的分析依赖于复杂和空间消耗散列函数,或不切实际的假设自由访问一个真正的随机散列函数。卡特和韦格曼在他们关于泛散列的开创性论文中已经提出了将他们的分析扩展到线性探测的问题。然而,在本文中,我们表明,线性探测使用成对独立的家庭可能有预期的{ \em对数}成本每操作。在积极的一面,我们表明,5明智的独立性是足够的,以确保恒定的预期时间每次操作。这解决了寻找空间和时间有效的散列函数的问题,该散列函数可证明确保线性探测的良好性能。

英文摘要:

Hashing with linear probing dates back to the 1950s, and is among the most studied algorithms. In recent years it has become one of the most important hash table organizations since it uses the cache of modern computers very well. Unfortunately, previous analysis rely either on complicated and space consuming hash functions, or on the unrealistic assumption of free access to a truly random hash function. Already Carter and Wegman, in their seminal paper on universal hashing, raised the question of extending their analysis to linear probing. However, we show in this paper that linear probing using a pairwise independent family may have expected {\em logarithmic} cost per operation. On the positive side, we show that 5-wise independence is enough to ensure constant expected time per operation. This resolves the question of finding a space and time efficient hash function that provably ensures good performance for linear probing.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑