论文信息 - Minimizing Expansions of Recursions - 字舞流文

Minimizing Expansions of Recursions

J. Naughton | Y. Sagiv

[1] Ashok K. Chandra,et al. Optimal implementation of conjunctive queries in relational data bases , 1977, STOC '77.

[2] Alfred V. Aho,et al. Equivalences Among Relational Expressions , 1979, SIAM J. Comput..

[3] Mihalis Yannakakis,et al. Equivalences Among Relational Expressions with the Union and Difference Operators , 1980, J. ACM.

[4] Jack Minker,et al. On recursive axioms in deductive databases , 1983, Inf. Syst..

[5] Stavros S. Cosmadakis,et al. Parallel evaluation of recursive rule queries , 1985, PODS '86.

[6] Jeffrey F. Naughton,et al. Data independent recursion in deductive databases , 1985, J. Comput. Syst. Sci..

[7] Yehoshua Sagiv. On computing restricted projections of representative instances , 1985, PODS '85.

[8] R. Ramakrishnan,et al. An amateur's introduction to recursive query processing strategies , 1986, SIGMOD '86.

[9] Yehoshua Sagiv,et al. Optimizing datalog programs , 1987, Foundations of Deductive Databases and Logic Programming..

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

[11] Jeffrey F. Naughton,et al. Minimizing function-free recursive inference rules , 1989, JACM.