On the compilation of consistency constraints
Document typeConference report
PublisherUniversitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics
Rights accessOpen Access
We introduce a compilation technique for efficient consistency checking in deductive databases. Whereas most approaches to efficient consistency checking rely on the interpretation of the (simplified) consistency constraints we will discuss a compilation technique. In the presented approach the consistency constraints are translated into an algebra. The basic compilation procedure exhibits two main advantages. lt is able to avoid the division operator in all cases and preserves the advantages of a tuple-at-a-time strategy while allowing for set-oriented processing. The basic compilation technique is then extended to capture the idea of Nicolas where the inserted or deleted facts are used to derive simplified constraints, and to check those for validity. Rather then deriving simplified constraints for each inserted or deleted fact at run time (i.e., when the consistency constraint is checked) the expressions resulting from the translation of the constraints reflect this simplification
CitationMoerkotte, G.; Rosch, K. On the compilation of consistency constraints. A: "Proceedings of the 2nd International Workshop on the Deductive Approach to Information Systems and Databases". Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics, 1991, p. 174-184.