Efficient Execution of Recursive Queries Through Controlled Binding Propagation

This paper presents a new method for the computation of bound linear Datalog queries and compares its performance to that of other bottom-up execution strategies. The technique, called pushdown method, uses virtual stacks to store information on the current state of the evaluation thus ensuring both termination and efficient execution. The asymptotic worst-case behavior and experimental results for the new method compare favorably against those of previous methods.

[1]  Jeffrey F. Naughton,et al.  Argument Reduction by Factoring , 1989, VLDB.

[2]  Jeffrey F. Naughton,et al.  Efficient evaluation of right-, left-, and multi-linear rules , 1989, SIGMOD '89.

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

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

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

[6]  Carlo Zaniolo,et al.  Design and Implementation of a Logic Based Language for Data Intensive Applications , 1988, ICLP/SLP.

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

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

[9]  Bernard Lang,et al.  Datalog Automata , 1988, JCDKB.

[10]  Mihalis Yannakakis,et al.  Graph-theoretic methods in database theory , 1990, PODS.

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

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

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

[14]  Z. Meral Özsoyoglu,et al.  Synchronized counting method , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.

[15]  Domenico Saccà,et al.  Comparison of Methods for Logic-Query Implementation , 1991, J. Log. Program..

[16]  Jeffrey D. Ullman,et al.  Logical Query Optimization by Proff-Tree Transformation , 1993, J. Comput. Syst. Sci..

[17]  Jeffrey F. Naughton,et al.  A Counting Algorithm for a Cyclic Binary Query , 1991, J. Comput. Syst. Sci..