Double hashing

Double hashing is a computer programming technique used in conjunction with open addressing in hash tables to resolve hash collisions, by using a secondary hash of the key as an offset when a collision occurs. Double hashing with open addressing is a classical data structure on a table ${\displaystyle T}$.

The double hashing technique uses one hash value as an index into the table and then repeatedly steps forward an interval until the desired value is located, an empty location is reached, or the entire table has been searched; but this interval is set by a second, independent hash function. Unlike the alternative collision-resolution methods of linear probing and quadratic probing, the interval depends on the data, so that values mapping to the same location have different bucket sequences; this minimizes repeated collisions and the effects of clustering.

Given two random, uniform, and independent hash functions ${\displaystyle h_{1}}$ and ${\displaystyle h_{2}}$, the ${\displaystyle i}$th location in the bucket sequence for value ${\displaystyle k}$ in a hash table of ${\displaystyle |T|}$ buckets is: ${\displaystyle h(i,k)=(h_{1}(k)+i\cdot h_{2}(k)){\bmod {|}}T|.}$ Generally, ${\displaystyle h_{1}}$ and ${\displaystyle h_{2}}$ are selected from a set of universal hash functions; ${\displaystyle h_{1}}$ is selected to have a range of ${\displaystyle \{0,|T|-1\}}$ and ${\displaystyle h_{2}}$ to have a range of ${\displaystyle \{1,|T|-1\}}$. Double hashing approximates a random distribution; more precisely, pair-wise independent hash functions yield a probability of ${\displaystyle (n/|T|)^{2}}$ that any pair of keys will follow the same bucket sequence.

Selection of h₂(k)

The secondary hash function ${\displaystyle h_{2}(k)}$ should have several characteristics:

• It should never yield an index of zero.
• It should cycle through the whole table.
• It should be very fast to compute.
• It should be pair-wise independent of ${\displaystyle h_{1}(k)}$.
• The distribution characteristics of ${\displaystyle h_{2}}$ are irrelevant. It is analogous to a random-number generator.
• All ${\displaystyle h_{2}(k)}$ should be relatively prime to |T|.

In practice:

• If division hashing is used for both functions, the divisors are chosen as primes.
• If |T| is a power of 2, the first and last requirements are usually satisfied by making ${\displaystyle h_{2}(k)}$ always return an odd number. This has the side effect of doubling the chance of collision due to one wasted bit. ^[1]

Analysis

Let ${\displaystyle n}$ be the number of elements stored in ${\displaystyle T}$, then ${\displaystyle T}$'s load factor is ${\displaystyle \alpha =n/|T|}$. That is, start by randomly, uniformly and independently selecting two universal hash functions ${\displaystyle h_{1}}$ and ${\displaystyle h_{2}}$ to build a double hashing table ${\displaystyle T}$. All elements are put in ${\displaystyle T}$ by double hashing using ${\displaystyle h_{1}}$ and ${\displaystyle h_{2}}$. Given a key ${\displaystyle k}$, the ${\displaystyle (i+1)}$-st hash location is computed by:

$${\displaystyle h(i,k)=(h_{1}(k)+i\cdot h_{2}(k)){\bmod {|}}T|.}$$

Let ${\displaystyle T}$ have fixed load factor ${\displaystyle \alpha :1>\alpha >0}$. Bradford and Katehakis ^[2] showed the expected number of probes for an unsuccessful search in ${\displaystyle T}$, still using these initially chosen hash functions, is ${\displaystyle {\tfrac {1}{1-\alpha }}}$ regardless of the distribution of the inputs. Pair-wise independence of the hash functions suffices.

Like all other forms of open addressing, double hashing becomes linear as the hash table approaches maximum capacity. The usual heuristic is to limit the table loading to 75% of capacity. Eventually, rehashing to a larger size will be necessary, as with all other open addressing schemes.

Variants

Peter Dillinger's PhD thesis ^[3] points out that double hashing produces unwanted equivalent hash functions when the hash functions are treated as a set, as in Bloom filters: If ${\displaystyle h_{2}(y)=-h_{2}(x)}$ and ${\displaystyle h_{1}(y)=h_{1}(x)+k\cdot h_{2}(x)}$, then ${\displaystyle h(i,y)=h(k-i,x)}$ and the sets of hashes ${\displaystyle \left\{h(0,x),...,h(k,x)\right\}=\left\{h(0,y),...,h(k,y)\right\}}$ are identical. This makes a collision twice as likely as the hoped-for ${\displaystyle 1/|T|^{2}}$.

There are additionally a significant number of mostly-overlapping hash sets; if ${\displaystyle h_{2}(y)=h_{2}(x)}$ and ${\displaystyle h_{1}(y)=h_{1}(x)\pm h_{2}(x)}$, then ${\displaystyle h(i,y)=h(i\pm 1,x)}$, and comparing additional hash values (expanding the range of ${\displaystyle i}$) is of no help.

Triple hashing

Adding a quadratic term ${\displaystyle i^{2},}$ ^[4] ${\displaystyle i(i+1)/2}$ (a triangular number) or even ${\displaystyle i^{2}\cdot h_{3}(x)}$ (triple hashing) ^[5] to the hash function improves the hash function somewhat ^[4] but does not fix this problem; if:

${\displaystyle h_{1}(y)=h_{1}(x)+k\cdot h_{2}(x)+k^{2}\cdot h_{3}(x),}$

${\displaystyle h_{2}(y)=-h_{2}(x)-2k\cdot h_{3}(x),}$ and

${\displaystyle h_{3}(y)=h_{3}(x).}$

then

${\displaystyle {\begin{aligned}h(k-i,y)&=h_{1}(y)+(k-i)\cdot h_{2}(y)+(k-i)^{2}\cdot h_{3}(y)\\&=h_{1}(y)+(k-i)(-h_{2}(x)-2kh_{3}(x))+(k-i)^{2}h_{3}(x)\\&=\ldots \\&=h_{1}(x)+kh_{2}(x)+k^{2}h_{3}(x)+(i-k)h_{2}(x)+(i^{2}-k^{2})h_{3}(x)\\&=h_{1}(x)+ih_{2}(x)+i^{2}h_{3}(x)\\&=h(i,x).\\\end{aligned}}}$

Enhanced double hashing

Adding a cubic term ${\displaystyle i^{3}}$ ^[4] or ${\displaystyle (i^{3}-i)/6}$ (a tetrahedral number), ^[1] does solve the problem, a technique known as enhanced double hashing. This can be computed efficiently by forward differencing:

structkey;/// Opaque/// Use other data types when needed. (Must be unsigned for guaranteed wrapping.)externunsignedinth1(structkeyconst*),h2(structkeyconst*);/// Calculate k hash values from two underlying hash functions/// h1() and h2() using enhanced double hashing.  On return,///     hashes[i] = h1(x) + i*h2(x) + (i*i*i - i)/6./// Takes advantage of automatic wrapping (modular reduction)/// of unsigned types in C.voidext_dbl_hash(structkeyconst*x,unsignedinthashes[],unsignedintn){unsignedinta=h1(x),b=h2(x),i;hashes[i]=a;for(i=1;i<n;i++){a+=b;// Add quadratic difference to get cubicb+=i;// Add linear difference to get quadratic// i++ adds constant difference to get linearhashes[i]=a;}}

In addition to rectifying the collision problem, enhanced double hashing also removes double-hashing's numerical restrictions on ${\displaystyle h_{2}(x)}$'s properties, allowing a hash function similar in property to (but still independent of) ${\displaystyle h_{1}}$ to be used. ^[1]

See also

• Cuckoo hashing
• 2-choice hashing

References

1. Dillinger, Peter C.; Manolios, Panagiotis (November 15–17, 2004). Bloom Filters in Probabilistic Verification (PDF). 5h International Conference on Formal Methods in Computer Aided Design (FMCAD 2004). Austin, Texas. CiteSeerX   10.1.1.119.628 . doi:10.1007/978-3-540-30494-4_26.
2. Bradford, Phillip G.; Katehakis, Michael N. (April 2007), "A Probabilistic Study on Combinatorial Expanders and Hashing" (PDF), SIAM Journal on Computing, 37 (1): 83–111, doi:10.1137/S009753970444630X, MR   2306284, archived from the original (PDF) on 2016-01-25.
3. Dillinger, Peter C. (December 2010). Adaptive Approximate State Storage (PDF) (PhD thesis). Northeastern University. pp. 93–112.
4. Kirsch, Adam; Mitzenmacher, Michael (September 2008). "Less Hashing, Same Performance: Building a Better Bloom Filter" (PDF). Random Structures and Algorithms. 33 (2): 187–218. CiteSeerX   10.1.1.152.579 . doi:10.1002/rsa.20208.
5. Alternatively defined with the triangular number, as in Dillinger 2004.

External links

• How Caching Affects Hashing by Gregory L. Heileman and Wenbin Luo 2005.
• Hash Table Animation
• klib a C library that includes double hashing functionality.