With linear trees, the relation on one side of each operator is always a base relation.
However, because we need to examine the entire inner relation for each tuple of the outer
relation, inner relations must always be materialized. This makes left-deep trees appealing,
as inner relations are always base relations (and thus already materialized).