Date Added: Oct 2011
Most contemporary database systems query optimizers exploit System-R's bottom-up dynamic programming method (DP) to find the optimal query execution plan (QEP) without evaluating redundant subplans. The distinguished exceptions are Volcano/Cascades using transforms to generate new plans according to a topdown approach. As recent research has revealed, bottom-up dynamic programming can improve performance with respect to the shape of the join graph and parallelism. However top-down join enumeration dynamic programming method can derive upper bounds for the costs of the plans it generates which is not available to typical bottom-up DP method.