Optimization Algorithms for Distributed Queries

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

Research output: Contribution to journalArticleAcademicpeer-review

144 Citations (Scopus)
2574 Downloads (Pure)

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 languageUndefined
Pages (from-to)57-68
Number of pages12
JournalIEEE transactions on software engineering
Volume9
Issue number1
Publication statusPublished - Jan 1983

Keywords

  • IR-64318
  • EWI-10968
  • DB-DFDB: DISTRIBUTED OR FEDERATED DATABASES

Cite this