Quote: for open-addressing, triple hashing modifies the increment as well as the hash value; much higher accuracy for Bloom filters

Quotation Skeleton

In order to achieve very low probabilities of … [for collision resolution in open-addressed hash tables] to what we call triple hashing. The idea is to … [modify the increment at each step In addition to x := (x+y) MOD m, we also modify y, y := (y+z) MOD m] … we show that triple hashing can achieve much … [for Bloom filters] …   Google-1   Google-2

Copyright clearance needed for quotation.

Related Topics

Topic: hash filter (18 items)
Topic: hash table and hash functions (41 items)