An introduction to deductive database languages and systems

One of the most fundamental uses of a computer is to store and retrieve information, particularly when there are a large amount of data to be stored, or there are complex manipulations that must be performed on them. There has been a large amount of research on the most efficient techniques to store and retrieve data, and the associated problems now have satisfactory solutions. However, the problem of understanding and interpreting this large amount of information remains, particularly when the amounts of data belong to complex domains, such as those involving mineral exploration and financial analysis. To tackle this problem, a mechanism for reasoning about the stored information is necessary. Such a mechanism must be able to cope with large amounts of information, as well as to perform sophisticated inferences, and to draw the appropriate conclusions. A framework in which these problems may be attacked is given by the field of deductive databases. Deductive databases not only store explicit information in the manner of a relational database, but they also store rules that enable inferences based on the stored data to be made. This area is an outgrowth of the field of logic programming, in which mathematical logic is used to directly model computational concepts. Together with techniques developed for relational databases, this basis in logic means that deductive databases are capable of handling large amounts of information as well as performing reasoning based on that information. There are many application areas for deductive database technology. One area is that of decision support systems. In particular, the exploitation of an organization's resources requires fi~tbniy sufficient information about the current and future status of the resources themselves, but also a way of reasoning effectively about plans for the future. The present generation of decision support systems are severely deficient when it comes to reasoning about future plans. Deductive database technology is an appropriate solution to this problem. Another fruitful application area is that of expert systems. There are many computing applications in which there are large amounts of information, from which the important facts may be distilled by a simple yet tedious analysis. For example, medical analysis and monitoring can generate a large amount of data, and an error can have disastrous consequences. A tool to carefully monitor a patient's condition or to retrieve relevant cases during diagnosis reduces the risk of error in such

[1]  Carlo Zaniolo,et al.  The Generalized Counting Method for Recursive Logic Queries , 1986, Theor. Comput. Sci..

[2]  Peter C. Lockemann,et al.  Reactive consistency control in deductive databases , 1991, TODS.

[3]  Raghu Ramakrishnan,et al.  Performance Evaluation of Data Intensive Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..

[4]  Dominique Pastre,et al.  Managing Complex Objects in an Extensible Relational DBMS , 1989, VLDB.

[5]  Gerhard Weikum,et al.  ACM Transactions on Database Systems , 2005 .

[6]  Peter J. Stuckey,et al.  Analysis Based Constraint Query Optimization , 1993, ICLP.

[7]  Jorge B. Bocca,et al.  MegaLog - A platform for developing Knowledge Base Management Systems , 1991, DASFAA.

[8]  John Wylie Lloyd,et al.  Foundations of Logic Programming , 1987, Symbolic Computation.

[9]  Eric Simon,et al.  A production rule based approach to deductive databases , 1988, Proceedings. Fourth International Conference on Data Engineering.

[10]  Laurent Vieille From QSQ towards QoSaQ: Global Optimization of Recursive Queries , 1988, Expert Database Conf..

[11]  David Maier,et al.  Magic sets and other strange ways to implement logic programs (extended abstract) , 1985, PODS '86.

[12]  David Harel,et al.  Horn Clauses Queries and Generalizations , 1985, J. Log. Program..

[13]  Kotagiri Ramamohanarao,et al.  Right-, left- and multi-linear rule transformations that maintain context information , 1990, VLDB.

[14]  Teodor C. Przymusinski On the Declarative Semantics of Deductive Databases and Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..

[15]  Hamid Pirahesh,et al.  Starburst Mid-Flight: As the Dust Clears , 1990, IEEE Trans. Knowl. Data Eng..

[16]  Jeffrey D. Ullman,et al.  A survey of deductive database systems , 1995, J. Log. Program..

[17]  Laurent Vieille,et al.  On Deductive Query Evaluation in the DedGin* System , 1989, DOOD.

[18]  David Scott Warren,et al.  Memoing for logic programs , 1992, CACM.

[19]  Laurent Vieille,et al.  Recursive Axioms in Deductive Databases: The Query/Subquery Approach , 1986, Expert Database Conf..

[20]  J. W. Lloyd,et al.  Foundations of logic programming; (2nd extended ed.) , 1987 .

[21]  Laurent Vieille,et al.  Recursive Query Processing: The Power of Logic , 1989, Theor. Comput. Sci..

[22]  Sten-Åke Tärnlund,et al.  Horn clause computability , 1977, BIT.

[23]  Carlo Zaniolo,et al.  Magic counting methods , 1987, SIGMOD '87.

[24]  Kenneth A. Ross,et al.  The well-founded semantics for general logic programs , 1991, JACM.

[25]  Serge Abiteboul,et al.  A rule-based language with functions and sets , 1991, TODS.

[26]  Hisao Tamaki,et al.  OLD Resolution with Tabulation , 1986, ICLP.

[27]  Burkhard Freitag,et al.  LOLA - A Logic Language for Deductive Databases and its Implementation , 1991, DASFAA.

[28]  Manfred A. Jeusfeld,et al.  Query Optimization in Deductive Object Bases , 1991, Query Processing for Advanced Database Systems, Dagstuhl.

[29]  Jeffrey D. Ullman,et al.  A Survey of Research in Deductive Database Systems , 1995 .

[30]  Adrian Walker,et al.  Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

[31]  Kenneth A. Ross,et al.  Modular stratification and magic sets for Datalog programs with negation , 1994, JACM.

[32]  Kotagiri Ramamohanarao,et al.  Efficient Bottom-UP Computation of Queries on Stratified Databases , 1991, J. Log. Program..

[33]  Michael Freeston,et al.  Advances in the Design of the BANG File , 1989, FODO.

[34]  Shamim A. Naqvi,et al.  A Logical Language for Data and Knowledge Bases , 1989 .

[35]  James Harland,et al.  Constraints for Query Optimization in Deductive Databases , 1992, Future Databases.

[36]  Hamid Pirahesh,et al.  Implementation of magic-sets in a relational database system , 1994, SIGMOD '94.

[37]  Suzanne W. Dietrich,et al.  Extension Tables: Memo Relations in Logic Programming , 1987, SLP.

[38]  Catriel Beeri,et al.  On the power of magic , 1987, J. Log. Program..

[39]  James Harland,et al.  Constraint Propagation for Linear Recursive Rules , 1993, ICLP.

[40]  Yehoshua Sagiv,et al.  Is There Anything Better than Magic? , 1990, NACLP.

[41]  L. Vielle,et al.  Recursive query processing: the power of logic , 1989 .

[42]  Alberto O. Mendelzon,et al.  Hy+: a Hygraph-based query and visualization system , 1993, SIGMOD '93.

[43]  Laurent Vieille,et al.  A Database-Complete Proof Procedure Based on SLD-Resolution , 1987, ICLP.

[44]  Carlo Zaniolo,et al.  Negation and Aggregates in Recursive Rules: the LDL++ Approach , 1993, DOOD.

[45]  Divesh Srivastava,et al.  Query Restricted Bottom-Up Evaluation of Normal Logic Programs , 1992, JICSLP.

[46]  M. W. Forreston Advances in the design of the BANG file , 1989 .

[47]  AbiteboulSerge,et al.  A rule-based language with functions and sets , 1991 .