Abstract

In [23] we presented a partial evaluation scheme for a "real life" subset of Prolog, containing first-order built-in's, simple side-effects and the operational predicate if-then-else. In this paper we apply this scheme to specialise integrity checking in deductive databases. We present an interpreter which can be used to check the integrity constraints in hierarchical deductive databases. This interpreter incorporates the knowledge that the integrity constraints were not violated prior to a given update sad uses a technique to lift the ground representation to t,e non-ground one for resolution. By partially evaluating this mots-interpreter for certain transaction patterns we are able to obtain very efficient specialised update procedures, executing substantially faster than the original mots-interpreter. The partial eval- uation scheme presented in [23] seems to be capable of tomatically generating highly specialised update procedures for deductive databases.

Citations