Reasoning with Disjunctive Constrained Tuple-Generating Dependencies
MetadataShow full item record
In extended relational databases, queries and integrity constraints often contain interpreted variables and built-in relations. We extend previous work on semantic query containment for extended relational databases to handle disjunctive constrained tuple-generating dependencies (DCTGDs) which include almost all well-known classes of intergrity constraints. After defining this extended class of integrity constraints, we present a method for expanding a query Q, using DCTGDs, to a semantically equivalent set of queries. Our theorems on this method unify and generalize several previous results on semantic query containment. We apply the method to the DCTGD implication problem and prove that, when restricted to regular CTGDs, our method is strictly more powerful than previously published chase algorithms.
Database and Expert System Applications
© 2001 Springer. This is the author-manuscript version of this paper. It is reproduced here in accordance with the copyright policy of the publisher. Please refer to the publisher’s website for further information.