Logic-based approach to semantic query optimization
ACM Transactions on Database Systems (TODS)
Constraint checking with partial information
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Consistent query answers in inconsistent databases
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Database Management Systems
On Simplification of Database Integrity Constraints
Fundamenta Informaticae
Classifying integrity checking methods with regard to inconsistency tolerance
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
A relaxed approach to integrity and inconsistency in databases
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
| Hi-index | 0.00 |
The premise that all integrity constraints be totally satisfied guarantees the correctness of methods for simplified integrity checking, and of semantic query optimization. This premise can be waived for many integrity checking methods. We study how it can be relaxed also for applying semantic query optimization to an inconsistency-tolerant evaluation of simplified constraints.