About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Conference paper
Determining beneficial semijoins for a join sequence in distributed query procressing
Abstract
The problem of combining join and semijoin reducers for distributed query processing is studied. An approach of interleaving a join sequence with beneficial semijoins is proposed. A join sequence is mapped into a join sequence tree that provides an efficient way to identify for each semijoin its correlated semijoins as well as its reducible relations under the join sequence. In light of these properties, an algorithm is developed to determine an effective sequence of join reducers. Examples are also given to illustrate the results, which show that the approach of interleaving a join sequence with beneficial semijoins is effective in reducing the amount of data transmission to process distributed queries.