Double hashing is a computer programming technique used in hash tables to resolve hash collisions, cases when two different values to be searched for produce the same hash key. It is a popular collision-resolution technique in open-addressed hash tables. Double hashing is implemented in many popular computer libraries.
Read more about Double Hashing: Classical Applied Data Structure, Disadvantages
Famous quotes containing the word double:
“Each in their double Eden closed
They fail to see the gardener there
Has planted Error....”
—Philip Larkin (1922–1986)
Related Phrases
Related Words