Uses the proof-tree transformation technique to study two different recursive query optimization problems: 1-boundedness, and, stage preserving linearizability.