M.S. Chen, P. S. Yu, K.L. Wu, Optimization of Parallel Execution for Multi-Join Queries, IEEE Trans. on Knowledge and Data Eng., 8(3), 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
On Applying Hash Filters to Improving the Execution of.. - Chen, Hsiao, Yu (1997) (1 citation) (Correct)
....task mix to be executed concurrently. For efficient solutions, only schemes that execute at most two tasks at a time were explored in [11] A two step approach to deal with join sequence scheduling and processor allocation for parallel query processing using sort merge joins was devised in [7]. Pipelining hash joins in a bushy tree and processor allocation within each pipeline were studied in [5] and [18] respectively. In addition, various query plans in processing multi join queries in a shared nothing architecture were investigated in [24] While most prior work on inter operator ....
....using HFs via simulation. It is experimentally shown that the application of HFs is in general a very powerful means to improve the execution of multi join queries, and the improvement becomes more prominent as the number of relations in a query increases. 2 Various heuristics, such as those in [7] and [20] can be applied to build a bushy execution tree. Note that assigning sequence numbers to joins while building a bushy tree involves little overhead 123 The rest of this paper is organized as follows. Preliminaries are given in Sect. 2. The effect of HFs and the proposed scheme are ....
[Article contains additional citation context not shown here]
Chen M-S, Yu PS, Wu K-L (1995) Optimization of Parallel Execution for Multi-Join Queries. IEEE Trans Knowl Data Eng, 8(3): 416--428
Building DD to Support Query Processing in Federated Systems - Chen, Benn (1997) Self-citation (Chen) (Correct)
....or in [YL89] In the second phase, we translate the left deep join tree into a balanced bushy join tree using the methods developed in [CB96b, CB97, DSD95] see Fig. 10(b) for illustration. But one may wonder why not to generate a balanced bushy join tree directly from a join sequence as done in [CYW96]. The reason for this is as follows: i) The bushy join tree generated (directly from a join sequence) by [CYW96] is not balanced. Therefore, an extra process is needed to balance such a tree just as for a left deep join tree. ii) The time complexity of the algorithm for finding such a bushy join ....
....methods developed in [CB96b, CB97, DSD95] see Fig. 10(b) for illustration. But one may wonder why not to generate a balanced bushy join tree directly from a join sequence as done in [CYW96] The reason for this is as follows: i) The bushy join tree generated (directly from a join sequence) by [CYW96] is not balanced. Therefore, an extra process is needed to balance such a tree just as for a left deep join tree. ii) The time complexity of the algorithm for finding such a bushy join tree (directly from a join sequence) Y. Chen, W. Benn 5 8 is O(n Delta e) where n and e are the numbers of ....
[Article contains additional citation context not shown here]
M-S. Chen, P.S. Yu and K-L. Wu. "Optimization of Parallel Execution for Multi-Join Queries," IEEE Trans. on Knowledge and Data Engineering, vol. 8, No. 3, June 1996, pp. 416-428.
Research Issues in Data Warehousing - Wu, Buchmann (1997) (18 citations) (Correct)
No context found.
M.S. Chen, P. S. Yu, K.L. Wu, Optimization of Parallel Execution for Multi-Join Queries, IEEE Trans. on Knowledge and Data Eng., 8(3), 1996.
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