A random hash function h is ε-minwise if for any set S, |S| = n, and element x ∈ S, Pr[h(x) = min h (S)] = (1 ± ε)/n. Minwise hash functions with low bias ε have widespread applications within similarity estimation. Hashing from a universe [u], the twisted tabulation hashing of Pǎtraşcu and Thorup [SODA'13] makes c = O(1) lookups in tables of size u1/c. Twisted tabulation was invented to get good concentration for hashing based sampling. Here we show that twisted tabulation yields Õ(1/u1/c-minwise hashing. In the classic independence paradigm of Wegman and Carter [FOCS'79] Õ(1/u1/c-minwise hashing requires Ω(log u)-independence [Indyk SODA'99]. Pǎtraşcu and Thorup [STOC'11] had shown that simple tabulation, using same space and lookups yields Õ(1/n1/c-minwise independence, which is good for large sets, but useless for small sets. Our analysis uses some of the same methods, but is much cleaner bypassing a complicated induction argument. © 2014 Springer International Publishing.
CITATION STYLE
Dahlgaard, S., & Thorup, M. (2014). Approximately minwise independence with twisted tabulation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8503 LNCS, pp. 134–145). Springer Verlag. https://doi.org/10.1007/978-3-319-08404-6_12
Mendeley helps you to discover research relevant for your work.