Ordering and Selecting Production Rules for Constraint Maintenance: Complexity and Heuristic Solution
Issue No. 01 - January-February (1997 vol. 9)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.567060
<p><b>Abstract</b>—We present a technique for analyzing the run time behavior of <it>integrity constraints repair actions</it>, 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.</p>
Integrity constraints, active databases, production rules, algorithm complexity, hypergraph algorithms.
P. Fraternali and S. Paraboschi, "Ordering and Selecting Production Rules for Constraint Maintenance: Complexity and Heuristic Solution," in IEEE Transactions on Knowledge & Data Engineering, vol. 9, no. , pp. 173-178, 1997.