Optimization Algorithms for Distributed Queries

Share/Save/Bookmark

Apers, Peter M.G. and Hevner, Alan R. and Yao, S. Bing (1983) Optimization Algorithms for Distributed Queries. IEEE Transactions on Software Engineering, 9 (1). pp. 57-68. ISSN 0098-5589

[img]
Preview
PDF
4Mb
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.
Item Type:Article
Copyright:© 1983 IEEE
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/64318
Official URL:http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1703012
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page