Optimization Algorithms for Distributed Queries
- 1 January 1983
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. SE-9 (1), 57-68
- https://doi.org/10.1109/tse.1983.236170
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
This publication has 9 references indexed in Scilit:
- Query processing in a system for distributed databases (SDD-1)ACM Transactions on Database Systems, 1981
- Using Semi-Joins to Solve Relational QueriesJournal of the ACM, 1981
- A methodology for interpreting tree queries into optimal semi-join expressionsPublished by Association for Computing Machinery (ACM) ,1980
- Query Processing in Distributed Database SystemIEEE Transactions on Software Engineering, 1979
- Evaluation of transmission requirements in distributed database accessPublished by Association for Computing Machinery (ACM) ,1979
- Access path selection in a relational database management systemPublished by Association for Computing Machinery (ACM) ,1979
- Distributed query processing in a relational data base systemPublished by Association for Computing Machinery (ACM) ,1978
- Decomposition—a strategy for query processingACM Transactions on Database Systems, 1976
- A relational model of data for large shared data banksCommunications of the ACM, 1970