J.F. Naughton, R. Ramakrishnan, Y. Sagiv, and J.D. Ullman, "Efficient evaluation of right-, left-, and multi-linear rules," in proceedings of The ACM SIGMOD International Conference on Management of Data, Portland, Oregon, May, 1989, ACM, New York, pp. 235-242 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Decomposition of Magic Rewriting - Ke Wang Department (Correct)
....the answer to the original query is obtained by a few joins, selections, and projections, in terms of the partial answers computed by these subprograms. This work attacks a number of important open problems in the current research. The work on left linear, right linear, and mixed linear rules in [12] made a good observation that led to algorithms outperforming the standard magic rewriting, but the approach is limited. The idea is to separate the bound arguments from the free arguments and to project out argument positions that are preserved by recursive rules. In right linear rules the query ....
....many cases, such as other binding patterns, that method is not applicable. Another related limitation is the one adornment assumption made in that approach, that is, recursive rules must preserve adornments of the recursive predicate. The factoring technique in [13] generalizes somehow the work in [12], such as allowing nonlinear recursive rules, but still suffers from the above limitations. Since the factorability is undecidable, the only case in which that technique was shown to be applicable is essentially the right linear and left linear rules considered in [12] However, the work in [13] ....
[Article contains additional citation context not shown here]
J.F. Naughton, R. Ramakrishnan, Y. Sagiv, and J.D. Ullman, "Efficient evaluation of right-, left-, and multi-linear rules," in proceedings of The ACM SIGMOD International Conference on Management of Data, Portland, Oregon, May, 1989, ACM, New York, pp. 235-242
Pushing Semantics inside Recursion: A General Framework.. - Lakshmanan, Missaoui (1995) (3 citations) (Correct)
....for a detailed survey of works on relational as well as deductive databases. Deductive databases have been recognized as an important data model for forming the platform for next generation applications. The optimization of recursive queries is a very important problem for deductive databases (see [1, 2, 12] for surveys) Chakravarthy et al. [3] laid down the foundations for semantic query optimization in non recursive deductive databases. They proposed the approach of compiling queries w.r.t. the integrity constraints (ICs) and extracting residues which are to be imposed on the queries so as to ....
J. F. Naughton, R. Ramakrishnan, Y. Sagiv, and J.D. Ullman, "Efficient evaluation of right-, left-, and multi-linear rules," ACM SIGMOD International Conference on Management of Data, 1989, 235-242.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC