Containment of Conjunctive Queries over Conceptual Schemata

  • Andrea Calì
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3882)


Conceptual Modelling plays a fundamental role in database design since Chen’s Entity-Relationship (ER) model. In this paper we consider a conceptual model capable of capturing classes of objects with their attributes, relationships among classes, cardinality constraints in the participation of entities to relationships, and is-a relations among both classes and relationships. We provide a formal semantics for such model in terms of predicates and constraints over their extensions. We address the problem of containment of conjunctive queries over a conceptual schema, and we show an algorithm for solving the problem, that achieves better computational complexity than the techniques found in the literature. The results presented here are directly applicable in query answering on incomplete databases, and in data integration under constraints.


Conceptual Schema Integrity Constraint Relational Schema Database Schema Cardinality Constraint 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abiteboul, S., Duschka, O.: Complexity of answering queries using materialized views. In: Proc. of PODS 1998, pp. 254–265 (1998)Google Scholar
  2. 2.
    Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison Wesley Publ. Co., Reading (1995)MATHGoogle Scholar
  3. 3.
    Calì, A., Calvanese, D., Giacomo, G.D., Lenzerini, M.: Accessing data integration systems through conceptual schemas. In: Kunii, H.S., Jajodia, S., Sølvberg, A. (eds.) ER 2001. LNCS, vol. 2224, pp. 270–284. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  4. 4.
    Calì, A., Lembo, D., Rosati, R.: On the decidability and complexity of query answering over inconsistent and incomplete databases. In: Proc. of PODS 2003, pp. 260–271 (2003)Google Scholar
  5. 5.
    Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: DL-Lite: Tractable description logics for ontologies. In: Proc. of AAAI 2005, pp. 602–607 (2005)Google Scholar
  6. 6.
    Calvanese, D., De Giacomo, G., Lenzerini, M.: On the decidability of query containment under constraints. In: Proc. of PODS 1998, pp. 149–158 (1998)Google Scholar
  7. 7.
    Chan, E.P.F.: Containment and minimization of positive conjunctive queries in OODB’s. In: Proc. of PODS 1992, pp. 202–211 (1992)Google Scholar
  8. 8.
    Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational data bases. In: Proc. of STOC 1977, pp. 77–90 (1977)Google Scholar
  9. 9.
    Chen, P.P.: The Entity-Relationship model: Toward a unified view of data. ACM Trans. on Database Systems 1(1), 9–36 (1976)CrossRefGoogle Scholar
  10. 10.
    Codd, E.F.: A relational model of data for large shared data banks. Comm. of the ACM 13(6), 377–387 (1970)CrossRefMATHGoogle Scholar
  11. 11.
    Johnson, D.S., Klug, A.C.: Testing containment of conjunctive queries under functional and inclusion dependencies. J. of Computer and System Sciences 28(1), 167–189 (1984)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Kolaitis, P.G., Vardi, M.Y.: Conjunctive-query containment and constraint satisfaction. In: Proc. of PODS 1998, pp. 205–213 (1998)Google Scholar
  13. 13.
    Maier, D., Mendelzon, A.O., Sagiv, Y.: Testing implications of data dependencies. ACM Trans. on Database Systems 4, 455–469 (1979)CrossRefGoogle Scholar
  14. 14.
    Maier, D., Sagiv, Y., Yannakakis, M.: On the complexity of testing implications of functional and join dependencies. J. of the ACM 28(4), 680–695 (1981)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    de la Fuente, M.M.O., Calvanese, D., Eiter, T., Franconi, E.: Data complexity of answering conjunctive queries over SHIQ knowledge bases. Technical report, Free University of Bozen-Bolzano (2005),
  16. 16.
    Vardi, M.: Inferring multivalued dependencies from functional and join dependencies. Acta Informatica 19, 305–324 (1983)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Andrea Calì
    • 1
  1. 1.Faculty of Computer ScienceFree University of Bozen-BolzanoBolzanoItaly

Personalised recommendations