Moving selections into linear least fixpoint queries

摘要

A selection transposition algorithm is presented that allowsnselections that are conjunctions of predicates of the form `columnnθ value' to be evaluated ahead of the least fixpoint operatornwhile processing linear recursive queries. It is shown that thenalgorithm transposes the strongest possible selection