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:
“I know my fate. One day my name will be tied to the memory of something monstrous—a crisis without equal on earth, the most profound collision of conscience, a decision invoked against everything that had previously been believed, demanded, sanctified. I am no man, I am dynamite!”
—Friedrich Nietzsche (1844–1900)
“Had I been less resolved to work, I would perhaps had made an effort to begin immediately. But since my resolution was formal and before twenty four hours, in the empty slots of the next day where everything fit so nicely because I was not yet there, it was better not to choose a night at which I was not well-disposed for a debut to which the following days proved, alas, no more propitious.... Unfortunately, the following day was not the exterior and vast day which I had feverishly awaited.”
—Marcel Proust (1871–1922)