C. T. Yu, Z. M. Ozsoyoglu, and K. Lam. Optimization of distributed tree queries. JCSS, 1984. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Decoupled Query Optimization for Federated Database Systems - Deshpande, Hellerstein (1 citation) (Correct)
....: Traditionally the optimization goal has been minimization of the total cost of execution, but in many applications, other factors such as response time, staleness of the data used in answering the query [36] or accuracy of the data [5] may also be critical. As has been pointed out previously [17, 48], optimizing for such an optimization goal requires the use of partial order dynamic programming technique. This technique is a generalization of the classical dynamic programming algorithm where the cost of each plan is computed as a vector and two costs are considered incomparable if neither is ....
C. T. Yu, Z. M. Ozsoyoglu, and K. Lam. Optimization of distributed tree queries. JCSS, 1984.
Integrating Semi-Join-Reducers into.. - Stocker, Kossmann, .. (2001) (1 citation) (Correct)
....difficulties is to optimize plans with semi join reducers because the search space of possible plans with semi joins is huge; much larger than the search space of plans without semijoins. The typical approach is to take advantage of semi join reducers by optimizing queries in several steps [YC84, YOL84, CY90] 1) find an optimal semi join reducer for each base table; 2) optimize the join order and methods for the (reduced) base tables. Optimal usually means to find semi join reducers such that the base tables are filtered as much as possible. Obviously, such an approach will not produce ....
....3.1 Overview In this chapter we present and discuss in detail the algorithms we studied. We will present algorithms which could be easily integrated into existing dynamic programming based optimizers. Our work differs from previous work since we do not focus on special query classes [BG81, YOL84] but on different search space and algorithm classes. For the purpose of presentation, we only consider select project join queries (SPJ queries) We will also concentrate on full joins and semi joins in the following and ignore thin joins. Thin joins, which are needed only in some particular ....
[Article contains additional citation context not shown here]
C. T. Yu, Z. M. Ozsoyoglu, and K. Lam. Optimization of distributed tree queries. Journal of Computer and System Sciences, 29(3):409--445, December 1984. 16
Interleaving A Join Sequence With Semijoins In Distributed Query .. - Chen, Yu (1992) (3 citations) Self-citation (Yu) (Correct)
.... in this context is mainly to reduce the communication cost required for data transmission [5] Significant research efforts have been focused on the problem of reducing the amount of data transmission required for phases (2) and (3) of distributed query processing [1] 12] 14] 18] 21] 22] 25] [26]. The semijoin operation especially has received considerable attention and been extensively studied in the literature. It has been proved that a tree query can be fully reduced by using semijoin [2] and there has been much research reported in optimizing semijoin sequences to process certain ....
C. T. Yu, Z. Ozsoyoglu and K. Lam, "Optimization of Distributed Tree Queries," J. Comput. Syst. Sci., vol. 29, no. 3, pp. 409-445, Dec. 1984.
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