« Statis analysis introduction | Main | Basic Blocks »
June 30, 2004
hash function references
[Partitioned Hashing] Our work in model checking using magnetic disk needs some more background in hash functions since that turns out to be a central part of the work.
Turns out "partitioned hashing" in database land means splinigin the key into partitions and using each parition in the hash value computation.
"Uniform hashing" means each key has the same probability of ending up in each given chain. < ahref="http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/hashTable.htm">uniform hashing
"Perfect hashing" means there are no collisions.
Posted by jones at June 30, 2004 08:00 AM
Comments
Post a comment
Thanks for signing in, . Now you can comment. (sign out)
(If you haven't left a comment here before, you may need to be approved by the site owner before your comment will appear. Until then, it won't appear on the entry. Thanks for waiting.)