W. Scheufele and G. Moerkotte. Efficient dynamic programming algorithms for ordering expensive joins and selections. Forthcoming Technical Report, Lehrstuhl fur Praktische Informatik III, Universitat Mannheim, 68131 Mannheim, Germany, 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Query Optimization in the Presence of Limited Access Patterns - Florescu, Levy, Manolescu (1999) (45 citations) (Correct)
....in identical executions. In the next section we analyze the size of the search space sanctioned by the conclusions of this section. 4 The Size of the Search Space The size of the space that needs to be searched by a query optimizer employing dynamic programming is relatively well understood [8, 11, 19]. In this section we study the effect on the size of the search space in the presence of access pattern limitations, and the associated need to search the space of annotated query execution plans. We present both an analytical and empirical study. The results of this study also justifies the ....
....line two. We remark that the number of bushy trees considered here is the same Graph Qep s LL Qep s Pqep s in d.p. LL Pqep s in d.p. R i (u f ; v f ) i = 1; n; bound(q) Gamma 2(n Gamma1) n Gamma1 Delta (n Gamma 1) n 3 n Gamma 2 n 1 1 n(2 n Gamma1 Gamma 1) 11] 11] [8, 19] [8, 19] R i (u b ; v f ) i = 1; n; bound(q) fx0g Gamma 2(n Gamma1) n Gamma1 Delta 1 n 1 n 3 Gamman 6 n Gamma 1 [8, 19] R i (u f ; v f ) i 2 fi 1 ; i mg, R i (u b ; v f ) i 62 fi 1 ; i mg bound(q) Gamma 2(n Gamma1) n Gamma1 Delta ....
[Article contains additional citation context not shown here]
W.Scheufele and G.Moerkotte. Efficient dynamic programming algorithms for ordering expensive joins and selections. In Proc. of EDBT, 1998.
Query Optimization in the Presence of Limited Access.. - Florescu, Levy.. (1999) (45 citations) (Correct)
....in identical executions. In the next section we analyze the size of the search space sanctioned by the conclusions of this section. 4 The Size of the Search Space The size of the space that needs to be searched by a query optimizer employing dynamic programming is relatively well understood [11, 14, 20]. In this section we study the effect on the size of the search space in the presence of access pattern limitations, and the associated need to search the space of annotated query execution plans. We present both an analytical and empirical study. The results of this study also justifies some of ....
....could take all permutations. The number of plans considered by the dynamic programming algorithm also decreases dramatically from line one to line two. We remark that the nuber of bushy trees considered here is the same as that considered in the classical case for plans without carthesian products[11, 20]. The next line Graph Qep s LL Qep s Pqep s in d.p. LL Pqep s in d.p. R i (u f ; v f ) i = 1; n bound(q) Gamma 2(n Gamma1) n Gamma1 Delta (n Gamma 1) n 3 n Gamma 2 n 1 1 n(2 n Gamma1 Gamma 1) 14] 14] 11, 20] 11, 20] R i (u b ; v f ) i = 1; n bound(q) fx ....
[Article contains additional citation context not shown here]
W.Scheufele and G.Moerkotte. Efficient dynamic programming algorithms for ordering expensive joins and selections. In Proc. of the Conf. on Extending Database Technology (EDBT), 1998.
A New Heuristic for Optimizing Large Queries - Fegaras (1998) (4 citations) (Correct)
....to the KBZ algorithm because it does not pose any restrictions to cost functions, it generates bushy trees, and it considers sizes of intermediate results instead of selectivities only. Recently, the KBZ algorithm has been extended by Scheufele and Moerkotte to include expensive predicates [15]. In a previous work [5] we have presented a top down heuristic for ordering joins. It applies the min cut algorithm recursively to split the query graph into two query subgraphs each time so that the product of selectivities between the relations of these two subgraphs is maximum. For each such ....
W. Scheufele and G. Moerkotte. Efficient Dynamic Programming Algorithms for Ordering Expensive Joins and Selections. International Conference on Extending Data Base Technology, Valencia, Spain, March 1997.
Efficient Dynamic Programming Algorithms for Ordering.. - Scheufele, Moerkotte (1997) (5 citations) Self-citation (Scheufele Moerkotte) (Correct)
No context found.
W. Scheufele and G. Moerkotte. Efficient dynamic programming algorithms for ordering expensive joins and selections. Forthcoming Technical Report, Lehrstuhl fur Praktische Informatik III, Universitat Mannheim, 68131 Mannheim, Germany, 1998.
Efficient Evaluation of Queries with Mining Predicates - Chaudhuri, Narasayya.. (2002) (1 citation) (Correct)
No context found.
G. M. Wolfgang Scheufele. Efficient dynamic programming algorithms for ordering expensive joins and selections. In Proc. of the 6th Int'l Conference on Extending Database Technology (EDBT), Valencia, Spain, 1998. 15
SECONDO: An Extensible DBMS Architecture and Prototype - Güting, Behr, Almeida.. (Correct)
No context found.
Scheufele, W., and G. Moerkotte, Efficient Dynamic Programming Algorithms for Ordering Expensive Joins and Selections. Proc. EDBT, 1998, 201-215.
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