arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1609.09840cs.DScs.CR
收藏

规则和几乎通用的哈希:一种有效的实现

Regular and almost universal hashing: an efficient implementation

Dmytro Ivanchykhin, Sergey Ignatchenko, Daniel Lemire

摘要:

随机散列可以提供有关数据结构(如哈希表)性能的保证--即使在对抗性设置中。许多现有的散列函数家族都是通用的:给定两个数据对象,如果我们随机选择散列函数,那么它们具有相同散列值的概率很低。然而,普适性无法确保所有哈希函数都表现良好。我们进一步要求规律性:当随机挑选数据对象时,对于任何固定的散列函数,它们具有相同散列值的概率应该很低。我们提出了一个家庭的非加密散列函数(PM+)提供良好的运行时间,良好的内存使用以及区分理论保证:几乎普遍性和组件的规律性的有效实现。在各种平台上,我们的实现在性能上都可以与最先进的技术相媲美。在最近的Intel处理器上,PM+对于32位输出达到每周期4.7字节的速度,对于64位输出达到每周期3.3字节的速度。我们通过SIMD指令(例如,AVX 2)和优化超标量执行。

英文摘要:

Random hashing can provide guarantees regarding the performance of data structures such as hash tables---even in an adversarial setting. Many existing families of hash functions are universal: given two data objects, the probability that they have the same hash value is low given that we pick hash functions at random. However, universality fails to ensure that all hash functions are well behaved. We further require regularity: when picking data objects at random they should have a low probability of having the same hash value, for any fixed hash function. We present the efficient implementation of a family of non-cryptographic hash functions (PM+) offering good running times, good memory usage as well as distinguishing theoretical guarantees: almost universality and component-wise regularity. On a variety of platforms, our implementations are comparable to the state of the art in performance. On recent Intel processors, PM+ achieves a speed of 4.7 bytes per cycle for 32-bit outputs and 3.3 bytes per cycle for 64-bit outputs. We review vectorization through SIMD instructions (e.g., AVX2) and optimizations for superscalar execution.

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

↑