(algorithm)
Definition: A hash function that uses an auxiliary array, but no shift or exclusive-or (xor) operations.
Generalization (I am a kind of ...)
hash function.
Note: This hash function may be particularly fast on computers that don't have hardware support for shifting or xor.
Author: PEB
Peter K. Pearson, Fast Hashing of Variable-Length Text Strings, CACM, 33(6):677-680, June 1990.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 18 March 2008.
HTML page formatted Tue Mar 18 12:18:03 2008.
Cite this as:
Paul E. Black, "Pearson's hash", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 18 March 2008. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/pearsonshash.html
