This Article 
 Bibliographic References 
 Add to: 
Interleaving a Join Sequence with Semijoins in Distributed Query Processing
September 1992 (vol. 3 no. 5)
pp. 611-621
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.

[1] P. M. G. Apers, A. R. Hevner, and S. B. Yao, "Optimization algorithms for distributed queries,"IEEE Trans. Software Eng., vol. SE-9, no. 1, pp. 57-68, Jan. 1983.
[2] P. Bernstein and D. Chiu, "Using semijoins to solve relational queries,"J. ACM, vol. 28, no. 1, pp. 25-40, Jan. 1981.
[3] P. A. Bernstein, N. Goodman, E. Wong, G. L. Reeve, and J. Rothmie, "Query processing in a system for distributed database (SDD-I),"ACM Trans. Database Syst., vol. 6, Dec. 1981.
[4] P. A. Black and W. S. Luk, "A new heuristic for generating semi-join programs for distributed query processing," inProc. IEEE COMPSAC, 1982, pp. 581-588.
[5] S. Ceri and G. Pelagatti,Distributed Databases: Principles and Systems, McGraw-Hill, New York, 1984.
[6] A. L. P. Chen and V. O. K. Li, "Improvement algorithms for semijoin query processing programs in distributed database systems,"IEEE Trans. Comput., vol. C-33, no. 11, pp. 959-967, Nov. 1984.
[7] A. L. P. Chen and V. O. K. Li, "Optimizing star queries in distributed database systems," inProc. 10th Int. Conf. Very Large Data Bases, 1984, pp. 429-438.
[8] M.-S. Chen and P. S. Yu, "Using combination of join and semijoins operations for distributed query processing," inProc. 10th Int. Conf. Distributed Comput. Syst., May 1990, pp. 328-335.
[9] M.-S. Chen and P. S. Yu, "Using join operations as reducers in distributed query processing," inProc. 2nd Int. Symp. Databases in Parallel Distributed Syst., July 1990, pp. 116-123.
[10] D.-M. Chiu, P. A. Bernstein, and Y.-C. Ho, "Optimizing chain queries in a distributed database system,"SIAM J. Comput., vol. 13, pp. 116-134, Feb. 1984.
[11] W. W. Chu and P. Hurley, "Optimal query processing for distributed database systems,"IEEE Trans. Comput., vol. C-31, no. 9, pp. 135-150, Sept. 1982.
[12] N. Goodman and 0. Shmueli. "The tree property is fundamental for query processing," inProc. ACM Symp. Principles of Database Systems. pp. 40-48, 1982.
[13] F. Harary,Graph Theory. Reading, MA: Addison-Wesley, 1969.
[14] A. Hevner, "The optimization of query processing in distributed database systems," Ph.D. dissertation, Purdue Univ., West Lafayette, IN, Dec. 1979.
[15] A. R. Hevner and S. B. Yao, "Query processing in distributed database systems,"IEEE Trans. Software Eng., vol. SE-5, no. 5, pp. 177-187, May 1979.
[16] Y. Kambayashi, M. Yashikawa, and S. Yajima, "Query processing for distributed databases using generalized semi-joins," inACM Proc. SIGMOD. pp. 151-160, 1982.
[17] H. Kang and N. Roussopoulos, "Combining joins and semijoins in distributed query processing," Tech. Rep. CS-TR-1794, Univ. Maryland, College Park, 1987.
[18] S. Lafortune and E. Wong, "A state transition model for distributed query processing,"ACM Trans. Database Syst., vol. 11, pp. 294- 322, Sept. 1986.
[19] G. M. Lohman, C. Mohan, L. M. Hass, B. G. Lindsay, P. G. Selinger, P. F. Wilms, and D. Daniels, "Query processing inR*," Res. Rep. RJ 4272, IBM Res. Lab., San Jose, CA., Apr. 1984.
[20] N. Nilsson,Principles of Artificial Intelligence. Palo Alto, CA: Tioga, 1980.
[21] S. Pramanik and D. Vineyard, "Optimizing join queries in distributed databases,"IEEE Trans. Software Eng., vol. SE-14, no. 9, pp. 1319-1326, Sept. 1988.
[22] A. Segev, "Global heuristic for distributed query optimization," inProc. IEEE INFOCOM, 1986, pp. 388-394.
[23] C. Wang, "The complexity of processing tree queries in distributed databases," inProc. 2nd IEEE Symp. Parallel and Distributed Processing, pp. 604-611, Dec. 1990.
[24] S. B. Yao, "Approximating block accesses in database organizations,"Commun. ACM, vol. 20, pp. 260-261, Apr. 1977.
[25] H. Yoo and S. Lafortune, "An intelligent search method for query optimization by semijoins,"IEEE Trans. Knowledge Data Eng., vol. 1, no. 2, pp. 226-237, June 1989.
[26] C. Yu, Z. Ozsoyoglu, and K. Lam, "Optimization of distributed tree queries,"J. Comput. Syst. Sci., vol. 29, no. 3, pp. 409-445, Dec. 1984.
[27] C. Yu and C. Chang, "Distributed query processing,"ACM Comput. Surveys, vol. 16, no. 4, pp. 399-433, Dec. 1984.

Index Terms:
Index Termsdistributed query processing; interleaving; beneficial semijoins; join sequence tree;reducible relations; database theory; distributed databases; query processing; relationaldatabases
M.S. Chen, P.S. Yu, "Interleaving a Join Sequence with Semijoins in Distributed Query Processing," IEEE Transactions on Parallel and Distributed Systems, vol. 3, no. 5, pp. 611-621, Sept. 1992, doi:10.1109/71.159044
Usage of this product signifies your acceptance of the Terms of Use.