Querying Conceptual Schemata with Expressive Equality Constraints

Andrea Calì, Georg Gottlob, Andreas Pieris

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

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.
Original languageEnglish
Title of host publicationConceptual Modeling - ER 2011, 30th International Conference, ER 2011, Brussels, Belgium, October 31 - November 3, 2011. Proceedings
PublisherSpringer Berlin Heidelberg
Pages161-174
Number of pages14
ISBN (Electronic)978-3-642-24606-7
ISBN (Print)978-3-642-24605-0
DOIs
Publication statusPublished - 2011

Publication series

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

Fingerprint Dive into the research topics of 'Querying Conceptual Schemata with Expressive Equality Constraints'. Together they form a unique fingerprint.

Cite this