This Article 
 Bibliographic References 
 Add to: 
Algorithms for Distributed Query Processing in Broadcast Local Area Networks
June 1989 (vol. 1 no. 2)
pp. 215-225

Distributed query-processing algorithms for broadcast local-area networks are described which provide execution strategies and estimates of response time. Four semijoin-specific techniques, five transmission-specific techniques, and three size estimation update functions are incorporated into a baseline algorithm. These variants of the baseline algorithm are simulated and their response times compared using randomly generated data. The technique found to be most beneficial, on the average, for general queries involving multiple joining attributes is the composite semijoining technique. When used in combination with composite semijoining, relation transmission and bit-matrix transmission further reduce response time. Bit-matrix transmission is a data compression technique in which single attributes and a bit matrix of the value pairings are sent in place of a composite attribute. The authors examine these techniques in detail and compare their expected response times.

[1] P. Bernstein and D. Chiu, "Using semijoins to solve relational queries,"J. ACM, vol. 28, no. 1, pp. 25-40, Jan. 1981.
[2] M. Gouda and U. Dayal, "Optimal semijoin schedules for query processing in local distributed database systems," inProc. Int. Conf. Management of Data, ACM, New York, 1981.
[3] A. R. Hevner and S. B. Yao, "Query processing in distributed database systems," presented at the 1978 Berkeley Workshop on Distributed Data Management and Comput. Networks, Univ. Calif., Berkeley, 1978.
[4] A. R. Hevner, O. Q. Wu, and S. B. Yao, "Query optimization on local area networks,"ACM Trans. Office Inform., vol. 3, pp. 35-62, Jan. 1985.
[5] Y. Y. Lin, "Distributed query optimization on local area networks," Master's thesis, North Dakota State Univ., Fargo, 1988.
[6] W. K. Perrizo and C. S. Chen, "Composite semijoins in distributed query processing,"Inform. Sci., An Int. J., 1989.
[7] G. Sacco, "Distributed query evaluation in local area networks," inProc. Int. Conf. Data Eng., Los Angeles, CA, Apr. 1984, pp. 510- 516.
[8] P. Selinger,et al., "Access path selection in a relational data base system," inProc. 1979 ACM-SIGMOD Int. Conf. Management of Data, Boston, MA, June 1979.
[9] B. Wah and Y. Lien, "The file-assignment and query processing problems in local multiaccess networks," inProc. Int. Conf. Data Eng., Los Angeles, CA, Apr. 1984, pp. 228-235.
[10] S. B. Yao, "Optimization of query evaluation algorithms,"ACM Trans. Database Syst., vol. 4, no. 2, pp. 133-155, June 1979.
[11] C. T. Yu, C. C. Yang, and Y. C. Yang, "Two surprising results in processing simple queries in distributed databases," inProc. 1982 COMSAC, Nov. 1982, pp. 377-392.

Index Terms:
distributed query processing; broadcast local area networks; execution strategies; estimates; response time; semijoin-specific techniques; transmission-specific techniques; size estimation update functions; baseline algorithm; randomly generated data; multiple joining attributes; composite semijoining technique; composite semijoining; relation transmission; bit-matrix transmission; data compression technique; value pairings; composite attribute; broadcasting; distributed databases; information retrieval; local area networks
W. Perrizo, J.Y.Y. Lin, W. Hoffman, "Algorithms for Distributed Query Processing in Broadcast Local Area Networks," IEEE Transactions on Knowledge and Data Engineering, vol. 1, no. 2, pp. 215-225, June 1989, doi:10.1109/69.87961
Usage of this product signifies your acceptance of the Terms of Use.