A production rule based approach to deductive databases

Abstract

The authors consider the problem of integrating a powerful production rule language, called RDLI, with a relational DBMS. A rule in RDLI is composed of a condition part which is a relational calculus expression and an action part which is a sequence of updates over a database. The semantics of a RDLI rule is presented according to a binary relation over databases states. Then, they introduce a general compilation technique for transforming producing rules in an execution model, the PCN, based on predicate transition networks (PrTN). The features of this model are its descriptive power and its query optimization support.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>