NIST

simple uniform hashing

(definition)

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 Fri Feb 23 10:06:08 2018.

Cite this as:
Paul E. Black, "simple uniform hashing", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/simpleUniformHashing.html