PROLOG-BASED META-RULES FOR RELATIONAL DATABASE REPRESENTATION AND MANIPULATION

doi:10.1109/32.83913

PROLOG-BASED META-RULES FOR RELATIONAL DATABASE REPRESENTATION AND MANIPULATION

1991-01-01

12

PRE

AI

DOI：10.1109/32.83913

原文求助

摘要

En 中文

So far, it has been characteristic of Prolog-based representations of relational databases that only the instance level is represented explicitly, whereas the schema (or meta) level is implicitly in the mind of the user. This approach has several serious disadvantages. In this paper we develop a Prolog-based experimental system for relational databases. In this system all manipulation is based on such a knowledge representation which binds the instance and schema levels together in a natural, precise, and systematic way. We show that this kind of knowledge representation affords the possibility of defining the essential concepts associated with structures and operations of relational databases generally, i.e., without binding the definition to any sample database which is the usual situation in the approaches based on representing only the instance level explicitly. Because of general definitions in our experimental system, it can be connected flexibly to other rule-based systems. We show that our experimental system can also be used flexibly to define various constraints related to the structures and operations of relational databases. These constraints may concern both the schema and instance levels. Complex structural relationships among data have a central role in database applications. Therefore we need strong general means and principles for structuring knowledge in Prolog. In this paper we propose the use of the structural primitives: tuples, maps, and sets with their primitive operations to manage complex structural modeling in a Prolog environment. Analogously to the abstract data-type mechanism, we can combine these structural primitives with each other. This approach affords also the possibility of defining a set of general primitive operations for each structural primitive. In general, such primitive operations are called meta-rules, and they play a central role in the definition of our experimental system. The framework of this paper is based only on the theoretical foundations of the relational model. This starting point affords the possibility of utilizing the framework both in the context of different approaches to integrate a relational database system with a deductive system, and in the context of different relational database topics such as relational database design, relational database restructuring, relational query languages, etc.

Keyword:

LOGIC PROGRAMMING METHODOLOGY

PROLOG

LOGIC GRAMMARS

META-RULES

KNOWLEDGE REPRESENTATION

RELATIONAL DATABASES

QUERY EXECUTION

PROLOG-BASED META-RULES FOR RELATIONAL DATABASE REPRESENTATION AND MANIPULATION

摘要

AI总结

期刊

机构

引用论文