Skip to main content
SpringerLink
Log in

The Constructive Method for Query Containment Checking

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

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

Included in the following conference series:

Abstract

We present a new method that checks Query Containment for queries with negated derived atoms and/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. Our method can be seen as an extension of the canonical databases approach beyond the class of conjunctive queries.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abiteboul, R. Hull, V. Vianu: Foundations of Databases. Addison-Wesley, 1995.

    Google Scholar 

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

    Article  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. L. Cavedon, J. Lloyd: “A Completeness Theorem for SLDNF Resolution”, Journal of Logic Programming, vol. 7, 1989, pp. 177–191.

    Article  MathSciNet  MATH  Google Scholar 

  5. S. Chaudhuri, M. Vardi: “Optimizing real conjunctive queries”. Proceedings of the PoDS’93. ACM Press, 1993, pp. 59–70.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  7. C. Farré, E. Teniente, T. Urpí: “Query Containment as a View Updating Problem”. Proceedings of the DEXA’98. Springer, 1998, pp. 310–321.

    Google Scholar 

  8. C. Farré, E. Teniente, T. Urpí: The Constructive Method for Query Containment Checking (extended version). Research Report LSI-99-23-R, Universitat Politècnica de Catalunya, 1999.

    Google Scholar 

  9. O.H. Ibarra, J. Su: “On the Containment and Equivalence of Database Queries with Linear Constraints”. Proceedings of the PoDS’97. 1997, pp. 32–43

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  11. A. Levy, I.S. Mumick, Y. Sagiv, O. Shmueli: “Equivalence, query-reachability and satisfiability in Datalog extensions”. PoDS’93. pp. 109–122.

    Google Scholar 

  12. A. Levy, Y. Sagiv: “Queries Independent of Updates”. Proceedings of the VLDB’93. Morgan Kaufmann, 1993, pp. 171–181.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  16. Y. Sagiv: “Optimizing Datalog Programs”. J. Minker (Ed.): Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann, 1988, pp. 659–698.

    Google Scholar 

  17. O. Shmueli: “Decidability and expressiveness aspects of logic queries”. Proceedings of the PoDS’87, 1987, pp. 237–249.

    Google Scholar 

  18. M. Staudt, K.v. Thadden: “A Generic Subsumption Testing Toolkit for Knowledge Base Queries”. Proc. of DEXA’96., Springer, 1996, pp. 834–844.

    Google Scholar 

  19. E. Teniente, A. Olivé: “Updating Knowledge Bases while Maintaining their Consistency”. The VLDB Journal, Vol. 4, No. 2, 1995, pp. 193–241.

    Article  Google Scholar 

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

    Google Scholar 

  21. J.D. Ullman: Principles of Databases. Lecture notes of the course. http://wwwdb. stanford.edu/~ullman/cs345-notes.html

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

Editors and Affiliations

  1. Department of Computer Science, University of Liverpool, P.O. Box 147, Liverpool, L49 3BX, UK

    Trevor J.M. Bench-Capon

  2. Department of Systems and Computers, University of Florence, Via S. Marta, 3, I-50139, Florence, Italy

    Giovanni Soda

  3. IFS, Technical University of Vienna, Resselgasse 3, A-1040, Vienna, Austria

    A Min Tjoa

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Farré, C., Teniente, E., Urpí, T. (1999). The Constructive Method for Query Containment Checking. In: Bench-Capon, T.J., Soda, G., Tjoa, A.M. (eds) Database and Expert Systems Applications. DEXA 1999. Lecture Notes in Computer Science, vol 1677. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48309-8_54

Download citation

  • DOI: https://doi.org/10.1007/3-540-48309-8_54

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48309-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation