Title :
Other comments on ´Optimization algorithms for distributed queries´ by P.M.G. Apears
Author :
Cellary, W. ; Krolikowski, Z. ; Morzy, T.
Author_Institution :
Inst. of Control Eng., Tech. Univ. of Poznan, Poland
fDate :
4/1/1988 12:00:00 AM
Abstract :
An erroneous fact concerning the assumption of irreducibility of nonjoining attributes of the distributed query optimization algorithm called GENERAL presented in the above paper (see ibid., vol.SE-9, no.1, p.57-68, Jan. 1983) is pointed out. It is shown that it is possible to generate an efficient semijoin program with better response time than the one produced by the GENERAL algorithm. A counterexample that proves this possibility is provided.
Keywords :
computational complexity; database theory; distributed databases; optimisation; GENERAL; computational complexity; distributed databases; distributed queries; irreducibility; nonjoining attributes; query optimization algorithm; response time; semijoin program; Control engineering; Database systems; Delay; Distributed processing; Heuristic algorithms; Scheduling algorithm;
Journal_Title :
Software Engineering, IEEE Transactions on
