Efficient Evaluation of Right-, Left-, and Multi-Linear Rules

J. F. Naughton, R. Ramakrishnan, Y. Sagiv, J. D. Ullman

Research output: Contribution to journalArticlepeer-review

53 Scopus citations

Abstract

We present an algorithm for the efficient evaluation of a useful subset of recursive queries. Like the magic sets transformation, the algorithm consists of a rewriting phase followed by semi-naive bottom-up evaluation of the resulting rules. We prove that on a wide range of recursions, this algorithm achieves a factor of Ο(n) speedup over magic sets. Intuitively, the transformations in this algorithm achieve their performance by reducing the arity of the recursive predicates in the transformed rules.

Original languageEnglish
Pages (from-to)235-242
Number of pages8
JournalSIGMOD Record
Volume18
Issue number2
DOIs
StatePublished - 1 Jun 1989

Fingerprint

Dive into the research topics of 'Efficient Evaluation of Right-, Left-, and Multi-Linear Rules'. Together they form a unique fingerprint.

Cite this