Optimization Algorithms for Distributed Queries

Peter M. G. Apers, Alan R. Hevner, S. Bing Yao · IEEE Transactions on Software Engineering · 1983

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.

Cited by 241 works. doi:10.1109/tse.1983.236170

Authors

References