simple uniform hashing


Definition: The assumption or goal that items are equally likely to hash to any value.

See also hash table, perfect hashing, uniform hashing.

Note: If this assumption holds, items are evenly distributed in a hash table and there are a minimum of collisions.

Author: PEB

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 17 December 2004.
HTML page formatted Wed Mar 13 12:42:46 2019.

Cite this as:
Paul E. Black, "simple uniform hashing", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 17 December 2004. (accessed TODAY) Available from: