Bottom-up Evaluation
Find all the tuples in all relations simultaneously.
Suppose we have predicates r1 ... Rn associated with relations R1 ... Rn.
For each of them we maintain two tables Ti and Ti'.
- Ti = all the tuples of relation Ri, so far.
- Ti' contains the tuples for the next
Iterate until Ti’ stops growing