Moving Selections into Linear Least Fixpoint Queries

Efficient least fixpoint query evaluation is crucial to using logic as the query language for relational databases. We represent a selection transportation algorithm that allows selections that are conjunctions of the predicates of the form column 0 value to be evaluated ahead of the least fixpoint operator while processing linear recursive queries. We also show that our algorithm transposes the strongest possible selection.