Querying Conceptual Schemata with Expressive Equality Constraints

  • Andrea Calì
  • Georg Gottlob
  • Andreas Pieris
Conference paper
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

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