Tabulation-Based 5-Independent Hashing with Applications to Linear Probing and Second Moment Estimation

Abstract. In the framework of Carter and Wegman, a k-independent hash function maps any k keys independently. It is known that 5independent hashing provides good expected performance in applications such as linear probing and second moment estimation for data streams. The classic 5-independent hash function evaluates a degree 4 polynomial over a prime field containing the key domain [n] = {0, . . . , n − 1}. Here we present an efficient 5-independent hash function that uses no multiplications. Instead, for any parameter c, we make 2c − 1 lookups in

• Type: Journal
• Year: 2012
• Where: SIAMCOMP
• Authors: Mikkel Thorup, Yin Zhang
• Keywords: Data Streams, Hash Function, Logical Reasoning, Parameter C, SIAMCOMP 2012