Open access research
publication repository
publication repository
Lemire, Daniel, & Kaser, Owen (2010). Recursive n-gram hashing is pairwise independent, at best. Computer Speech & Language, 24 (4), 698-710. https://doi.org/10.1016/j.csl.2009.12.001
File(s) available for this item:| PDF - 0705.4676v7.pdf |
|
| Item Type: | Journal Articles |
|---|---|
| Refereed: | Yes |
| Status: | Published |
| Abstract: | Many applications use sequences of n consecutive symbols (n-grams). Hashing these n-grams can be a performance bottleneck. For more speed, recursive hash families compute hash values by updating previous values. We prove that recursive hash families cannot be more than pairwise independent. While hashing by irreducible polynomials is pairwise independent, our implementations either run in time O(n) or use an exponential amount of memory. As a more scalable alternative, we make hashing by cyclic polynomials pairwise independent by ignoring n-1 bits. Experimentally, we show that hashing by cyclic polynomials is is twice as fast as hashing by irreducible polynomials. We also show that randomized Karp-Rabin hash families are not pairwise independent. |
| Official URL: | http://www.sciencedirect.com/science/article/pii/S... |
| Depositor: | Lemire, Daniel |
| Owner / Manager: | Daniel Lemire |
| Deposited: | 22 Jul 2014 21:58 |
| Last Modified: | 16 Jul 2015 00:46 |
|
RÉVISER |
