News for hackers. Stuff that matters.
Re:Hash indexes are faster than btree indexes? by godmodus on Tuesday March 21, 2017 @02:04AM (#13920182)
Collision probabilities are way more probably than people intuitively care to believe. The pigeonhole principle or the birthday Paradoxon exemplify this quiet well.

Hash tables are good, for small (relative to available space) static sets that don't change. Dynamic production environments will introduce an escalating probablity for performance degradation, and this can detrimental for critical systems.

There are no comments on this comment yet.