Optimization Algorithms for Distributed Queries

Authors:
P. M. G. Apers;A. R. Hevner;S. B. Yao
Affiliations:
Informatica Wiskundig Seminarium, Vrije Universiteit;-;-
Venue:
IEEE Transactions on Software Engineering
Year:
1983

Citing 0
Cited 10

Algorithms to Process Distributed Queries in Fast Local Networks

IEEE Transactions on Computers
Optimizing Large Join Queries in Mediation Systems

ICDT '99 Proceedings of the 7th International Conference on Database Theory
Evaluation of Join Strategies for Distributed Mediation

ADBIS '01 Proceedings of the 5th East European Conference on Advances in Databases and Information Systems
Improvement Algorithms for Semijoin Query Processing Programs in Distributed Database Systems

IEEE Transactions on Computers
XRPC: interoperable and efficient distributed XQuery

VLDB '07 Proceedings of the 33rd international conference on Very large data bases
An integrated query optimization system for data grids

COMPUTE '08 Proceedings of the 1st Bangalore Annual Compute Conference
A PSO and a Tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application

Computers and Operations Research
Distributed stream join query processing with semijoins

Distributed and Parallel Databases
Simulation of a distributed query processing algorithm on token ring networks

Mathematical and Computer Modelling: An International Journal
A strategy for optimizing a multi-site query in a distributed spatial database

W2GIS'13 Proceedings of the 12th international conference on Web and Wireless Geographical Information Systems

Quantified Score

Hi-index	0.01

Visualization

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.