A Survey of Research in Deductive Database Systems

The area of deductive databases has matured in recent years, and it now seems appropriate to reflect upon what has been achieved and what the future holds. In this paper, we provide an overview of the area and briefly describe a number of projects that have led to implemented systems.

[1]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[2]  Bertram Raphael,et al.  The use of theorem-proving techniques in question-answering systems , 1968, ACM National Conference.

[3]  Jeffrey D. Ullman,et al.  Induction variables in very high level languages , 1976, POPL.

[4]  Sharon Sickel,et al.  A Search Technique for Clause Interconnectivity Graphs , 1976, IEEE Transactions on Computers.

[5]  Robert A. Kowalski,et al.  The Semantics of Predicate Logic as a Programming Language , 1976, JACM.

[6]  Chin-Liang Chang.  DEDUCE 2: Further Investigations of Deduction in Relational Data Bases , 1977, Logic and Data Bases.

[7]  Jacob T. Schwartz,et al.  Reduction in Strength of High Level Operations , 1977, POPL.

[8]  Jeffrey D. Ullman,et al.  Principles Of Database And Knowledge-Base Systems , 1979 .

[9]  Charles Kellogg,et al.  Reasoning with Data in a Deductively Augmented Data Management System , 1979, Advances in Data Base Theory.

[10]  Chin-Liang Chang.  On Evaluation of Queries Containing Derived Relations in a Relational Data Base , 1979, Advances in Data Base Theory.

[11]  Stuart C. Shapiro,et al.  Inference with Recursive Rules , 1980, AAAI.

[12]  Jack Minker,et al.  On recursive axioms in deductive databases , 1983, Inf. Syst..

[13]  David H. D. Warren,et al.  Parsing as Deduction , 1983, ACL.

[14]  Lawrence J. Henschen,et al.  On compiling queries in recursive first-order databases , 1984, JACM.

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

[16]  Shamim A. Naqvi.  Negation in Knowledge Base Management Systems , 1985, On Knowledge Base Management Systems.

[17]  François Bancilhon,et al.  Naive Evaluation of Recursively Defined Relations , 1986, On Knowledge Base Management Systems.

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

[19]  Carlo Zaniolo,et al.  LDL: A Logic-Based Data Language , 1986, VLDB.

[20]  E. L. Lozinskii,et al.  A Framework for an Efficient Implementation of Deductive Databases ∗ , 1986 .

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

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

[23]  Kotagiri Ramamohanarao,et al.  A Generalization of the Differential Approach to Recursive Query Evaluation , 1987, J. Log. Program..

[24]  Yehoshua Sagiv,et al.  Optimizing datalog programs , 1987, Foundations of Deductive Databases and Logic Programming..

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

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

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

[28]  Werner Kießling,et al.  On the Evaluation of Recursion in (Deductive) Database Systems by Efficient Differential Fixpoint Iteration , 1987, ICDE.

[29]  Werner Kießling,et al.  Compiling Exploratory and Goal-Directed Deduction into Sloppy Delta-Iteration , 1987, SLP.

[30]  Jeffrey F. Naughton,et al.  One-sided recursions , 1987, J. Comput. Syst. Sci..

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

[32]  Catriel Beeri,et al.  Sets and negation in a logic data base language (LDL1) , 1987, PODS.

[33]  Yatin P. Saraiya,et al.  YAWN! (Yet Another Window on NAIL!) , 1987, IEEE Data Eng. Bull..

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

[35]  Jeffrey D. Ullman,et al.  Principles of Database and Knowledge-Base Systems, Volume II , 1988, Principles of computer science series.

[36]  V. Lifschitz,et al.  The Stable Model Semantics for Logic Programming , 1988, ICLP/SLP.

[37]  Jeffrey F. Naughton,et al.  Compiling separable recursions , 1988, SIGMOD '88.

[38]  Hendrik Decker,et al.  A Uniform Approach to Constraint Satisfaction and Constraint Satisfiability in Deductive Databases , 1988, EDBT.

[39]  Teodor C. Przymusinski,et al.  Weakly Perfect Model Semantics for Logic Programs , 1988, ICLP/SLP.

[40]  Allen Van Gelder,et al.  Negation as Failure using Tight Derivations for General Logic Programs , 1988, J. Log. Program..

[41]  Eljas Soisalon-Soininen,et al.  An optimization strategy for recursive queries in logic databases , 1988, Proceedings. Fourth International Conference on Data Engineering.

[42]  Jack Minker,et al.  Perspectives in Deductive Databases , 1988, J. Log. Program..

[43]  Christos H. Papadimitriou,et al.  Why not negation by fixpoint? , 1988, PODS '88.

[44]  Catriel Beeri,et al.  Optimizing existential datalog queries , 1988, PODS.

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

[46]  Allen Van Gelder,et al.  The Alternating Fixpoint of Logic Programs with Negation , 1993, J. Comput. Syst. Sci..

[47]  François Bry,et al.  Logic programming as constructivism: a formalization and its application to databases , 1989, PODS.

[48]  Hirohisa Seki,et al.  On the power of Alexander templates , 1989, PODS.

[49]  Jeffrey D. Ullman,et al.  Proof-tree transformation theorems and their applications , 1989, PODS.

[50]  Maurice Nivat,et al.  Resolution of Equations in Algebraic Structures , 1989 .

[51]  Yatin P. Saraiya.  Linearising nonlinear recursions in polynomial time , 1989, PODS.

[52]  Jeffrey D. Ullman,et al.  Bottom-up beats top-down for datalog , 1989, PODS '89.

[53]  Theodore S. Norvell,et al.  Aggregative closure: an extension of transitive closure , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.

[54]  J. Naughton,et al.  Minimizing Expansions of Recursions , 1989 .

[55]  Alan van Gelser.  Negation as failure using tight derivations for general logic programs , 1989 .

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

[57]  Hamid Pirahesh,et al.  Magic is relevant , 1990, SIGMOD '90.

[58]  Carlo Zaniolo,et al.  Stable models and non-determinism in logic programs with negation , 1990, PODS.

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

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

[61]  François Bry,et al.  Query Evaluation in Deductive Databases: Bottom-Up and Top-Down Reconciled , 1990, Data Knowl. Eng..

[62]  K. A. Ross.  Modular stratification and magic sets for DATALOG programs with negation , 1990, PODS 1990.

[63]  Alberto O. Mendelzon,et al.  Low Complexity Aggregation in GraphLog and Datalog , 1990, Theor. Comput. Sci..

[64]  Teodor C. Przymusinski.  Extended Stable Semantics for Normal and Disjunctive Programs , 1990, ICLP.

[65]  Hamid Pirahesh,et al.  Magic conditions , 1990, PODS.

[66]  Letizia Tanca,et al.  Integrating object-oriented data modelling with a rule-based programming paradigm , 1990, SIGMOD '90.

[67]  Eric Simon,et al.  Making deductive databases a practical technology: a step forward , 1990, SIGMOD '90.

[68]  Haim Gaifman,et al.  Semantics of Logic Programs , 1990, ICLP.

[69]  Clement T. Yu,et al.  Necessary and sufficient conditions to linearize doubly recursive programs in logic databases , 1990, TODS.

[70]  Carlo Zaniolo,et al.  The LDL System Prototype , 1990, IEEE Trans. Knowl. Data Eng..

[71]  Sergio Greco,et al.  Minimum and maximum predicates in logic programming , 1991, PODS '91.

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

[73]  Matthias Jarke,et al.  From Relational to Object-Oriented Integrity Simplification , 1991, DOOD.

[74]  Catriel Beeri,et al.  On the power of magic , 1987, PODS '87.

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

[76]  S. Sudarshan,et al.  Aggregation and Relevance in Deductive Databases , 1991, VLDB.

[77]  Eugene Wong,et al.  Towards an algebraic theory of recursion , 1991, JACM.

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

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

[80]  Kenneth A. Ross,et al.  Glue-Nail: a deductive database system , 1991, SIGMOD '91.

[81]  Kotagiri Ramamohanarao,et al.  Design overview of the Aditi deductive database system , 1991, [1991] Proceedings. Seventh International Conference on Data Engineering.

[82]  Kenneth A. Ross,et al.  Modular acyclicity and tail recursion in logic programs , 1991, PODS.

[83]  S. Sudarshan.  Top-Down vs . Bottom-Up Revisited , 1991 .

[84]  Divesh Srivastava,et al.  Magic Sets and Bottom-Up Evaluation of Well-Founded Models , 1991, ISLP.

[85]  Jeffrey F. Naughton,et al.  Space optimization in the bottom-up evaluation of logic programs , 1991, SIGMOD '91.

[86]  Peter J. Stuckey,et al.  Semantics of Logic Programs with Aggregates , 1991, ISLP.

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

[88]  Catriel Beeri,et al.  Set Constructors in a Logic Database Language , 1991, J. Log. Program..

[89]  Maurizio Gabbrielli,et al.  On the Semantics of Logic Programs , 1991, ICALP.

[90]  Shalom Tsur,et al.  Deductive databases in action , 1991, PODS '91.

[91]  Helmut Schmidt.  Meta-Level Control for Deductive Database Systems , 1991, Lecture Notes in Computer Science.

[92]  Raghu Ramakrishnan,et al.  Magic Templates: A Spellbinding Approach To Logic Programs , 1991, J. Log. Program..

[93]  Divesh Srivastava,et al.  Pushing constraint selections , 1992, J. Log. Program..

[94]  Johann Eder,et al.  Logic and Databases , 1992, Advanced Topics in Artificial Intelligence.

[95]  Kenneth A. Ross,et al.  Monotonic aggregation in deductive databases , 1992, J. Comput. Syst. Sci..

[96]  Divesh Srivastava,et al.  The valid model semantics for logic programs , 1992, PODS '92.

[97]  Divesh Srivastava,et al.  Controlling the Search in Bottom-Up Evaluation , 1992, JICSLP.

[98]  Divesh Srivastava,et al.  CORAL - Control, Relations and Logic , 1992, VLDB.

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

[100]  Building a Deductive Database , 1992 .

[101]  Allen Van Gelder,et al.  The well-founded semantics of aggregation , 1992, PODS.

[102]  Werner Kießling,et al.  A complex benchmark for logic programming and deductive databases, or who can beat the N-queens? , 1992, SGMD.

[103]  S. Sudarshan,et al.  Optimizations of Bottom-Up Evaluation with Non-Ground Terms , 1993, ILPS.

[104]  David Scott Warren,et al.  Query evaluation under the well-founded semantics , 1993, PODS.

[105]  Divesh Srivastava,et al.  Coral++: Adding Object-Orientation to a Logic Database Language , 1993, VLDB.

[106]  Divesh Srivastava,et al.  Implementation of the CORAL deductive database system , 1993, SIGMOD Conference.

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

[108]  Shinichi Morishita,et al.  An alternating fixpoint tailored to magic programs , 1993, PODS '93.

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

[110]  Shinichi Morishita,et al.  Design and implementation of the glue-nail database system , 1993, SIGMOD Conference.

[111]  Divesh Srivastava,et al.  Rule Ordering in Bottom-Up Fixpoint Evaluation of Logic Programs , 1990, IEEE Trans. Knowl. Data Eng..

[112]  Jeffrey F. Naughton,et al.  How to forget the past without repeating it , 1990, JACM.

[113]  P. Möller,et al.  The ChronoBase Temporal Deductive Database System , 1995, KDOOD/TDOOD.