Query Answering under Expressive Entity-Relationship Schemata

Andrea Calì, Georg Gottlob, Andreas Pieris

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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 +  model, comprises is-a constraints among entities and relationships, plus functional and mandatory participation constraints. In particular, it allows 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, called ER± schemata, by means of a necessary and sufficient condition. We present a complete complexity analysis of the conjunctive query answering problem under ER± schemata. 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.
Original languageEnglish
Title of host publicationConceptual Modeling - ER 2010, 29th International Conference on Conceptual Modeling, Vancouver, BC, Canada, November 1-4, 2010. Proceedings
PublisherSpringer Berlin Heidelberg
Pages347-361
Number of pages15
ISBN (Electronic)978-3-642-16373-9
ISBN (Print)978-3-642-16372-2
DOIs
Publication statusPublished - 2010

Publication series

NameLecture Notes in Computer Science (LNCS)
PublisherSpringer Berlin Heidelberg
Volume6412
ISSN (Print)0302-9743

Fingerprint Dive into the research topics of 'Query Answering under Expressive Entity-Relationship Schemata'. Together they form a unique fingerprint.

Cite this