Moving selections into linear least fixpoint queries
Rakesh Agrawal, Prémkumar Dévanbu · 2003
A selection transposition algorithm is presented that allows selections that are conjunctions of predicates of the form 'column theta value' to be evaluated ahead of the least fixpoint operator while processing linear recursive queries. It is shown that the algorithm transposes the strongest possible selection.>