| 
|
QuoteRef: mckeBJ2_1990
topics >
all references >
ThesaHelp:
references m-o
Topic:
hash table and hash functions
Reference
McKenzie, B.J., Harries, R., Bell, T., "Selecting a hashing algorithm", Software--Practice and Experience, 20, 2, pp. 209-224, February 1990. Google
217 ;;Quote: an initial hash value of 0 is better than using the length of the string
223 ;;Quote: a shifted sum works well for hashing but the modulus needs careful selection; primes aren't best
223+;;Quote: for hashing, use double shifted sum modulo an odd number; or select number by testing
ThesaHelp: references m-o (268 items)
Topic: hash table and hash functions (41 items)