Quadratic probing

Quadratic probing is a scheme in computer programming for resolving collisions in hash tables.

Quadratic probing operates by taking the original hash value and adding successive values of an arbitrary quadratic polynomial to the starting value. This algorithm is used in open-addressed hash tables. Quadratic probing provides good memory caching because it preserves some locality of reference; however, linear probing has greater locality and, thus, better cache performance. Quadratic probing better avoids the clustering problem that can occur with linear probing, although it is not immune.

Quadratic probing is used in the Berkeley Fast File System to allocate free blocks. The allocation routine chooses a new cylinder-group when the current is nearly full using quadratic probing, because of the speed it shows in finding unused cylinder-groups.

Quadratic probing is a "classical" method to deal with collisions.A recent development to deal with collisions in hash tables ina potentially more efficient manner is cuckoo hashing.

Quadratic Probing Algorithm

Let $h(k)$ be a hash function that maps an element $k$ to an integer in $[0,m-1]$, where $m$ is the size of the table.

Let the $i$^th probe position for a value $k$ be given by the function $h(k,i)\; =\; (\; h(k)\; +\; c\_1\; i\; +\; c\_2\; i^2\; )\; pmod\{m\}$, where $c\_2\; eq\; 0$. If $c\_2\; =\; 0$, then $h(k,i)$ degrades to a linear probe. For a given hash table, the values of $c\_1$ and $c\_2$ remain constant.

Example: If $h(k,i)\; =\; (h(k)\; +\; i\; +\; i^2)\; pmod\{m\}$, then the probe sequence will be $h(k),\; h(k)+2,\; h(k)+6,\; ...$

For $m\; =\; 2^n$, a good choice for the constants are $c\_1\; =\; c\_2\; =$1/2, as the values $h(k,i)$ for $i$ in $[0,m-1]$ are all distinct. [Proof: assume there exist i,j such that i,j in $[0,m-1]$ and (i+i^2)/2 = (j+j^2)/2 mod m. Then i+i^2 = j+j^2 mod 2m, i^2-j^2 + i-j = 0 mod 2m, (i-j)(i+j) + (i-j) = 0 mod 2m, and (i-j)(i+j+1) = 0 mod 2m. Since 2m is a power of 2, and only one of the two factors can be even, we must have i-j = 0 mod 2m or i+j+1 = 0 mod 2m. The latter is not possible with i,j in $[0,m-1]$, and the former implies that i=j. ] This leads to a probe sequence of $h(k),\; h(k)+1,\; h(k)+3,\; h(k)+6,\; ...$ where the values increase by $1,\; 2,\; 3,\; ...$.

For prime $m\; >\; 2$, most choices of $c\_1$ and $c\_2$ will make $h(k,i)$ distinct for $i$ in $[0,\; (m-1)/2]$. Such choices include $c\_1\; =\; c\_2\; =$1/2, $c\_1\; =\; c\_2\; =$1, and $c\_1\; =\; 0,\; c\_2\; =\; 1$. Because there are only about m/2 distinct probes for a given element, it is difficult to guarantee that insertions will succeed when the load factor is > 1/2.

ee also

* Hash tables
* Hash collision
* Double hashing
* Linear probing
* Hash function

Notes

References