Hash join is similar to nested loop join but faster than nested loop join and hash join is used for equi join.
The task of a join algorithm is to find, for each distinct value of the join attribute, the set of tuples in each relation which have that value.
Classic hash join
The classic hash join algorithm for an inner join of two relations proceeds as follows:
- First prepare a hash table of the smaller relation. The hash table entries consist of the join attribute and its row. Because the hash table is accessed by applying a hash function to the join attribute, it will be much quicker to find a given join attribute's rows by using this table than by scanning the original relation.
- Once the hash table is built, scan the larger relation and find the relevant rows from the smaller relation by looking in the hash table.
The first phase is usually called the "build" phase, while the second is called the "probe" phase. Similarly, the join relation on which the hash table is built is called the "build" input, whereas the other input is called the "probe" input. It is like merge join algorithm[clarification needed].
This algorithm is simple, but it requires that the smaller join relation fits into memory, which is sometimes not the case. A simple approach to handling this situation proceeds as follows:
- For each tuple in the build input
- Add to the in-memory hash table
- If the size of the hash table equals the maximum in-memory size:
- Scan the probe input , and add matching join tuples to the output relation
- Reset the hash table, and continue scanning the build input
- Do a final scan of the probe input and add the resulting join tuples to the output relation
This is essentially the same as the block nested loop join algorithm. This algorithm scans more times than necessary.
Grace hash join
A better approach is known as the "grace hash join", after the GRACE database machine for which it was first implemented.
This algorithm avoids rescanning the entire relation by first partitioning both and via a hash function, and writing these partitions out to disk. The algorithm then loads pairs of partitions into memory, builds a hash table for the smaller partitioned relation, and probes the other relation for matches with the current hash table. Because the partitions were formed by hashing on the join key, it must be the case that any join output tuples must belong to the same partition.
It is possible that one or more of the partitions still does not fit into the available memory, in which case the algorithm is recursively applied: an additional orthogonal hash function is chosen to hash the large partition into sub-partitions, which are then processed as before. Since this is expensive, the algorithm tries to reduce the chance that it will occur by forming as reasonably smaller partitions as possible during the initial partitioning phase.
Hybrid hash join
The hybrid hash join algorithm is a refinement of the grace hash join which takes advantage of more available memory. During the partitioning phase, the hybrid hash join uses the available memory for two purposes:
- To hold the current output buffer page for each of the partitions
- To hold an entire partition in-memory, known as "partition 0"
Because partition 0 is never written to or read from disk, the hybrid hash join typically performs fewer I/O operations than the grace hash join. Note that this algorithm is memory-sensitive, because there are two competing demands for memory (the hash table for partition 0, and the output buffers for the remaining partitions). Choosing too large a hash table might cause the algorithm to recurse because one of the non-zero partitions is too large to fit into memory.
Hash joins can also be evaluated for an anti-join predicate (a predicate selecting values from one table when no related values are found in the other). Depending on the sizes of the tables, different algorithms can be applied:
Hash left anti-join
- Prepare a hash table for the NOT IN side of the join.
- Scan the other table, selecting any rows where the join attribute hashes to an empty entry in the hash table.
This is more efficient when the NOT IN table is smaller than the FROM table
Hash right anti-join
- Prepare a hash table for the FROM side of the join.
- Scan the NOT IN table, removing the corresponding records from the hash table on each hash hit
- Return everything that left in the hash table
This is more efficient when the NOT IN table is larger than the FROM table
Hash semi-join is used to return the records found in the other table. Unlike plain join, it returns each matching record from the leading table only once, not regarding how many matches are there in the IN table.
As with the anti-join, semi-join can also be left and right:
Hash left semi-join
- Prepare a hash table for the IN side of the join.
- Scan the other table, returning any rows that produce a hash hit.
The records are returned right after they produced a hit. The actual records from the hash table are ignored.
This is more efficient when the IN table is smaller than the FROM table
Hash right semi-join
- Prepare a hash table for the FROM side of the join.
- Scan the IN table, returning the corresponding records from the hash table and removing them
With this algorithm, each record from the hash table (that is, FROM table) can only be returned once, since it is removed after being returned.
This is more efficient when the IN table is larger than the FROM table
- Hansjörg Zeller; Jim Gray (1990). "An Adaptive Hash Join Algorithm for Multiuser Environments" (PDF). Proceedings of the 16th VLDB conference. Brisbane: 186–197. Archived from the original (PDF) on 2012-03-11. Retrieved 2008-09-21.