Advertisement

Querying Conceptual Schemata with Expressive Equality Constraints

  • Andrea Calì
  • Georg Gottlob
  • Andreas Pieris
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6998)

Abstract

When querying data through a conceptual schema or ontology, we compute answers entailed by the logical theory constituted by the data plus the conceptual schema. Traditional database constraints like tuple-generating dependencies (TGDs) and equality-generating dependencies (EGDs) are a useful tool for ontology specification. However, their interaction leads to undecidability of query answering even in simple cases. In this paper we exhibit a novel and general class of EGDs that, together with a relevant class of TGDs, ensures decidability of query answering. Our results capture well-known ontology languages as special cases; in particular, they allow us to deal with extended Entity-Relationship schemata enriched with expressive equality constraints.

Keywords

Description Logic Conceptual Schema Conjunctive Query Query Answering Negative Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)zbMATHGoogle Scholar
  2. 2.
    Calì, A., Calvanese, D., De Giacomo, G., 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
  3. 3.
    Calì, A., Gottlob, G., Kifer, M.: Taming the infinite chase: Query answering under expressive relational constraints. In: Proc. of KR, pp. 70–80 (2008)Google Scholar
  4. 4.
    Calì, A., Gottlob, G., Lukasiewicz, T.: A general datalog-based framework for tractable query answering over ontologies. In: Proc. of PODS, pp. 77–86 (2009)Google Scholar
  5. 5.
    Calì, A., Gottlob, G., Pieris, A.: Tractable query answering over conceptual schemata. In: Laender, A.H.F., Castano, S., Dayal, U., Casati, F., de Oliveira, J.P.M. (eds.) ER 2009. LNCS, vol. 5829, pp. 175–190. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  6. 6.
    Calì, A., Gottlob, G., Pieris, A.: Advanced processing for ontological queries. PVLDB 3(1), 554–565 (2010)Google Scholar
  7. 7.
    Calì, A., Gottlob, G., Pieris, A.: Query answering under expressive entity-relationship schemata. In: Parsons, J., Saeki, M., Shoval, P., Woo, C., Wand, Y. (eds.) ER 2010. LNCS, vol. 6412, pp. 347–361. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  8. 8.
    Calì, A., Gottlob, G., Pieris, A.: Query answering under non-guarded rules in datalog+/-. In: Hitzler, P., Lukasiewicz, T. (eds.) RR 2010. LNCS, vol. 6333, pp. 175–190. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  9. 9.
    Calì, A., Gottlob, G., Pieris, A.: Query rewriting under non-guarded rules. In: Proc. AMW (2010)Google Scholar
  10. 10.
    Calì, A., Lembo, D., Rosati, R.: On the decidability and complexity of query answering over inconsistent and incomplete databases. In: Proc. of PODS, pp. 260–271 (2003)Google Scholar
  11. 11.
    Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in description logics: The DL-lite family. J. Autom. Reasoning 39(3), 385–429 (2007)CrossRefzbMATHGoogle Scholar
  12. 12.
    Calvanese, D., Giacomo, G.D., Lembo, D., Lenzerini, M., Rosati, R.: Path-based identification constraints in description logics. In: Proc. of KR, pp. 231–241 (2008)Google Scholar
  13. 13.
    Chen, P.P.: The entity-relationship model: towards a unified view of data. ACM Trans. Database Syst. 1(1), 124–131 (1976)CrossRefGoogle Scholar
  14. 14.
    Deutsch, A., Nash, A., Remmel, J.B.: The chase revisisted. In: Proc. of PODS, pp. 149–158 (2008)Google Scholar
  15. 15.
    Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: Semantics and query answering. Theor. Comput. Sci. 336(1), 89–124 (2005)CrossRefzbMATHGoogle Scholar
  16. 16.
    Johnson, D.S., Klug, A.C.: Testing containment of conjunctive queries under functional and inclusion dependencies. J. Comput. Syst. Sci. 28(1), 167–189 (1984)CrossRefzbMATHGoogle Scholar
  17. 17.
    Kontchakov, R., Lutz, C., Toman, D., Wolter, F., Zakharyaschev, M.: The combined approach to query answering in DL-lite. In: Proc. of KR (2010)Google Scholar
  18. 18.
    Maier, D., Mendelzon, A.O., Sagiv, Y.: Testing implications of data dependencies. ACM Trans. Database Syst. 4(4), 455–469 (1979)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Andrea Calì
    • 2
    • 3
  • Georg Gottlob
    • 1
    • 3
  • Andreas Pieris
    • 1
  1. 1.Computing LaboratoryUniversity of OxfordUK
  2. 2.Dept. of Computer Science and Inf. SystemsBirkbeck University of LondonUK
  3. 3.Oxford-Man Institute of Quantitative FinanceUniversity of OxfordUK

Personalised recommendations