Interleaving A Join Sequence With Semijoins In Distributed Query Processing (1992)
| Venue: | IEEE Transactions on Parallel and Distributed Systems |
| Citations: | 12 - 7 self |
BibTeX
@ARTICLE{Chen92interleavinga,
author = {Ming-syan Chen and Philip S. Yu},
title = {Interleaving A Join Sequence With Semijoins In Distributed Query Processing},
journal = {IEEE Transactions on Parallel and Distributed Systems},
year = {1992},
volume = {3}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In distributed query processing, the conventional approach to reduce the amount of data transmission is to first apply a sequence of semijoins as "reducers" and then ship the resultant relations to the final site to carry out the join operations. Recently, it has been shown that the approach of applying a combination of joins and semijoins as reducers can lead to substantially larger reduction on data transmission required. In this paper, we develop an efficient heuristic approach to determine an effective sequence of semijoin and join reducers. Semijoins whose execution will reduce the amount of data transmission required to perform a join sequence are termed beneficial semijoins for that join sequence. Note that beneficial semijoins include the conventional profitable semijoins and the gainful semijoins that are not profitable themselves but become beneficial due to the inclusion of join reducers. This type of dependency between semijoin and join reducers complicates the identificati...
