Part 1 of 5 · 1 min read
Why this page comes first
In this module you will
- Explain how a nested loop join combines two tables, and when it is a good choice.
- Explain how a hash join combines two tables, and when it is a good choice.
- Explain how a sort-merge join combines two tables, and when it is a good choice.
- Match a join scenario to the join algorithm the optimizer would likely pick.
The previous page named the optimizer as the stage that chooses concrete algorithms. Joining two tables is one of the most common operations it has to choose an algorithm for. The three algorithms on this page are the ones it typically picks among.