Title :
Correction to "Optimal Query Processing for Distributed Database Systems"
Author :
Chu, Wesley W. ; Hurley, P.
Author_Institution :
Department of Computer Science, School of Engineering and Applied Science, University of California
Abstract :
In the above paper1, Theorem 1 is not true in general. The purpose of Theorem 1 was to reduce the number of feasible query trees by determining the optimal positions of unary operations in a given query tree. In fact, Theorem I is true only if the processing cost of a unary operation is independent of the volume of input data.
Keywords :
Arithmetic; Clocks; Costs; Database systems; Query processing; Tree graphs;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1983.1676340