Efficient Database Access from Prolog

In designing the interface between a relational database and a Prolog interpreter, efficiency is a major issue. The authors present a method for loading into the memory-resident database of Prolog facts permanently stored in secondary storage. The rationale of the method is to save access to the database by never repeating the same query and by storing in main memory, in a compact and efficient way, information about the past interaction with the database. The authors discuss how to reduce subsumption rests required by the method to pattern matching in many relevant cases. They also describe a simulator of the method, which validates their approach, and they discuss the results of the simulation. >

[1]  Georg Gottlob,et al.  Subsumption and Implication , 1987, Inf. Process. Lett..

[2]  Georg Gottlob,et al.  Interfacing Relational Databases and Prolog Efficiently , 1986, Expert Database Conf..

[3]  William F. Clocksin,et al.  Programming in Prolog , 1981, Springer Berlin Heidelberg.

[4]  Stefano Ceri,et al.  An overview of PRIMO: a portable interface between PROLOG and relational databases , 1990, Inf. Syst..

[5]  Kotagiri Ramamohanarao,et al.  A Superimposed Codeword Indexing Scheme for Very Large Prolog Databases , 1986, ICLP.

[6]  Alberto O. Mendelzon.  Functional Dependencies in Logic Programs , 1985, VLDB.

[7]  Jeffrey D. Ullman,et al.  Design Overview of the NAIL! System , 1986, ICLP.

[8]  Carlo Zaniolo,et al.  Prolog: A Database Query Language for All Seasons , 1984, Expert Database Workshop.

[9]  Georg Gottlob,et al.  Translation and Optimization of Logic Queries: The Algebraic Approach , 1986, VLDB.

[10]  Edward Sciore,et al.  Towards an Integrated Database-Prolog System , 1984, Expert Database Workshop.

[11]  Jack Minker,et al.  Semantic Query Optimization in Expert Systems and Database Systems , 1984, Expert Database Workshop.

[12]  Gio Wiederhold,et al.  Database Design , 1977 .

[13]  Georg Gottlob,et al.  On the efficiency of subsumption algorithms , 1985, JACM.

[14]  Kotagiri Ramamohanarao,et al.  A two level superimposed coding scheme for partial match retrieval , 1983, Inf. Syst..

[15]  Stefano Ceri,et al.  Distributed Databases: Principles and Systems , 1984 .

[16]  Jack Minker,et al.  Logic and Databases: A Deductive Approach , 1984, CSUR.

[17]  Kamran Parsaye.  A Fault-Tolerant Transaction Processing Environment. , 1983 .

[18]  Peter M. D. Gray,et al.  Interfacing Prolog to a Persistent Data Store , 1986, ICLP.

[19]  Barry E. Jacobs,et al.  A Generalized Query-by-Example Data Manipulation Language Based on Database Logic , 1983, IEEE Transactions on Software Engineering.

[20]  Jeffrey D. Ullman,et al.  Implementation of logical query languages for databases , 1985, TODS.

[21]  Michele Missikoff,et al.  Towards a Unified Approach for Expert and Database Systems , 1984, Expert Database Workshop.

[22]  Gio Wiederhold,et al.  FLASH: a language-independent, portable file access system , 1980, SIGMOD '80.

[23]  Verónica Dahl,et al.  On database systems development through logic , 1982, TODS.

[24]  Matthias Jarke,et al.  On Integrating Logic Programming and Databases , 1984, Expert Database Workshop.