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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.