(algorithm)
Definition: A conceptual method of open addressing for a hash table. A collision is resolved by putting the item in the next empty place given by a probe sequence which is independent of sequences for all other key.
See also collision resolution scheme, clustering free, double hashing, quadratic probing, linear probing, perfect hashing, simple uniform hashing.
Note: Since the probe sequences are independent, this is free of clustering. This is conceptual because real probe sequences are unlikely to be completely independent.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Mon May 11 15:07:58 2026.
Cite this as:
Paul E. Black, "uniform hashing", in
Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY)
Available from: /HTML/uniformhashn.html