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 language | English |
---|---|
Pages (from-to) | 235-242 |
Number of pages | 8 |
Journal | SIGMOD Record |
Volume | 18 |
Issue number | 2 |
DOIs | |
State | Published - 1 Jun 1989 |