Skip to main content
SpringerLink
Log in
Book cover

International Andrei Ershov Memorial Conference on Perspectives of System Informatics

PSI 2009: Perspectives of Systems Informatics pp 110–123Cite as

On the Containment Problem for Queries in Conjunctive Form with Negation

  • Conference paper

  • 680 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5947))

Abstract

We consider the problem of query containment for conjunctive queries with safe negation property. A necessary and sufficient condition for two queries to be in containment relation is given. Using this condition a class of queries is emphasized and a characterization of containment problem for this class using certain maximal sets is specified. The time complexity of containment problem for this class of queries is studied.

This is a preview of subscription content, 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

Learn about 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)

    MATH  MathSciNet  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  MATH  MathSciNet  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  MATH  MathSciNet  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. Felea, V.: On the Containment Problem for Queries with Safe Negation. In: Proceedings of the 33 Annual Congress of the American Romanian Academy of Arts and Sciences, Sibiu, June 2-7, vol. II, pp. 201–205 (2009)

    Google Scholar 

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

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

    Article  MATH  Google Scholar 

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

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

  17. 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 (2006)

    Chapter  Google Scholar 

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

    Google Scholar 

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

  20. 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)

    Google Scholar 

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

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

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

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

    Google Scholar 

  25. 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. 346–360. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, “Al.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. (1941-2009), The Weizmann Institute of Science, Rehovot, Israel New York University, NY, USA

    Amir Pnueli

  2. Siberian Division of the Russian Academy of Sciences, A.P. Ershov Institute of Informatics Systems, 6, Acad. Lavrentiev pr., 630090, Novosibirsk, Russia

    Irina Virbitskaite

  3. Department of Computer Science, University of Manchester, Oxford Road, M13 9PL, Manchester, UK

    Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Felea, V. (2010). On the Containment Problem for Queries in Conjunctive Form with Negation. In: Pnueli, A., Virbitskaite, I., Voronkov, A. (eds) Perspectives of Systems Informatics. PSI 2009. Lecture Notes in Computer Science, vol 5947. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11486-1_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-11486-1_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-11485-4

  • Online ISBN: 978-3-642-11486-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation