NP-completeness of the set unification and matching problems
Proc. of the 8th international conference on Automated deduction
Decidability and expressiveness aspects of logic queries
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Integrity constraint checking in stratified databases
Journal of Logic Programming
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
A theorem-proving approach to database integrity
Foundations of deductive databases and logic programming
Efficient evaluation of right-, left-, and multi-linear rules
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Logic-based approach to semantic query optimization
ACM Transactions on Database Systems (TODS)
A slick procedure for integrity checking in deductive databases
Proceedings of the eleventh international conference on Logic programming
A new method for integrity constraint checking in deductive databases
Data & Knowledge Engineering
Materialized views: techniques, implementations, and applications
Materialized views: techniques, implementations, and applications
Three types of redundancy in integrity checking: an optimal solution
Data & Knowledge Engineering
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
An Effective Method for Integrity Constraint Simplification
Proceedings of the Fourth International Conference on Data Engineering
Deriving Production Rules for Constraint Maintainance
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Further Improvements on Integrity Constraint Checking for Stratifiable Deductive Databases
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Translating advanced integrity checking technology to SQL
Database integrity
Efficient integrity checking for databases with recursive views
ADBIS'05 Proceedings of the 9th East European conference on Advances in Databases and Information Systems
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 |
Integrity checking is an essential means for the preservation of the intended semantics of a deductive database. Incrementality is the only feasible approach to checking and can be obtained with respect to given update patterns by exploiting query optimization techniques. By reducing the problem to query containment, we show that no procedure exists that always returns the best incremental test (aka simplification of integrity constraints), and this according to any reasonable criterion measuring the checking effort. In spite of this theoretical limitation, we develop an effective procedure allowing general parametric updates that, for given database classes, returns ideal simplifications and also applies to recursive databases. Finally, we point out the improvements with respect to previous methods based on an experimental evaluation.