Skip to main content
SpringerLink
Log in

On Containment of Conjunctive Queries with Negation

  • Conference paper
Advances in Databases and Information Systems (ADBIS 2009)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5739))

Abstract

We consider the problem of query containment for conjunctive queries with the safe negation property. Some necessary conditions for this problem are given. A part of the necessary conditions use maximal cliques from the graphs associated to the first query. These necessary conditions improve the algorithms for the containment problem. For a class of queries a necessary and sufficient condition for containment problem is specified. Some aspects of time complexity for the conditions are discussed.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Afrati, F., Pavlaki, V.: Rewriting Queries Using Views with Negation. AI Communications 19, 229–237 (2006)

    MathSciNet  MATH  Google Scholar 

  2. Afrati, F., Mielikainen, T.: Advanced Topics in Databases. University of Helsinki (2005)

    Google Scholar 

  3. Akkoyunlu, E.A.: The enumeration of maximal cliques of large graphs. SIAM Journal of Computing 2, 1–6 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The maximum clique problem. In: Handbook of Combinatorial Optimization, vol. 4, pp. 1–74 (1999)

    Google Scholar 

  5. Chandra, A.K., Merlin, P.M.: Optimal implementations of conjunctive queries in relational databases. In: ACM Symp. on Theory of Computing (STOC), pp. 77–90 (1977)

    Google Scholar 

  6. Cohen, S.: Containment of Aggregate Queries. ACM SIGMOD 34(1), 77–85 (2005)

    Article  Google Scholar 

  7. Cohen, S., Nutt, W., Sagiv, Y.: Containment of Aggregate queries, http://www.macs.hw.ac.uk/~nutt/Publications/icdt03.pdf

  8. Deutsch, A., Tannen, V.: XML queries and constraints, containment and reformulation. Theoretical Computer Science 336(1), 57–87 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  9. Dong, X., Halevy, A.Y., Tatarinov, I.: Containment of Nested XML Queries, http://data.cs.washington.edu/papers/nest-vldb.pdf

  10. Farre, C., Teniente, E., Urpi, T.: Checking query containment with CQC method. Data and Knowledge Engineering 53(2), 163–223 (2005)

    Article  Google Scholar 

  11. Felea, V.: A Strong Containment Problem for Queries in Conjunctive Form with Negation. In: Proceedings on The First DBKDA 2009, Cancun, Mexico, March 1-6 (2009), http://profs.info.uaic.ro/~felea/FeleaVictor-DB09.pdf

  12. Florescu, D., Levy, A., Suciu, D.: Query containment for conjunctive queries with regular expressions. In: ACM Symp. on Principles of Database Systems (PODS), pp. 139–148 (1998)

    Google Scholar 

  13. Halevy, A.Y.: Answering Queries Using Views: A survey. VLDB Journal 10(4), 270–294 (2001)

    Article  MATH  Google Scholar 

  14. Huyn, N.: Efficient Complete Local Tests for Conjunctive Query Constraints with Negation, http://dbpubs.stanford.edu/pub/1966-26

  15. Lausen, G., Wei, F.: On the containment of conjunctive queries. In: Klein, R., Six, H.-W., Wegner, L. (eds.) Computer Science in Perspective. LNCS, vol. 2598, pp. 231–244. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  16. Leclere, M., Mugnier, M.L.: Some algorithmic improvements for the containment problem of conjunctive queries with negation. In: Schwentick, T., Suciu, D. (eds.) ICDT 2007. LNCS, vol. 4353, pp. 404–418. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  17. Chen, L.: Testing Query Containment in the Presence of Binding Restrictions, Technical report (1999)

    Google Scholar 

  18. Ludascher, B., Nash, A.: Web service composition through declarative queries: the case of conjunctive queries with union and negation. In: Proc. 20th Intern. Conf. on Data Engineering, pp. 840–860 (2004)

    Google Scholar 

  19. Makino, K., Uno, T.: New algorithms for enumerating all maximal cliques. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 260–272. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  20. Millstein, T., Levy, A., Friedman, M.: Query Containment for Data Integration Systems. In: Proc. of Symp. on Principles of Database Systems, pp. 67–75 (2000)

    Google Scholar 

  21. Tamas, N., Gabor, C.: http://www.cneurocvs.rmki.kfki.hu/igraph/doc/R/cliques.html

  22. Tomita, E., Tanaka, A., Takahashi, H.: The worst-case time complexity for generating all maximal cliques. In: Proc. 10th Int. Computing and Combinatorics Conf. (2004); also in Theoretical Computer Science 363(1), 28–42 (2006)

    Google Scholar 

  23. Ullman, J.D.: Information integration using logical views. In: International Conference on Database Theory (ICDT), pp. 19–40 (1997)

    Google Scholar 

  24. Wei, F., Lausen, G.: Containment of Conjunctive Queries with Safe Negation. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 343–357. Springer, Heidelberg (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, “A.I.Cuza” University of Iasi, 16 General Berthelot Street, Iasi, Romania

    Victor Felea

Authors
  1. Victor Felea
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Applied Computer Systems, Riga Technical University, Kalku iela 1, LV 1658, Riga, Latvia

    Janis Grundspenkis

  2. Institute of Computing Science, University of Technology, Piotrowo 2, 60-965, Pozna´n, Poland

    Tadeusz Morzy

  3. European Research Center for Information Systems, University of Münster, Leonardo Campus 3, 48149, Münster, Germany

    Gottfried Vossen

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Felea, V. (2009). On Containment of Conjunctive Queries with Negation. In: Grundspenkis, J., Morzy, T., Vossen, G. (eds) Advances in Databases and Information Systems. ADBIS 2009. Lecture Notes in Computer Science, vol 5739. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03973-7_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03973-7_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03972-0

  • Online ISBN: 978-3-642-03973-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation