Integration of expert systems and database management systems--An extended disjunctive normal form approach

Abstract We present a technique for integrating expert systems and database management systems (DBMSs). Such integration is essential to accommodate new expert system applications that require a large volume of factual information that cannot be stored in main memory. We propose the Extended Disjunctive Normal Form (EDNF) as the basis of our approach and discuss how we can achieve performance in the integrated system using this technique. The EDNF is an extension of the disjunctive normal form of relational algebra expressions so as to include recursion. The EDNF is well suited for loose coupling, where an existing DBMS and optimization can be fully exploited. We first present the basic form of the EDNF and then use it as a building block to process a more general class of queries. We extend valid usage of Clark's negation-as-failure evaluation technique to incorporate negation for most practical situations. We also propose new criteria for safety and termination in the presence of negation. To the extent of the authors' knowledge, optimization in the loose coupling of expert systems and DBMSs has not been seriously addressed in previous research. We believe our technique provides significant progress in this direction.

[1]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.

[2]  Georg Gottlob,et al.  Interfacing Relational Databases and Prolog Efficiently , 1986, Expert Database Conf..

[3]  Jeffrey D. Ullman,et al.  Implementation of logical query languages for databases , 1985, TODS.

[4]  Shamkant B. Navathe,et al.  An Extended Disjunctive Normal Form Approach for Optimizing Recursive Logic Queries in Loosely Coupled Environments , 1987, VLDB.

[5]  Clement T. Yu,et al.  Efficient recursive query processing using wavefront methods , 1987, 1987 IEEE Third International Conference on Data Engineering.

[6]  Kyu-Young Whang,et al.  A framework for optimization in expert system-DBMS interface , 1988, Proceedings. Fourth International Conference on Data Engineering.

[7]  Laurent Vieille,et al.  Recursive Axioms in Deductive Databases: The Query/Subquery Approach , 1986, Expert Database Conf..

[8]  Robert Paige,et al.  Supercompilers - Extended Abstract , 1984 .

[9]  A. Tarski A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[10]  Robert Paige,et al.  Finite Differencing of Computable Expressions , 1982, TOPL.

[11]  Yannis E. Ioannidis,et al.  On the Computation of the Transitive Closure of Relational Operators , 1986, VLDB.

[12]  Carlo Zaniolo,et al.  Safety and Optimization of Horn Clause Queries , 1986, XP7.52 Workshop on Database Theory.

[13]  Robert Paige,et al.  Binding performance at language design time , 1987, POPL '87.

[14]  François Bancilhon,et al.  Naive Evaluation of Recursively Defined Relations , 1986, On Knowledge Base Management Systems.