Skip to main content
SpringerLink
Log in

Query containment checking as a view updating problem

  • Conference paper
  • First Online:
Database and Expert Systems Applications (DEXA 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1460))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.

    Article  Google Scholar 

  2. N.R. Brisaboa, H.J. Hernandez: “Testing Bag-Containment of Conjunctive Queries”. Acta Informatica, Vol. 34, No.7, 1997, pp. 557–578.

    Article  MATH  MathSciNet  Google Scholar 

  3. 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. 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.

    Article  Google Scholar 

  5. 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. C. Chekuri, A. Rajaraman: “Conjunctive Query Containment Revisited”. Proceedings of ICDT'97. LNCS, Vol. 1186, Springer, 1997, pp. 56–70.

    Google Scholar 

  7. 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. 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. S. Chaudhuri, M. Vardi: “Optimizing real conjunctive queries”. Proceedings of the PoDS'93. ACM Press, 1993, pp. 59–70.

    Google Scholar 

  10. G. Dong, J. Su: “Conjunctive QC with respect to views and constraints”. Information Processing Letters, No. 57, pp. 95–102, 1996.

    Article  MathSciNet  Google Scholar 

  11. 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. D.S. Johnson, A. Klug: “Optimizing conjunctive queries that contain untyped variables”. SIAM Journal on Conputing, Vol. 12, No. 4, pp. 616–640, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  13. A. Klug: “On Conjunctive Queries Containing Inequalities”. Journal of the ACM, Vol. 35, No. 1, 1988, pp. 146–160.

    Article  MATH  MathSciNet  Google Scholar 

  14. J.W. Lloyd: Foundations of Logic Programming. Springer, 1987.

    Google Scholar 

  15. 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. A. Levy, Y. Sagiv: “Queries Independent of Updates”. Proceedings of the VLDB'93. Morgan Kaufmann, 1993, pp. 171–181.

    Google Scholar 

  17. A. Levy, Y. Sagiv: “Semantic Query Optimization in Datalog Programs”. Proceedings of the PoDS'95. ACM Press, 1995, pp. 163–173.

    Google Scholar 

  18. A. Levy, D. Suciu: “Deciding Containment for Queries with Complex Objects”. Proceedings of the PoDS'97. ACM Press, 1995, pp. 20–31

    Google Scholar 

  19. J.W. Lloyd, R.W. Topor: “Making Prolog More Expressive”. Journal of Logic Programming, 1984, No. 3, pp. 225–240.

    Article  MathSciNet  Google Scholar 

  20. A. Olivé: “Integrity Checking in Deductive Databases”. Proceedings of the VLDB'91. Morgan Kaufmann, 1991, pp. 513–523.

    Google Scholar 

  21. 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. 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. E. Teniente, A. Olivé: “Updating Knowledge Bases while Maintaining their Consistency”. The VLDB Journal, Vol. 4, No. 2, 1995, 193–241.

    Article  Google Scholar 

  24. J.D. Ullman: Principles of Database an Knowledge-Base Systems, Volume 1. Computer Science Press, Rockville, MD, 1988.

    Google Scholar 

  25. J.D. Ullman: Principles of Database an Knowledge-Base Systems, Volume 2: The New Technologies. Computer Science Press, Rockville, MD, 1989.

    Google Scholar 

  26. 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 

Download references

Author information

Authors and Affiliations

  1. Universitat Politècnica de Catalunya, E-08034, Barcelona, Catalonia

    Carles Farré, Ernest Teniente & Toni Urpí

Authors
  1. Carles Farré
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ernest Teniente
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Toni Urpí
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gerald Quirchmayr Erich Schweighofer Trevor J.M. Bench-Capon

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Farré, C., Teniente, E., Urpí, T. (1998). Query containment checking as a view updating problem. In: Quirchmayr, G., Schweighofer, E., Bench-Capon, T.J. (eds) Database and Expert Systems Applications. DEXA 1998. Lecture Notes in Computer Science, vol 1460. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054492

Download citation

  • DOI: https://doi.org/10.1007/BFb0054492

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64950-2

  • Online ISBN: 978-3-540-68060-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation