Quote: Rabin and Karp's hash function can be computed incrementally; more uniform than Pearson, but slower

Quotation Skeleton

Rabin and Karp [IBM J Research and Development, 21.2 1987] describe a pattern matching … [for d values, h:=(h*d+b[i]) MOD hLen] … Although this function [is slower than Pearson's, it] produces fewer collisions. Another … computed incrementally. [This is important for computing deltas of non-text files].   Google-1   Google-2

Copyright clearance needed for quotation.

Related Topics

Topic: hash table and hash functions (41 items)