Nested loop join. The left child is the outer (driving) input, and the right child is the inner (lookup) input. For each row from the left, the right subtree is executed.