Advertisement

Rewrite and Conquer: Dealing with Integrity Constraints in Data Integration

  • Andrea CalìEmail author
  • Diego Calvanese
  • Giuseppe De Giacomo
  • Maurizio Lenzerini
Chapter

Abstract

The work “Data Integration under Integrity Constraints”, published at the CAiSE 2002 Conference, proposes a rewriting technique for answering queries in data integration systems, when the global schema contains the classical key and foreign key constraints, and the mapping between the data sources and the global schema is of the global-as-view type. In this addendum, we explain why this research was important and how it gave raise to several results in the following years.

References

  1. 1.
    A. Artale, D. Calvanese, R. Kontchakov, and M. Zakharyaschev. The DL-Lite family and relations. J. of Artificial Intelligence Research, 36:1–69, 2009.MathSciNetzbMATHGoogle Scholar
  2. 2.
    J.-F. Baget, M. Leclère, M.-L. Mugnier, and E. Salvat. On rules with existential variables: Walking the decidability line. Artificial Intelligence, 175(9–10):1620–1654, 2011.MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    A. Calì, D. Calvanese, G. De Giacomo, and M. Lenzerini. Data integration under integrity constraints. In Proc. of CAiSE 2002, volume 2348 of LNCS, pages 262–279. Springer, 2002.Google Scholar
  4. 4.
    A. Calì, G. Gottlob, T. Lukasiewicz, B. Marnette, and A. Pieris. Datalog+/-: A family of logical knowledge representation and query languages for new applications. In Proc. of LICS 2010, pages 228–242, 2010.Google Scholar
  5. 5.
    A. Calì, G. Gottlob, G. Orsi, and A. Pieris. On the interaction of existential rules and equality constraints in ontology querying. In Correct Reasoning, pages 117–133, 2012.Google Scholar
  6. 6.
    A. Calì, G. Gottlob, and A. Pieris. Towards more expressive ontology languages: The query answering problem. Artificial Intelligence, 193:87–128, 2012.MathSciNetCrossRefGoogle Scholar
  7. 7.
    D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, A. Poggi, M. Rodríguez-Muro, and R. Rosati. Ontologies and databases: The DL-Lite approach. In S. Tessaris and E. Franconi, editors, Semantic Technologies for Informations Systems – 5th Int. Reasoning Web Summer School (RW 2009), volume 5689 of LNCS, pages 255–356. Springer, 2009.Google Scholar
  8. 8.
    D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, and R. Rosati. Tractable reasoning and efficient query answering in description logics: The DL-Lite family. J. of Automated Reasoning, 39(3):385–429, 2007.zbMATHCrossRefGoogle Scholar
  9. 9.
    D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, and R. Rosati. Data complexity of query answering in description logics. Artificial Intelligence, 2012. To appear.Google Scholar
  10. 10.
    F. Di Pinto, D. Lembo, M. Lenzerini, R. Mancini, A. Poggi, R. Rosati, M. Ruzzi, and D. F. Savo. Optimizing query rewriting in ontology-based data access. In Proc. of EDBT 2013, 2013.Google Scholar
  11. 11.
    R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Data exchange: Semantics and query answering. In Proc. of ICDT 2003, pages 207–224, 2003.Google Scholar
  12. 12.
    G. Gottlob and T. Schwentick. Rewriting ontological queries into small nonrecursive Datalog programs. In Proc. of KR 2012, pages 254–263, 2012.Google Scholar
  13. 13.
    S. Kikot, R. Kontchakov, V. Podolskii, and M. Zakharyaschev. Long rewritings, short rewritings. In Proc. of DL 2012, volume 846 of CEUR, ceur-ws.org, 2012.Google Scholar
  14. 14.
    S. Kikot, R. Kontchakov, and M. Zakharyaschev. Conjunctive query answering with OWL 2 QL. InProc. of KR 2012, pages 275–285, 2012.Google Scholar
  15. 15.
    R. Kontchakov, C. Lutz, D. Toman, F. Wolter, and M. Zakharyaschev. The combined approach to ontology-based data access. In Proc. of IJCAI 2011, pages 2656–2661, 2011.Google Scholar
  16. 16.
    M. Krötzsch and S. Rudolph. Extending decidable existential rules by joining acyclicity and guardedness. InProc. of IJCAI 2011, pages 963–968, 2011.Google Scholar
  17. 17.
    M. Lenzerini. Data integration: A theoretical perspective. In Proc. of PODS 2002, pages 233–246, 2002.Google Scholar
  18. 18.
    H. Pérez-Urbina, B. Motik, and I. Horrocks. Tractable query answering and rewriting under description logic constraints.J. of Applied Logic, 8(2):186–209, 2010.Google Scholar
  19. 19.
    M. Rodriguez-Muro and D. Calvanese. High performance query answering over DL-Lite ontologies. In Proc. of KR 2012, pages 308–318, 2012.Google Scholar
  20. 20.
    R. Rosati. Query rewriting under extensional constraints in DL-Lite. In Proc. of DL 2012, volume 846 of CEUR, ceur-ws.org, 2012.Google Scholar
  21. 21.
    R. Rosati and A. Almatelli. Improving query answering overDL-Lite ontologies. In Proc. of KR 2010, pages 290–300, 2010.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Andrea Calì
    • 1
    • 2
    Email author
  • Diego Calvanese
    • 3
  • Giuseppe De Giacomo
    • 4
  • Maurizio Lenzerini
    • 4
  1. 1.Birkbeck CollegeUniversity of LondonLondonUK
  2. 2.University of OxfordOxfordUK
  3. 3.Free University of Bozen-BolzanoBolzanoItaly
  4. 4.“Sapienza” Università di RomaRomeItaly

Personalised recommendations