Regular and almost universal hashing: an efficient implementation. (4th November 2016)

• Record Type: Journal Article
• Authors: Ivanchykhin, Dmytro; Ignatchenko, Sergey; Lemire, Daniel
• Is Part Of: Software, practice & experience. Volume 47:Number 10(2017)
• Page Start: 1299
• Page End: 1323
• Publication Date: 2016-11-04
• Subjects: performance -- measurement -- random hashing, universal hashing, non‐cryptographic hashing, avalanche effect; Computer software -- Periodicals; Computer programming -- Periodicals; Computer programs -- Periodicals; 005.3
• DOI: 10.1002/spe.2461
• Languages: English
• ISSNs: 0038-0644

Abstract

Summary: 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 might 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, and distinguishing theoretical guarantees: almost universality and component‐wise regularity. On a variety of platforms, our implementations are comparable with 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 Single Instruction on Multiple Data instructions (e.g., AVX2) and optimizations for superscalar execution. Copyright © 2016 John Wiley & Sons, Ltd.