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:
“I grew up confidently expecting to have a profession and earn my own living, and also confidently expecting to be married and have children. It was fifty-fifty with me. I was just as passionately determined to have children as I was to have a career. And my mother was the triumphant answer to all doubts as to the success of this double role. From my earliest memory she had more than half supported the family and yet she was supremely a mother.”
—Crystal Eastman (1881–1928)