Quote: Pearson's hash function uses an intermediate table; very uniform

Quotation Skeleton

Peter K. Pearson proposes in his paper [Comm. of the ACM, 33.6, 1990] a hash function specifically tailored to variable-length text strings. [... h := table[h XOR b[i]] … run it twice to get 16 bits instead … of 8] … This hash function produces a very uniform distribution …   Google-1   Google-2

Copyright clearance needed for quotation.

Related Topics

Topic: hash table and hash functions (41 items)