Query containment checking as a view updating problem

  • Carles Farré
  • Ernest Teniente
  • Toni Urpí
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1460)


In this paper we present a new approach that handles Query Containemnt problems by expressing them as a view updating problem. Since this approach is independent of any particular view updating method, it provides a general framework that joins research efforts in both the Query Containment checking and view updating fields. In particular, the larger development of current view updating technology allows us to check properly Query Containment when considering negative-derived literals or integrity constraints. Existing methods for Query Containment checking that deal with these cases do not check actually containment but another related property called uniform containment, which is a sufficient but not necessary condition for containment.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [ASU79]
    A.V. Aho, Y. Sagiv, J.D. Ullman: “Efficient Optimization of a Class of Relational Expressions”. ACM TODS, Vol. 4, No. 4, 1979, pp. 435–454.CrossRefGoogle Scholar
  2. [BH97]
    N.R. Brisaboa, H.J. Hernandez: “Testing Bag-Containment of Conjunctive Queries”. Acta Informatica, Vol. 34, No.7, 1997, pp. 557–578.MATHMathSciNetCrossRefGoogle Scholar
  3. [BJNS94]
    M. Buchheit, M.A. Jeusfeld, W. Nutt, M. Staudt: “Subsumption of queries in object-oriented databases”. Information Systems, Vol. 19, No. 1, 1994.Google Scholar
  4. [BR86]
    F. Bancilhon, R. Ramakrishnan: “An amateur's introduction to recursive query processing strategies”. Proceedings of the 1986 ACM SIGMOD International Conference. SIGMOD Record, Vol. 15, No. 2, 1986, pp. 16–52.CrossRefGoogle Scholar
  5. [CM77]
    A.K. Chandra, P.M. Merlin: “Optimal Implementation of Conjunctive Queries in Relational Data Bases”, Proceedings of the 9th ACM SIGACT Symposium on Theory of Computing. 1977, pp. 77–90.Google Scholar
  6. [CR97]
    C. Chekuri, A. Rajaraman: “Conjunctive Query Containment Revisited”. Proceedings of ICDT'97. LNCS, Vol. 1186, Springer, 1997, pp. 56–70.Google Scholar
  7. [CTU97]
    D. Costal, E. Teniente, T. Urpi: “An Approach to Obtain Intensional Translations for Consistent View Updating”. Proocedings of the DOOD'97. LNCS, Vol. 1341, Springer, 1997, pp. 175–192.Google Scholar
  8. [CV92]
    S. Chaudhuri, M.Y. Vardi: “On the Equivalence of Recursive and Nonrecursive Datalog Programs”. Proc. of the PoDS'92. ACM Press, 1992, pp. 55–66.Google Scholar
  9. [CV93]
    S. Chaudhuri, M. Vardi: “Optimizing real conjunctive queries”. Proceedings of the PoDS'93. ACM Press, 1993, pp. 59–70.Google Scholar
  10. [DS96]
    G. Dong, J. Su: “Conjunctive QC with respect to views and constraints”. Information Processing Letters, No. 57, pp. 95–102, 1996.MathSciNetCrossRefGoogle Scholar
  11. [DTU96]
    H. Decker, E. Teniente, T. Urpf: “How to tackle schema validation by view updating”. Proc. of the EDBT'96. LNCS 1057, Springer, 1996, pp. 535–549.Google Scholar
  12. [JK83]
    D.S. Johnson, A. Klug: “Optimizing conjunctive queries that contain untyped variables”. SIAM Journal on Conputing, Vol. 12, No. 4, pp. 616–640, 1983.MATHMathSciNetCrossRefGoogle Scholar
  13. [Klu88]
    A. Klug: “On Conjunctive Queries Containing Inequalities”. Journal of the ACM, Vol. 35, No. 1, 1988, pp. 146–160.MATHMathSciNetCrossRefGoogle Scholar
  14. [Llo87]
    J.W. Lloyd: Foundations of Logic Programming. Springer, 1987.Google Scholar
  15. [LMSS93]
    A. Levy, I.S. Mumick, Y. Sagiv, O. Shmueli: “Equivalence, query-reachability and satisfiability in Datalog extensions”. Proceedings of the PoDS'93. ACM Press, 1993, pp. 109–122.Google Scholar
  16. [LS93]
    A. Levy, Y. Sagiv: “Queries Independent of Updates”. Proceedings of the VLDB'93. Morgan Kaufmann, 1993, pp. 171–181.Google Scholar
  17. [LS95]
    A. Levy, Y. Sagiv: “Semantic Query Optimization in Datalog Programs”. Proceedings of the PoDS'95. ACM Press, 1995, pp. 163–173.Google Scholar
  18. [LS97]
    A. Levy, D. Suciu: “Deciding Containment for Queries with Complex Objects”. Proceedings of the PoDS'97. ACM Press, 1995, pp. 20–31Google Scholar
  19. [LT84]
    J.W. Lloyd, R.W. Topor: “Making Prolog More Expressive”. Journal of Logic Programming, 1984, No. 3, pp. 225–240.MathSciNetCrossRefGoogle Scholar
  20. [Oli91]
    A. Olivé: “Integrity Checking in Deductive Databases”. Proceedings of the VLDB'91. Morgan Kaufmann, 1991, pp. 513–523.Google Scholar
  21. [Sag88]
    Y. Sagiv: “Optimizing Datalog Programs”. In J. Minker (Ed.): Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann, Los Altos, CA, 1988, pp. 659–698.Google Scholar
  22. [ST96]
    M. Staudt, K.v. Thadden: “A Generic Subsumption Testing Toolkit for Knowledge Base Queries”. Proceedings of the DEXA'96. LNCS, Vol. 1134, Springer, 1996, pp. 834–844.Google Scholar
  23. [TO95]
    E. Teniente, A. Olivé: “Updating Knowledge Bases while Maintaining their Consistency”. The VLDB Journal, Vol. 4, No. 2, 1995, 193–241.CrossRefGoogle Scholar
  24. [Ul188]
    J.D. Ullman: Principles of Database an Knowledge-Base Systems, Volume 1. Computer Science Press, Rockville, MD, 1988.Google Scholar
  25. [Ul189]
    J.D. Ullman: Principles of Database an Knowledge-Base Systems, Volume 2: The New Technologies. Computer Science Press, Rockville, MD, 1989.Google Scholar
  26. [ZO93]
    X. Zhang, M.Z. Ozsoyoglu: “On efficient reasoning with implication constraints”. Proc. of the DOOD'93. LNCS 760, Springer, 1993, pp. 236–252.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Carles Farré
    • 1
  • Ernest Teniente
    • 1
  • Toni Urpí
    • 1
  1. 1.Universitat Politècnica de CatalunyaBarcelona

Personalised recommendations