The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January (1983 vol.9)
pp: 57-68
P.M.G. Apers , Informatica Wiskundig Seminarium, Vrije Universiteit
ABSTRACT
The efficiency of processing strategies for queries in a distributed database is critical for system performance. Methods are studied to minimize the response time and the total time for distributed queries. A new algorithm (Algorithm GENERAL) is presented to derive processing strategies for arbitrarily complex queries. Three versions of the algorithm are given: one for minimizing response time and two for minimizing total time. The algorithm is shown to provide optimal solutions under certain conditions.
INDEX TERMS
system modeling, Computer network, database, distributed database systems, distributed processing strategy, heuristic algorithms, query processing, relational data model
CITATION
P.M.G. Apers, A.R. Hevner, S.B. Yao, "Optimization Algorithms for Distributed Queries", IEEE Transactions on Software Engineering, vol.9, no. 1, pp. 57-68, January 1983, doi:10.1109/TSE.1983.236170
612 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool