Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
A logic programming view of CLP
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Chasing constrained tuple-generating dependencies
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Constraint-generating dependencies
Journal of Computer and System Sciences
Implication and Referential Constraints: A New Formal Reasoning
IEEE Transactions on Knowledge and Data Engineering
Query Optimization in the Presence of Foreign Functions
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
The Theory of Data Dependencies - An Overview
Proceedings of the 11th Colloquium on Automata, Languages and Programming
Optimizing Queries in Extended Relational Databases
DEXA '00 Proceedings of the 11th International Conference on Database and Expert Systems Applications
Database design with equality-generating dependencies
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
Modeling and inferring on role-based access control policies using data dependencies
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
A sound and complete chase procedure for constrained tuple-generating dependencies
Journal of Intelligent Information Systems
Data exchange with arithmetic operations
Proceedings of the 16th International Conference on Extending Database Technology
| Hi-index | 0.00 |
In extencded relational databases, queries and integrity constraints often contain interpreted varibales 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 integrity 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 result 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.