Skip to main content
SpringerLink
Log in

Conjunctive Queries with Constraints: Homomorphism, Containment and Rewriting

  • Conference paper
Book cover Foundations of Information and Knowledge Systems (FoIKS 2010)

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

  • 533 Accesses

Abstract

While the complexity of containment of standard conjunctive queries is NP-complete, adding constraints changes the complexity to \(\Pi^P_2\)-complete. This is because in such cases, we need to consider a team of containment mappings to establish containment as opposed to considering a single containment mapping in the standard case. The situation is different when homomorphism property holds, where considering a single mapping is sufficient to establish containment. We identify new classes of conjunctive queries with constraints that satisfy homomorphism property. For each class, we introduce a set of polynomial membership tests. Based on this, we propose an algorithm for rewriting of conjunctive queries with linear arithmetic constraints for which homomorphism property holds.

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., Li, C., Prasenjit, M.: Answering queries using views with arithmetic comparisons. In: Proceedings of the PODS 2002, pp. 209–220 (2002)

    Google Scholar 

  2. Afrati, F.N., Li, C., Mitra, P.: On containment of conjunctive queries with arithmetic comparisons. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., Böhm, K., Ferrari, E. (eds.) EDBT 2004. LNCS, vol. 2992, pp. 459–476. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

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

    Google Scholar 

  4. Gupta, A., Sagiv, Y., Ullman, J.D., Widom, J.: Constraint checking with partial information. In: Proceedings of the PODS 1994, pp. 45–55 (1994)

    Google Scholar 

  5. Ibarra, O.H., Su, J.: A technique for proving decidability of containment and equivalence of linear constraint queries. Journal of Computer and System Sciences 59(1), 1–28 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  6. Kiani, A., Shiri, N.: Containment of conjunctive queries with arithmetic expressions. In: Proceedings of the 13th Int’l Conf. on Cooperative Information Systems (CoopIS), Agia Napa, Cyprus, pp. 439–452. Springer, Heidelberg (2005)

    Google Scholar 

  7. Kiani, A., Shiri, N.: Using patterns for faster and scalable rewriting of conjunctive queries. In: Proceedings of the 3rd Alberto Mendelzon International Workshop on Foundations of Data Management (2009)

    Google Scholar 

  8. Kiani, A., Shiri, N.: Answering queries in heterogenuous information systems. In: Proceedings of the ACM Workshop on Interoperability of Heterogeneous Information Systems, Bremen, Germany, November 4 (2005)

    Google Scholar 

  9. Klug, A.: On conjunctive queries containing inequalities. Journal of the ACM 35(1), 146–160 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  10. Levy, A.Y., Rajaraman, A., Ordille, J.J.: Querying heterogeneous information sources using source descriptions. In: Proceedings of the 22nd VLDB Conf., pp. 251–262 (1996)

    Google Scholar 

  11. Pottinger, R., Levy, A.Y.: A scalable algorithm for answering queries using views. The VLDB Journal, 484–495 (2000)

    Google Scholar 

  12. Ullman Jeffrey, D.: Information integration using logical views. In: Afrati, F.N., Kolaitis, P.G. (eds.) ICDT 1997. LNCS, vol. 1186. Springer, Heidelberg (1996)

    Google Scholar 

  13. van der Meyden, R.: The complexity of querying indefinite data about linearly ordered domains. In: Proceedings of the PODS 1992, San Diego, CA, pp. 331–345 (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science and Software Engineering, Concordia University, Montreal, Quebec, Canada

    Ali Kiani & Nematollaah Shiri

Authors
  1. Ali Kiani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nematollaah Shiri
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Information Management, The Victoria University of Wellington, Wellington, New Zealand

    Sebastian Link

  2. IRIT, University of Toulouse III, 118 route de Narbonne, 31062, Toulouse, Cedex 9, France

    Henri Prade

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kiani, A., Shiri, N. (2010). Conjunctive Queries with Constraints: Homomorphism, Containment and Rewriting. In: Link, S., Prade, H. (eds) Foundations of Information and Knowledge Systems. FoIKS 2010. Lecture Notes in Computer Science, vol 5956. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11829-6_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-11829-6_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-11828-9

  • Online ISBN: 978-3-642-11829-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation