Title :
Moving selections into linear least fixpoint queries
Author :
Agrawal, Rakesh ; Devanbu, Prem
Author_Institution :
AT&T Bell Labs., Murray Hill, NJ, USA
Abstract :
A selection transposition algorithm is presented that allows selections that are conjunctions of predicates of the form `column θ 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
Keywords :
database theory; column &thetas; value; linear least fixpoint queries; linear recursive queries; predicate conjunctions; selection transposition algorithm; Algebra; Database languages; Heart; Logic programming; Query processing; Relational databases; Shortest path problem;
Conference_Titel :
Data Engineering, 1988. Proceedings. Fourth International Conference on
Conference_Location :
Los Angeles, CA
Print_ISBN :
0-8186-0827-7
DOI :
10.1109/ICDE.1988.105491
