This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimization Algorithms for Distributed Queries
January 1983 (vol. 9 no. 1)
pp. 57-68
P.M.G. Apers, Informatica Wiskundig Seminarium, Vrije Universiteit
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, Jan. 1983, doi:10.1109/TSE.1983.236170
Usage of this product signifies your acceptance of the Terms of Use.