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.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 17 December 2004.
HTML page formatted Fri Mar 25 16:20:35 2011.
Cite this as:
Paul E. Black, "simple uniform hashing", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 17 December 2004. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/simpleUniformHashing.html