Ontological query answering under expressive Entity-Relationship schemata

  • Authors:

  • Andrea Calí;Georg Gottlob;Andreas Pieris

  • Affiliations:

  • Department of Computer Science and Information Systems, Birkbeck University of London, UK and Oxford-Man Institute of Quantitative Finance, University of Oxford, UK;Department of Computer Science, University of Oxford, UK and Oxford-Man Institute of Quantitative Finance, University of Oxford, UK;Department of Computer Science, University of Oxford, UK

  • Venue:
  • Information Systems
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

The Entity-Relationship (ER) model is a fundamental tool for database design, recently extended and employed in knowledge representation and reasoning due to its expressiveness and comprehensibility. We address the problem of answering conjunctive queries under constraints representing schemata expressed in an extended version of the Entity-Relationship model. This extended model, called ER^+, comprises is-a constraints among entities and relationships, plus functional and mandatory participation constraints. In particular, it allows for arbitrary permutations of the roles in is-a among relationships. A key notion that ensures high tractability in ER^+ schemata is separability, i.e., the absence of interaction between the functional participation constraints and the other constructs of ER^+. We provide a precise syntactic characterization of separable ER^+ schemata by means of a necessary and sufficient condition. We present a complete complexity analysis of the conjunctive query answering problem under separable ER^+ schemata, and also under several sublanguages of ER^+. We show that the addition of so-called negative constraints does not increase the complexity of query answering. With such constraints, our model properly generalizes the most widely adopted tractable ontology languages, including those in the DL-Lite family.