Hash collision is when two different keys in a hash table generate the same hash value, causing them to map to the same bucket or slot in the table. This can lead to performance issues and even denial-of-service attacks if an attacker carefully crafts a set of keys that all collide.
"Ugh, the new intern pushed some code that caused a bunch of hash collisions in the user session store. Now the site is slower than a Zune installing a firmware update."
"I was up all night debugging a weird issue with our in-memory cache, only to find out it was due to some hash collisions. I should've just become a barista like my mom said."
What is a Hash Collision? - A quick overview of what hash collisions are and some techniques to resolve them.
Denial of Service via Hash Table Multi-Collisions - A deep dive into how hash collisions can be exploited for denial-of-service attacks.
Hash Function Comparison - A benchmark of various non-cryptographic hash functions and their collision resistance.
Note: the Developer Dictionary is in Beta. Please direct feedback to skye@statsig.com.