Optimization Algorithms for Distributed Queries

Author

Apers, Peter M G ; Hevner, Alan R. ; Yao, S. Bing

Author_Institution

Informatica Wiskundig Seminarium, Vrije Universiteit

Issue

1

fYear

1983

Firstpage

57

Lastpage

68

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.

Keywords

Computer network; database; distributed database systems; distributed processing strategy; heuristic algorithms; query processing; relational data model; system modeling; Data models; Database systems; Delay; Distributed databases; Distributed processing; Heuristic algorithms; Indexes; Query processing; Relational databases; System performance; Computer network; database; distributed database systems; distributed processing strategy; heuristic algorithms; query processing; relational data model; system modeling;

fLanguage

English

Journal_Title

Software Engineering, IEEE Transactions on

Publisher

ieee

ISSN

0098-5589

Type

jour

DOI

10.1109/TSE.1983.236170

Filename

1703012