The power of simple tabulation Hashing

34Citations
Citations of this article
49Readers
Mendeley users who have this article in their library.

Abstract

Randomized algorithms are often enjoyed for their simplicity, but the hash functions used to yield the desired theoretical guarantees are often neither simple nor practical. Here we show that the simplest possible tabulation hashing provides unexpectedly strong guarantees. The scheme itself dates back to Carter and Wegman (STOC'77). Keys are viewed as consisting of c characters. We initialize c tables T1, ..., Tc mapping characters to random hash codes. A key x = (x1, ..., xc) is hashed to T1[x1] ⊕ ... ⊕ Tc[xc], where ⊕ denotes xor. While this scheme is not even 4-independent, we show that it provides many of the guarantees that are normally obtained via higher independence, e.g., Chernoff-type concentration, min-wise hashing for estimating set intersection, and cuckoo hashing. © 2011 ACM.

Cite

CITATION STYLE

APA

Pǎtraşcu, M., & Thorup, M. (2011). The power of simple tabulation Hashing. In Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 1–10). Association for Computing Machinery. https://doi.org/10.1145/1993636.1993638

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free