DocumentCode
921355
Title
Moving selections into linear least fixpoint queries
Author
Agrawal, Rakesh ; Devanbu, Premkumar
Author_Institution
AT&T Bell Labs., Murray Hill, NJ, USA
Volume
1
Issue
4
fYear
1989
fDate
12/1/1989 12:00:00 AM
Firstpage
424
Lastpage
432
Abstract
Efficient least-fixpoint query evaluation is crucial to using logic as the query language for relational databases. The authors present a selection transposition algorithm that allows selections that are conjunctions of the predicates of the form column θ value to be evaluated ahead of the least-fixpoint operator while processing linear recursive queries. It is also shown that the algorithm transposes the strongest possible selection
Keywords
information retrieval; query languages; relational databases; least-fixpoint operator; linear least fixpoint queries; linear recursive queries; moving selections; predicates; query language; relational databases; selection transposition algorithm; Algebra; Database languages; Heart; Logic programming; Query processing; Relational databases; Terminology;
fLanguage
English
Journal_Title
Knowledge and Data Engineering, IEEE Transactions on
Publisher
ieee
ISSN
1041-4347
Type
jour
DOI
10.1109/69.43418
Filename
43418
Link To Document