Optimizatioin of a Subclass of Conjunctive Queries

The optimization problem for a subclass of conjunctive queries which is formed by the union of the class of fan-out free queries and a subclass of typed fan-out queries is investigated. The typed fan-out queries in this class are obtained from simple tableaux by allowing at most one attribute to violate the simple-tableau property. The optimization problem for several restricted subsets of typed fan-out queries is already known to be NP-hard. It is shown that the queries under consideration possess several useful properties which are then used to obtain an O(n2) optimization algorithm based on the implication graph technique. The optimization of typed fan-out queries, obtained from simple tableaux by allowing at most two attributes to violate the simple tableau property, is shown to be NP-hard.

[1]  Jeffrey D. Ullman,et al.  Principles of Database Systems , 1980 .

[2]  David Maier,et al.  The Theory of Relational Databases , 1983 .

[3]  David S. Johnson,et al.  Testing Containment of Conjunctive Queries under Functional and Inclusion Dependencies , 1984, J. Comput. Syst. Sci..

[4]  David E. Smith,et al.  Ordering Conjunctive Queries , 1985, Artif. Intell..

[5]  Alfred V. Aho,et al.  Efficient optimization of a class of relational expressions , 1979, TODS.

[6]  Anthony C. Klug.  On conjunctive queries containing inequalities , 1988, JACM.

[7]  Gottfried Vossen,et al.  Quadratic-Time Optimization of SPJ-Expressions Including Inequality Selections by Tableaux , 1985 .

[8]  Pratul Dublish,et al.  An O(n²) Algorithm for Fan-Out Free Query Optimization , 1987, FSTTCS.

[9]  Mihalis Yannakakis,et al.  Equivalences Among Relational Expressions with the Union and Difference Operators , 1980, J. ACM.

[10]  Jeffrey D. Ullman,et al.  Principles Of Database And Knowledge-Base Systems , 1979 .

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12]  Yehoshua Chaim Sagiv,et al.  Optimization of queries in relational databases , 1981 .

[13]  David S. Johnson,et al.  Optimizing Conjunctive Queries that Contain Untyped Variables , 1983, SIAM J. Comput..

[14]  Jack Minker,et al.  Multiple Query Processing in Deductive Databases using Query Graphs , 1986, VLDB.

[15]  Alfred V. Aho,et al.  Equivalences Among Relational Expressions , 1979, SIAM J. Comput..

[16]  Ashok K. Chandra,et al.  Optimal implementation of conjunctive queries in relational data bases , 1977, STOC '77.

[17]  Yehoshua Sagiv.  Quadratic Algorithms for Minimizing Joins in Restricted Relational Expressions , 1983, SIAM J. Comput..

[18]  Eugene Wong,et al.  Decomposition—a strategy for query processing , 1976, TODS.

[19]  S. B. Yao,et al.  Optimization of query evaluation algorithms , 1979, ACM Trans. Database Syst..

[20]  Philip A. Bernstein,et al.  Power of Natural Semijoins , 1981, SIAM J. Comput..