This Article 
 Bibliographic References 
 Add to: 
Other Comments on "Optimization Algorithms for Distributed Queries"
April 1988 (vol. 14 no. 4)
pp. 439-441

The above paper proposes a distributed query optimization algorithm called GENERAL. Lakhani and Wang point out that the results obtained by the algorithm are not optimal. In this correspondence we point out another erroneous fact concerning the assumption of irreducibility of nonjoining attributes. We show that it is possible to generate an efficient semijoin program with better response time than the one produced by the GENERAL algorithm.

[1] 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.
[2] W. Cellary and T. Morzy, "Minimization of response time for simple query with multiple copies of data items," Inst. Control Eng., Tech. Univ. Poznan, Poland, Tech. Rep., 1985.
[3] S. Christodoulakis, "Implications of certain assumptions in database performance evaluation,"ACM Trans. Database Syst.vol. 9, no. 2, pp. 163-186, June 1984.
[4] G. D. Lakhani and J. S. Wang, "Comments on "Optimization algorithms for distributed queries,"IEEE Trans. Software Eng., vol. SE- 10, no. 4, pp. 464-465, July 1984.
[5] S. B. Yao, "Approximating block accesses in database organizations,"Commun. ACM, vol. 20, pp. 260-261, Apr. 1977.

Index Terms:
Distributed database systems, distributed processing strategy, heuristic algorithms.
W. Cellary, Z. Krolikowski, T. Morzy, "Other Comments on "Optimization Algorithms for Distributed Queries"," IEEE Transactions on Software Engineering, vol. 14, no. 4, pp. 439-441, April 1988, doi:10.1109/32.4666
Usage of this product signifies your acceptance of the Terms of Use.