NATURAL JOIN starts with two ordinary input tables.
two input tables
Read the tables
The left table has 4 rows; the right table has 5 rows.
left rows=4
NATURAL 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.
No key is typed
Unlike JOIN USING, this request does not name a key column.
key discovered automatically
Summary
The compiler will discover the same-named columns before matching rows.