Improving integrity constraint enforcement by extended rules and dependency graphs

Integrity enforcement (IE) is important in all areas of information processing-DBs, web based systems, e-commerce. Beside checking and enforcing consistency for given data modifications approaches for IE have to cope with termination control, repair mechanisms, effect preservation and efficiency. However, existing approaches handle those problems in many different ways. Often the generation of repairs is too complex, termination of repairs is specified imprecise and effect preservation is insufficient. In this work we propose to extend integrity constraints by termination bounds and to represent the enforcement task by dependency graphs (DG) which allow efficient pre-processing without costly run-time evaluation of constraints. Further, we present an optimization technique by serializing DGs and a history approach for effect preservation. Our main contribution is an uniform framework that considers all relevant criteria for integrity enforcement and shows how termination control, effect preservation and efficiency can be designed to be used within modern database management systems.