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.
|Number of pages||12|
|Journal||IEEE transactions on software engineering|
|Publication status||Published - Jan 1983|
- DB-DFDB: DISTRIBUTED OR FEDERATED DATABASES