From transitive closure recursions to single-chain recursions

Abstract A single-chain recursion, whose compiled formula is in a single-chain form, is a generalization of the transitive closure recursion. In this paper the compilation of linear recursions to single-chain recursions is studied by the variable connection graph analysis, which characterizes the linear recursions compilable to single-chain recursions and shows that many seemingly complicated linear recursions are single-chain recursions and can be processed by transitive closure strategies. Moreover, we extend the domain of our study to linear recursions with function symbols and show that many such recursions can also be compiled to single-chain recursions and processed similarly by transitive closure strategies.

[1]  Patrick Valduriez,et al.  Evaluation of Recursive Queries Using Join Indices , 1986, Expert Database Conf..

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

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

[4]  Moshe Y. Vardi.  Decidability and undecidability results for boundedness of linear recursive queries , 1988, PODS.

[5]  Umeshwar Dayal,et al.  Traversal recursion: a practical approach to supporting recursive applications , 1986, SIGMOD '86.

[6]  Jeffrey F. Naughton,et al.  A decidable class of bounded recursions , 1987, PODS '87.

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

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

[9]  Jiawei Han,et al.  The Processing and Evaluation of Transitive Closure Queries , 1988, EDBT.

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

[11]  Raghu Ramakrishnan,et al.  Efficient Transitive Closure Algorithms , 1988, VLDB.

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

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

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

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

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

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