Chain-based evaluation-a bridge linking recursive and nonrecursive query evaluation

Many recursive query analysis techniques are qualitative in nature. This contracts sharply with relational query optimization which relies heavily on quantitative analysis. This paper shows that chain-based evaluation facilitates quantitative analysis of recursive queries based on the available chain information, database statistics and other quantitative measurements. Chain-based evaluation not only facilitates binding propagation, constraint pushing and the selection of recursive query evaluation algorithms but also provides precise compile chain forms in relational expressions. Since most recursions in database applications can be compiled into highly regular chain forms, chain-based evaluation is promising at bridging recursive and nonrecursive database query evaluation.<<ETX>>

[1]  Patricia G. Selinger,et al.  Access path selection in a relational database management system , 1979, SIGMOD '79.

[2]  Jiawei Han,et al.  Constraint-based reasoning in deductive databases , 1991, [1991] Proceedings. Seventh International Conference on Data Engineering.

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

[4]  Catriel Beeri,et al.  Bounds on the propagation of selection into logic programs , 1987, J. Comput. Syst. Sci..

[5]  Jiawei Han,et al.  Asynchronous Chain Recursions , 1989, IEEE Trans. Knowl. Data Eng..

[6]  Jiawei Han,et al.  Multi-way counting method , 1989, Inf. Syst..

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

[8]  Patrick Valduriez,et al.  Extending the Search Strategy in a Query Optimizer , 1991, VLDB.

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

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

[11]  JIAWEI HAN,et al.  Compiling general linear recursions by variable connection graph analysis , 1989, Comput. Intell..

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

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

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

[15]  Eugene Wong,et al.  Query optimization by simulated annealing , 1987, SIGMOD '87.

[16]  Carlo Zaniolo,et al.  Optimization in a Logic Based Language for Knowledge and Data Intensive Applications , 1988, EDBT.

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

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