Implementation of a Prolog-INGRES interface

Authors:
S. Ghosh;C. C. Lin;T. Sellis
Affiliations:
Department of Computer Science, University of Maryland, College Park, MD;Department of Computer Science, University of Maryland, College Park, MD;Department of Computer Science, University of Maryland, College Park, MD
Venue:
ACM SIGMOD Record
Year:
1988

Citing 0
Cited 2

Loading data into description reasoners

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
The Design, Implementation, and Performance Evaluation of BERMUDA

IEEE Transactions on Knowledge and Data Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

This report describes a working prototype of a Prolog-INGRES interface based on external semantic query simplification. Semantic query simplification employs integrity constraints enforced in a database system for reducing the number of tuple variables and terms in a relational query. This type of query simplifier is useful in providing very high level user interfaces to existing database systems. The system employes a graph theoretic approach to simplify arbitrary conjunctive queries with inequalities. One very interesting feature of the system is to provide meaningful error messages in case of an empty query result resulting from contradiction. In addition to data, rules are stored in the database as well and are retrieved automatically if the Prolog program references them but they are not defined in the Prolog rulebase.