The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - December (1989 vol.1)
pp: 424-432
ABSTRACT
<p>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 theta 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.</p>
INDEX TERMS
moving selections; linear least fixpoint queries; query language; relational databases; selection transposition algorithm; predicates; least-fixpoint operator; linear recursive queries; information retrieval; query languages; relational databases
CITATION
R. Agrawal, P. Devanbu, "Moving Selections into Linear Least Fixpoint Queries", IEEE Transactions on Knowledge & Data Engineering, vol.1, no. 4, pp. 424-432, December 1989, doi:10.1109/69.43418
27 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool