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:
“The obsession with suicide is characteristic of the man who can neither live nor die, and whose attention never swerves from this double impossibility.”
—E.M. Cioran (b. 1911)
Related Phrases
Related Words