The Level-Cycle Merging Method
暂无分享,去创建一个
[1] J. Naughton,et al. Counting methods for cyclic relations , 1988, PODS.
[2] Lawrence J. Henschen,et al. Handling redundancy in the processing of recursive database queries , 1987, SIGMOD '87.
[3] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..
[4] David Maier,et al. Magic sets and other strange ways to implement logic programs (extended abstract) , 1985, PODS '86.
[5] Carlo Zaniolo,et al. Magic counting methods , 1987, SIGMOD '87.
[6] Domenico Saccà,et al. Worst-case complexity analysis of methods for logic query implementation , 1987, PODS.
[7] Lawrence J. Henschen,et al. On compiling queries in recursive first-order databases , 1984, JACM.
[8] Gösta Grahne,et al. Efficient evaluation for a subset of recursive queries , 1987, PODS.
[9] Lawrence J. Henschen,et al. Answering Linear Recursive Queries in Cyclic Databases , 1988, FGCS.
[10] Jiawei Han,et al. Multi-way counting method , 1989, Inf. Syst..
[11] Carlo Zaniolo,et al. The Generalized Counting Method for Recursive Logic Queries , 1986, Theor. Comput. Sci..
[12] Z. Meral Özsoyoglu,et al. Synchronized counting method , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.
[13] Catriel Beeri,et al. On the power of magic , 1987, J. Log. Program..
[14] Ling Liu,et al. Processing Multiple Linear Recursions , 1989, NACLP.