Multi-way counting method

Abstract Multi-way counting method represents a group of counting algorithms which generalize the counting method to: (1) complex linear recursions; and (2) versatile recursive queries. Since the counting method has been recognized as one of the best performing algorithms in the processing of “simple” recursive queries on “simple” linear recursions, its generalizations to versatile queries on complex linear recursions may have great potential to outperform other algorithms. In this study, the generalization to complex linear recursions is performed by compilation. Many complex linear recursions can be compiled to multi-chain recursions to which counting algorithms are applicable. The generalization to versatile queries is performed by a quad-state variable binding analysis method. Based on the information provided by queries, compiled recursions and EDB statistics, query analysis determines the application of certain counting algorithms in different direction combinations, hence the name, multi-way counting. A comparison of our method with other previously studied processing methods is also discussed in the paper.

[1]  Premkumar T. Devanbu,et al.  Moving selections into linear least fixpoint queries , 1988, Proceedings. Fourth International Conference on Data Engineering.

[2]  Jiawei Han,et al.  Selection of Processing Strategies for Different Recursive Queries , 1988, JCDKB.

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

[4]  Carlo Zaniolo,et al.  Optimization of Nonrecursive Queries , 1986, VLDB.

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

[6]  Jeffrey D. Ullman,et al.  The complexity of ordering subgoals , 1988, PODS.

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

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

[9]  Domenico Saccà,et al.  Worst-case complexity analysis of methods for logic query implementation , 1987, PODS.

[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]  Abraham Silberschatz,et al.  Database System Concepts , 1980 .

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

[15]  J. Naughton,et al.  Counting methods for cyclic relations , 1988, PODS.

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