A FULL OUTER JOIN starts with two visible input tables.
two inputs
Read inputs
The left table has 4 rows; the right table has 5 rows.
left rows=4
Full-outer-join examples are tiny finite-table transforms; SQL dialect completeness, type coercion, optimizer behavior, execution cost, indexing, output ordering guarantees, and database-product claims are out of scope.
Both sides can survive
Matched rows, left-only rows, and right-only rows can all appear in the output.
both sides preserved
Summary
The rest of the book shows how each output class is built.