y. The figure below shows how the Sort-Merge-Join strategy works.</p>
<center>
<img src="/img/blog/joins-smj.png" style="width:90%;margin:15px">
</center>
<p>The Hybrid-Hash-Join distinguishes its inputs as build-side and probe-side input and works in two phases, a build phase followed by a probe phase. In the build phase, the algorithm reads the build-side input and inserts all data elements into an in-memory hash table indexed by their join key attributes. If the hash table outgrows the algorithm&rsquo;s 