Hugo Kornelis continues a deep dive into hash tables in SQL Server:
Welcome back! In the previous parts, I first showed how a Hash Match (Left Outer Join) can give insight in the order of data in a hash table, and then used that trick to obtain and verify some interesting insights into the internal structure of such a table. It’s now time to see if this same trick can also be used to find hash collisions.
Hugo finds some interesting results along the way, so check it out.