Issue No. 05 - September (1992 vol. 3)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.159044
The problem of combining join and semijoin reducers for distributed query processing is studied. An approach based on interleaving a join sequence with beneficial semijoins is proposed. A join sequence is mapped into a join sequence tree first. The join sequence tree 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 for determining an effective sequence of join and semijoin reducers is developed. Examples are given to illustrate the results. They show the advantage of using a combination of joins and semijoins as reducers for distributed query processing.
Index Termsdistributed query processing; interleaving; beneficial semijoins; join sequence tree;reducible relations; database theory; distributed databases; query processing; relationaldatabases
P. Yu and M. Chen, "Interleaving a Join Sequence with Semijoins in Distributed Query Processing," in IEEE Transactions on Parallel & Distributed Systems, vol. 3, no. , pp. 611-621, 1992.