Static hashing

Static hashing is a form of hashing where lookups are performed on a finalized dictionary set (all objects in the dictionary are final and not changing).

Usage ^[1]

Application

Since static hashing requires that the database, its objects, and reference remain the same, its applications are limited. Databases which contain information which changes rarely are also eligible as it would only require a full rehash of the entire database on rare occasion. Examples of this include sets of words and definitions of specific languages, sets of significant data for an organization's personnel, etc.

Perfect hashing

Perfect hashing is a model of hashing in which any set of ${\displaystyle n}$ elements can be stored in a hash table of equal size and can have lookups done in constant time. It was specifically discovered and discussed by Fredman, Komlos and Szemeredi (1984) and has therefore been nicknamed "FKS hashing".^[2]

FKS hashing

FKS hashing makes use of a hash table with two levels in which the top level contains ${\displaystyle n}$ buckets which each contain their own hash table. FKS hashing requires that if collisions occur they must do so only on the top level.

Implementation

The top level contains a randomly created hash function, ${\displaystyle h(x)}$, which fits within the constraints of a Carter and Wegman hash function from universal hashing. Having done so the top level shall contain ${\displaystyle n}$ buckets labeled ${\displaystyle k_{1},k_{2},k_{3},...,k_{n}}$. Following this pattern, all of the buckets hold a hash table of size ${\displaystyle s_{i}}$ and a respective hash function ${\displaystyle h_{i}(x)}$. The hash function will be decided by setting ${\displaystyle s_{i}}$ to ${\displaystyle k_{i}^{2}}$ and randomly going through functions until there are no collisions. This can be done in constant time.

Performance

Because there are ${\displaystyle n \choose 2}$ pairs of elements, of which have a probability of collision equal to ${\displaystyle 1/n}$, FKS hashing can expect to have strictly less than ${\displaystyle n/2}$ collisions. Based on this fact and that each ${\displaystyle h(x)}$ was selected so that the number of collisions would be at most ${\displaystyle n/2}$, the size of each table on the lower level will be no greater than ${\displaystyle 2n}$.

See also

• Hash function
• Dynamic perfect hashing

References