Tractable Query Answering over Conceptual Schemata

  • Authors:

  • Andrea Calì;Georg Gottlob;Andreas Pieris

  • Affiliations:

  • Oxford-Man Institute of Quantitative Finance, University of Oxford, and Computing Laboratory, University of Oxford,;Computing Laboratory, University of Oxford, and Oxford-Man Institute of Quantitative Finance, University of Oxford,;Computing Laboratory, University of Oxford,

  • Venue:
  • ER '09 Proceedings of the 28th International Conference on Conceptual Modeling
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We address the problem of answering conjunctive queries over extended Entity-Relationship schemata, which we call EER (Extended ER) schemata, with is-a among entities and relationships, and cardinality constraints. This is a common setting in conceptual data modelling, where reasoning over incomplete data with respect to a knowledge base is required. We adopt a semantics for EER schemata based on their relational representation. We identify a wide class of EER schemata for which query answering is tractable in data complexity; the crucial condition for tractability is the separability between maximum-cardinality constraints (represented as key constraints in relational form) and the other constraints. We provide, by means of a graph-based representation, a syntactic condition for separability: we show that our conditions is not only sufficient, but also necessary, thus precisely identifying the class of separable schemata. We present an algorithm, based on query rewriting, that is capable of dealing with such EER schemata, while achieving tractability. We show that further negative constraints can be added to the EER formalism, while still keeping query answering tractable. We show that our formalism is general enough to properly generalise the most widely adopted knowledge representation languages.