Collision Resolution
Hash collisions are practically unavoidable when hashing a random subset of a large set of possible keys. For example, if 2,500 keys are hashed into a million buckets, even with a perfectly uniform random distribution, according to the birthday problem there is a 95% chance of at least two of the keys being hashed to the same slot.
Therefore, most hash table implementations have some collision resolution strategy to handle such events. Some common strategies are described below. All these methods require that the keys (or pointers to them) be stored in the table, together with the associated values.
Read more about this topic: Hash Table
Famous quotes containing the words collision and/or resolution:
“When the wind carries a cry which is meaningful to human ears, it is simpler to believe the wind shares with us some part of the emotion of Being than that the mysteries of a hurricane’s rising murmur reduce to no more than the random collision of insensate molecules.”
—Norman Mailer (b. 1923)
“I had crossed de line of which I had so long been dreaming. I was free; but dere was no one to welcome me to de land of freedom. I was a stranger in a strange land, and my home after all was down in de old cabin quarter, wid de ole folks, and my brudders and sisters. But to dis solemn resolution I came; I was free, and dey should be free also; I would make a home for dem in de North, and de Lord helping me, I would bring dem all dere.”
—Harriet Tubman (c. 1820–1913)