C. L. Monma and J. Sidney. Sequencing with seriesparallel precedence constraints. Mathematics of Operations Research, 1979. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Optimizing Disjunctive Queries with Expensive Predicates - Kemper, Moerkotte.. (1994) (21 citations) (Correct)
....and object oriented systems in the form of user defined functions. HS93] s work is based on ordering the conditions in a sequence according to their relative selectivity and evaluation cost 1 . This approach yields the optimal evaluation sequence for (purely) conjunctive selection predicates [MS79] An obvious extension towards predicates containing disjunctions is to convert the entire selection predicate into conjunctive normal form (CNF) and apply the sorting on the resulting Boolean factors [SAC 79] Furthermore, the disjuncts within one Boolean factor could be ordered according to ....
C. Monma and J. Sidney. Sequencing with seriesparallel precedence constraints. Math. Oper. Res., 4:215--224, 1979.
Predicate Migration: Optimizing Queries with Expensive.. - Hellerstein, Stonebraker (1993) (80 citations) (Correct)
....simply ordering a stream by ascending rank, since a predicate p 1 may be constrained to precede a predicate p 2 , even though rank(p 1 ) rank(p 2 ) In such situations, we will need to find the optimal ordering of predicates in the stream subject to the precedence constraints. Monma and Sidney [MS79] have shown that finding the optimal ordering under a large class of precedence constraints can be done fairly simply. Their analysis is based on two key results: 1. A stream can be broken down into modules, where a module is defined as a set of nodes that have the same constraint relationship ....
....we include the pushdown step in the algorithm, although it would be unnecessary in most RDBMS implementations. Predicate Migration Algorithm: To optimize a plan tree, we push all predicates down as far as possible, and then repeatedly apply the Series Parallel Algorithm Using Parallel Chains [MS79] to each stream in the tree, until no more progress can be made. Upon termination, the Predicate Migration Algorithm produces a tree in which each stream is well ordered (i.e. optimally ordered subject to the precedence constraints) We proceed to prove that the Predicate Migration Algorithm is ....
[Article contains additional citation context not shown here]
C. L. Monma and J.B. Sidney. Sequencing with SeriesParallel Precedence Constraints. Mathematics of Operations Research, 4:215--224, 1979.
The Design of an Acquisitional Query Processor for.. - Madden, Franklin.. (2002) (52 citations) (Correct)
No context found.
C. L. Monma and J. Sidney. Sequencing with seriesparallel precedence constraints. Mathematics of Operations Research, 1979.
On the Complexity of Generating Optimal Plans with Cross.. - Scheufele, Moerkotte (1997) (10 citations) (Correct)
No context found.
C. Monma and J. Sidney. Sequencing with seriesparallel precedence constraints. Math. Oper. Res., 4:215--224, 1979.
The Design of an Acquisitional Query Processor for.. - Madden, Franklin.. (2003) (52 citations) (Correct)
No context found.
C. L. Monma and J. Sidney. Sequencing with seriesparallel precedence constraints. Mathematics of Operations Research, 1979.
The Design of an Acquisitional Query Processor for.. - Madden, Franklin.. (2002) (52 citations) (Correct)
No context found.
C. L. Monma and J. Sidney. Sequencing with seriesparallel precedence constraints. Mathematics of Operations Research, 1979.
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