Tabulation based 4-universal hashing with applications to second moment estimation

We show that 4-universal hashing can be implemented efficiently using tabulated 4-universal hashing for characters, gaining a factor of 5 in speed over the fastest existing methods. We also consider generalization to -universal hashing, and as a prime application, we consider the approximation of the second moment of a data stream.

• Type: Conference
• Year: 2004
• Where: SODA
• Authors: Mikkel Thorup, Yin Zhang
• Keywords: 4-universal Hashing, Algorithms, Fastest Existing Methods, Prime Application, SODA 2004