Optimization of a subclass of conjunctive queries

  • Pratul Dublish
  • Joachim Biskup
  • Yehoshua Sagiv
Optimization
Part of the Lecture Notes in Computer Science book series (LNCS, volume 470)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5. References

  1. [ASU1]
    A.V.Aho, Y.Sagiv and J.D.Ullman, Efficient Optimization of a Class of Relational Expressions, ACM TODS, Vol 4, No 4, 1979.Google Scholar
  2. [ASU2]
    A.V.Aho, Y.Sagiv and J.D.Ullman, Equivalences among Relational Expressions, SIAM J. on Computing, Vol 8, No 2, 1979.Google Scholar
  3. [CM]
    A.Chandra and P.M.Merlin, Optimal Implementation of Conjunctive Queries in Relational Databases, Proc. of 9th ACM STOC, 1977.Google Scholar
  4. [Du]
    P.Dublish, Optimization and Expressibility of Relational Queries, Ph.D. Thesis, Dept. of Computer Science & Engg, IIT Delhi, 1988.Google Scholar
  5. [DM]
    P.Dublish and S.N.Maheshwari, An O(n2) Algorithm for Fan-Out Free Query Optimization, Proc. of the 7th Conf. on FST&TCS, Lec Notes in Computer Science, Vol 287, Springer Verlag, 1987.Google Scholar
  6. [GJ]
    M.Garey and D.S.Johnson, Computers and Intractability — A Guide to the Theory of NP-Completeness, W.H.Freeman, 1979.Google Scholar
  7. [JK]
    D.S.Johnson and A.Klug, Optimizing Conjunctive Queries that contain Untyped Variables, SIAM J. on Computing, Vol 12, No 4, 1983.Google Scholar
  8. [Ma]
    D.Maier, The Theory of Relational Databases, Computer Science Press, 1983.Google Scholar
  9. [Mu]
    B.N.S.Murthy, A Study of Complexity of some Optimization and Design Issues in Relational Database Systems, Ph.D. Thesis, Dept. of Electrical Engg, IIT Delhi, 1985.Google Scholar
  10. [Sa1]
    Y.Sagiv, Optimization of Queries in Relational Databases, UMI Research Press, 1981.Google Scholar
  11. [Sa2]
    Y.Sagiv, Quadratic Algorithms for Minimizing Joins in Restricted Relational Expressions, SIAM J. on Computing, Vol 12, No 2, 1983.Google Scholar
  12. [Ul]
    J.D.Ullman, Principles of Database Systems, Computer Science Press, 1982.Google Scholar

Copyright information

© Springer-Verlag 1990

Authors and Affiliations

  • Pratul Dublish
    • 1
  • Joachim Biskup
    • 1
  • Yehoshua Sagiv
    • 2
  1. 1.Institut für InformatikUniversität HildesheimHildesheimWest Germany
  2. 2.Hebrew University and Stanford UniversityGermany

Personalised recommendations