Classification and Compilation of Linear Recursive Queries in Deductive Databases

The authors present a graph model which is powerful in classifying and compiling linear recursive formulas in deductive databases. The graph model consists of two kinds of graphs: I-graph and resolution graph. Essential properties of a recursive formula can be extracted from its I-graph, and the compiled formula and the query evaluation plan of the recursive formulas can be determined from its resolution graph. It is demonstrated that based on the graph model all the linear recursive formulas can be classified into a taxonomy of classes and each class shares common characteristics in query compilation and query processing. The compiled formulas and the corresponding query evaluation plans can be derived based on the study of the compilation of each class. >

[1]  Jeffrey D. Uuman.  Principles of database and knowledge- base systems , 1989 .

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

[3]  H. V. Jagadish,et al.  A study of transitive closure as a recursion mechanism , 1987, SIGMOD '87.

[4]  Jiawei Han.  Pattern-based and knowledge-directed query compilation for recursive data bases (expert, systems, reductive, logic) , 1985 .

[5]  Lawrence J. Henschen,et al.  Handling redundancy in the processing of recursive database queries , 1987, SIGMOD '87.

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

[7]  Ashok K. Chandra.  Programming primitives for database languages , 1981, POPL '81.

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

[9]  Lawrence J. Henschen,et al.  Classification of recursive formulas in deductive databases , 1988, SIGMOD '88.

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

[11]  Oded Shmueli,et al.  Decidability and expressiveness aspects of logic queries , 1987, XP7.52 Workshop on Database Theory.

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

[13]  Jack Minker,et al.  Search strategy and selection function for an inferential relational system , 1978, TODS.

[14]  Clement T. Yu,et al.  Linearization of Nonlinear Recursive Rules , 1989, IEEE Trans. Software Eng..

[15]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

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

[17]  David Maier,et al.  The Theory of Relational Databases , 1983 .

[18]  Jack Minker.  Foundations of deductive databases and logic programming , 1988 .

[19]  Jeffrey F. Naughton,et al.  Minimizing function-free recursive inference rules , 1989, JACM.

[20]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[21]  Jeffrey F. Naughton,et al.  Data independent recursion in deductive databases , 1985, J. Comput. Syst. Sci..

[22]  Michael J. Maher,et al.  Foundations of Deductive Databases and Logic Programming , 1988 .