Double Hashing

Double Hashing is a scheme in computer programming for efficiently simulating a sequence of hash functions using two values--one as a starting value and one as an interval between successive values in modular arithmetic. This is a popular collision resolution technique in open-addressed hash tables. It can also be employed in Bloom filters to compute the requisite hash values associated with each element, but enhanced double hashing is superior in terms of accuracy (false positive probability).