On Separability of Ontological Constraints

When data schemata are enriched with expressive constraints that aim at representing the domain of interest, in order to answer queries one needs to consider the logical theory consisting of both the data and the constraints. Query answering in such a context is called ontological query answering. Commonly adopted database constraints in this field are Tuple-Generating Dependencies (TGDs) and Equality-Generating Dependencies (EGDs). It is well known that their interaction leads to intractability or undecidability of query answering even in the case of simple subclasses.

Resource Details

Provided by:
RWTH Aachen University
Data Management