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.
Original language | Undefined |
---|---|
Pages (from-to) | 57-68 |
Number of pages | 12 |
Journal | IEEE transactions on software engineering |
Volume | 9 |
Issue number | 1 |
Publication status | Published - Jan 1983 |
Keywords
- IR-64318
- EWI-10968
- DB-DFDB: DISTRIBUTED OR FEDERATED DATABASES