An enhanced inference mechanism for generating relational algebra queries

Authors:
Haruo Yokota;Susumu Kunifuji;Takeo Kakuta;Nobuyoshi Miyazaki;Shigeki Shibayama;Kunio Murakami
Affiliations:
Institute for New Generation Computer Technology (ICOT), Minato-Ku, Tokyo 108 Japan;Institute for New Generation Computer Technology (ICOT), Minato-Ku, Tokyo 108 Japan;Institute for New Generation Computer Technology (ICOT), Minato-Ku, Tokyo 108 Japan;Institute for New Generation Computer Technology (ICOT), Minato-Ku, Tokyo 108 Japan;Institute for New Generation Computer Technology (ICOT), Minato-Ku, Tokyo 108 Japan;Institute for New Generation Computer Technology (ICOT), Minato-Ku, Tokyo 108 Japan
Venue:
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Year:
1984

Citing 2
Cited 5

Universality of data retrieval languages

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A relational data base machine: First step to knowledge base machine

ISCA '83 Proceedings of the 10th annual international symposium on Computer architecture

Traversal recursion: a practical approach to supporting recursive applications

SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
A model and an architecture for a relational knowledge base

ISCA '86 Proceedings of the 13th annual international symposium on Computer architecture
SYGRAF: Implementing Logic Programs in a Database Style

IEEE Transactions on Software Engineering
Prolog-Based Meta-rules for Relational Database Representation and Manipulation

IEEE Transactions on Software Engineering
Coping with complexity in automated reasoning about database systems

VLDB '85 Proceedings of the 11th international conference on Very Large Data Bases - Volume 11

Quantified Score

Hi-index	0.00

Visualization

Abstract

A system for interfacing Prolog programs with relational algebra is presented. The system produces relational algebra queries using a deferred evaluation approach. Least fixed point (LFP) queries are automatically managed. An optimization method for removing redundant relations is also presented.