Skip to main content
SpringerLink
Log in

A Theoretical and Experimental Comparison of Algorithms for the Containment of Conjunctive Queries with Negation

  • Conference paper
Database and Expert Systems Applications (DEXA 2011)

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

Included in the following conference series:

  • 1241 Accesses

Abstract

We tackle the containment problem for conjunctive queries with negation, which takes two queries q 1 and q 2 as input and asks if q 1 is contained in q 2. A general approach for solving this problem consists of considering all completions of q 1 (intuitively these completions represent all canonical databases that satisfy q 1) and checking if each completion yields the same answer on q 2. Since the total number of completions of q 1 is exponential in the size of q 1, several proposals have aimed at reducing the number (and the size) of the completions checked. In this paper, we propose a unifying framework for comparing algorithms following this general approach and define two kinds of heuristics for exploring the space of completions. Combining these heuristics with both classical kinds of traversals, i.e., depth-first and breadth-first, we obtain four algorithms that we compare experimentally with respect to running time on difficult instances of the containment problem.

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. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases: The Logical Level. Addison-Wesley, Reading (1995)

    Google Scholar 

  2. Aho, A.V., Sagiv, Y., Ullman, J.D.: Equivalences among relational expressions. SIAM J. Comput. 8(2), 218–246 (1979)

    Article  MATH  Google Scholar 

  3. Mohamed, K.B., Leclére, M., Mugnier, M.-L.: Containment of conjunctive queries with negation: Algorithms and experiments. In: Bringas, P.G., Hameurlain, A., Quirchmayr, G. (eds.) DEXA 2010. LNCS, vol. 6262, pp. 330–345. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  4. Ben Mohamed, K., Leclère, M., Mugnier, M.-L.: Deduction in existential conjunctive first-order logic: an algorithm and experiments. Technical Report RR-10010, LIRMM (March 2010)

    Google Scholar 

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

    Google Scholar 

  6. Chein, M., Mugnier, M.-L.: Graph-based Knowledge Representation and Reasoning—Computational Foundations of Conceptual Graphs. Advanced Information and Knowledge Processing. Springer, Heidelberg (2009)

    MATH  Google Scholar 

  7. Farré, C., Nutt, W., Teniente, E., Urpí, T.: Containment of conjunctive queries over databases with null values. In: Schwentick, T., Suciu, D. (eds.) ICDT 2007. LNCS, vol. 4353, pp. 389–403. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  8. Gent, I.P., Walsh, T.: Beyond np: the qsat phase transition, pp. 648–653. AAAI Press, Menlo Park (1999)

    Google Scholar 

  9. Halevy, A.Y.: Answering queries using views: A survey. VLDB Journal 10(4), 270–294 (2001)

    Article  MATH  Google Scholar 

  10. Leclère, 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 

  11. Levy, A.Y., Sagiv, Y.: Queries independent of updates. In: VLDB 1993: Proceedings of the 19th International Conference on Very Large Data Bases, pp. 171–181. Morgan Kaufmann Publishers Inc., San Francisco (1993)

    Google Scholar 

  12. Mugnier, M.-L., Simonet, G., Thomazo, M.: On the complexity of deduction in existential conjunctive first-order logic (long version). Technical Report RR-09026, LIRMM (September 2009)

    Google Scholar 

  13. Ullman, J.D.: Information Integration Using Logical Views. In: Afrati, F.N., Kolaitis, P.G. (eds.) ICDT 1997. LNCS, vol. 1186, pp. 19–40. Springer, Heidelberg (1996)

    Google Scholar 

  14. 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 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Montpellier II, France

    Khalil Ben Mohamed, Michel Leclère & Marie-Laure Mugnier

Authors
  1. Khalil Ben Mohamed
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michel Leclère
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Marie-Laure Mugnier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut de Recherche en Informatique de Toulouse (IRIT), Paul Sabatier University, 118, route de Narbonne, 31062, Toulouse Cedex, France

    Abdelkader Hameurlain

  2. Brigham Young University, 784 TNRB, 84602, Provo, UT, USA

    Stephen W. Liddle

  3. Software Competence Center Hagenberg and Johannes-Keppler-University Linz, Softwarepark 21, 4232, Hagenberg, Austria

    Klaus-Dieter Schewe

  4. School of Information Technology and Electrical Engineering, University of Queensland, 4072, Brisbane, QLD, Australia

    Xiaofang Zhou

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mohamed, K.B., Leclère, M., Mugnier, ML. (2011). A Theoretical and Experimental Comparison of Algorithms for the Containment of Conjunctive Queries with Negation. In: Hameurlain, A., Liddle, S.W., Schewe, KD., Zhou, X. (eds) Database and Expert Systems Applications. DEXA 2011. Lecture Notes in Computer Science, vol 6860. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23088-2_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23088-2_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23087-5

  • Online ISBN: 978-3-642-23088-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation