May 2017
Beginner
416 pages
10h 37m
English
The second option is a hash join. The following strategy could be applied to solve our little problem:
← Hash join ← Sequential scan table 1 ← Sequential scan table 2
Both sides can be hashed and the hash keys could be compared leaving us with the result of the join. The trouble here is that all the values have to be hashed and put somewhere.
Read now
Unlock full access