On compile-time query optimization in deductive databases by means of static filtering

  • Authors:
  • Michael Kifer;Eliezer L. Lozinskii

  • Affiliations:
  • State Univ. of New York, Stony Brook;Hebrew Univ., Jerusalem, Israel

  • Venue:
  • ACM Transactions on Database Systems (TODS)
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

We extend the query optimization techniques known as algebric manipulations with relational expressions [48] to work with deductive databases. In particular, we propose a method for moving data-independent selections and projections into recursive axioms, which extends all other known techniques for performing that task [2, 3, 9, 18, 20]. We also show that, in a well-defined sense, our algorithm is optimal among the algorithms that propagate data-independent selections through recursion.