Other Comments on "Optimization Algorithms for Distributed Queries"

Authors:
W. Cellary;Z. Krolikowski;T. Morzy
Affiliations:
University of Ponan´, Poland;University of Ponan´, Poland;University of Ponan´, Poland
Venue:
IEEE Transactions on Software Engineering
Year:
1988

Citing 3
Cited 0

Implications of certain assumptions in database performance evauation

ACM Transactions on Database Systems (TODS)
Query processing in a system for distributed databases (SDD-1)

ACM Transactions on Database Systems (TODS)
Approximating block accesses in database organizations

Communications of the ACM

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.