Perfect hash function (nonfiction)

In computer science, a perfect hash function for a set S is a hash function that maps distinct elements in S to a set of integers, with no collisions. In mathematical terms, it is an injective function.

Perfect hash functions may be used to implement a lookup table with constant worst-case access time.

A perfect hash function has many of the same applications as other hash functions, but with the advantage that no collision resolution has to be implemented.

Fiction cross-reference

• Gnomon Algorithm
• Scrying engine

Nonfiction cross-reference

• Algorithm (nonfiction)
• Computer science (nonfiction)
• Hash function (nonfiction)
• Mathematics (nonfiction)
• Set theory (nonfiction)

External links:

• Computer science
• Computer science @ Wikipedia