A deep dive into hash tables, part 3
No Comments
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. The foundation for this part are these two conclusions from the previous parts: Unmatched rows from the left (top) input are returned bucket by bucket, with rows that are in the same bucket returned in…
