Integrity constraint checking in stratified databases
Journal of Logic Programming
A theorem-proving approach to database integrity
Foundations of deductive databases and logic programming
Logic for Problem Solving
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Integrity Checking in Deductive Databases
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Consistent query answering in databases
ACM SIGMOD Record
On Simplification of Database Integrity Constraints
Fundamenta Informaticae
Historical and computational aspects of paraconsistency in view of the logic foundation of databases
Proceedings of the 2nd international conference on Semantics in databases
| Hi-index | 0.00 |
A hitherto unquestioned assumption made by all methods for integrity checking has been that the database satisfies its constraints before each update. This consistency assumption has been exploited for improving the efficiency of determining whether integrity is satisfied or violated after the update. Based on a notion of violation tolerance, we present and discuss an abstract property which, for any given approach to integrity checking, is an easy, sufficient condition to check whether the consistency assumption can be abandoned without sacrificing usability and efficiency of the approach. We demonstrate the usefulness of our definitions by showing that the theorem-proving approach to database integrity by Sadri and Kowalski, as well as several other well-known methods, can indeed afford to abandon the consistency assumption without losing their efficiency, while their applicability is vastly increased.