Elsevier

Information Sciences

Volume 64, Issues 1–2, 1 October 1992, Pages 57-81
Information Sciences

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

https://doi.org/10.1016/0020-0255(92)90111-KGet rights and content

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.

References (17)

  • F. Bancilhon

    Naive evaluation of recursively defined relations

  • F. Bancilhon et al.

    An amateur's introduction to recursive query processing strategies

  • J. Cai et al.

    Binding performance at language design time

  • S. Ceri et al.

    Interfacing relational databases and prolog efficiently

  • K. Clark

    Negation as failure

  • Y.E. Ioannidis et al.

    On the computation of the transitive closure of relational operators

  • H.V. Jagadish et al.

    Computing linear recursion as transitive closure

  • R. Krishnamurthy et al.

    Safety and optimization of Horn clause queries

There are more references available in the full text version of this article.

Cited by (0)

This work was supported in part by the Korea Science and Engineering Foundation (KOSEF) under contract 911-1102-008-2.

1

Current Address: Computer Science Department, Korea Advanced Institute of Science and Technology, 373-1 Koo-Sung Dong, Daejeon, Korea.

2

Current Address: College of Computing, Georgia Institute of Technology, Atlanta, Georgia 30332.

View full text