Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
Deriving production rules for constraint maintenance
Proceedings of the sixteenth international conference on Very large databases
Reactive consistency control in deductive databases
ACM Transactions on Database Systems (TODS)
Directed hypergraphs and applications
Discrete Applied Mathematics - Special issue: combinatorial structures and algorithms
Automatic generation of production rules for integrity maintenance
ACM Transactions on Database Systems (TODS)
Modularization techniques for active rules design
ACM Transactions on Database Systems (TODS)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Run-time Detection of Non-Terminating Active Rule Systems
DOOD '95 Proceedings of the Fourth International Conference on Deductive and Object-Oriented Databases
A Survey of Current Methods for Integrity Constraint Maintenance and View Updating
ER '99 Proceedings of the Workshops on Evolution and Change in Data Management, Reverse Engineering in Information Systems, and the World Wide Web and Conceptual Modeling
Addressing Efficiency Issues During the Process of Integrity Maintenance
DEXA '99 Proceedings of the 10th International Conference on Database and Expert Systems Applications
The VLDB Journal — The International Journal on Very Large Data Bases
Consistency preserving updates in deductive databases
Data & Knowledge Engineering
Resolution of joint maintenance/production scheduling by sequential and integrated strategies
IWANN '03 Proceedings of the 7th International Work-Conference on Artificial and Natural Neural Networks: Part II: Artificial Neural Nets Problem Solving Methods
| Hi-index | 0.00 |
We present a technique for analyzing the run time behavior of integrity constraints repair actions, i.e., active database rules specifically designed to correct violations of database integrity. When constraints become violated due to an incorrect user transaction, rule computation is started to restore the database to a correct state. Since repair actions may be numerous and may conflict with each other, an automated support to the analysis of their run-time behavior is necessary. The proposed technique helps the rule base administrator define a repair rule selection strategy such that the computation terminates for every input transaction, the final database state satisfies all the constraints, and the user's preferences among different ways to restore integrity are taken into account. In addition, it can be used by the rule designer to spot "dangerous" rules that may be subject to redesign. This problem is formulated as an optimization problem on directed hypergraphs, which we demonstrate to be NP-hard and solve by means of a heuristic algorithm.