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:
“One key, one solution to the mysteries of the human condition, one solution to the old knots of fate, freedom, and foreknowledge, exists, the propounding, namely, of the double consciousness. A man must ride alternately on the horses of his private and public nature, as the equestrians in the circus throw themselves nimbly from horse to horse, or plant one foot on the back of one, and the other foot on the back of the other.”
—Ralph Waldo Emerson (1803–1882)