Skip to main content

hash join

Short Description

The hash join node builds a hash table in memory based on the smaller table and then scans the larger one looking for matches

Detailed Description

The hash join node builds a hash table in memory based on the smaller table and then scans the larger one looking for matches. Hash joins are computationally expensive and require additional memory for the hash table to be built in, which is why a merge join is preferred if possible.

If the hash table is too big for memory, it will spill to disk which will impact performance.

Search online

If this article doesn't have the information you need you can try searching online. Remember, you can contribute suggestions to this page.