Distributed databases principles and systems
Distributed databases principles and systems
On the optimal nesting order for computing N-relational joins
ACM Transactions on Database Systems (TODS)
Query processing in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
A statistical approach to incomplete information in database systems
ACM Transactions on Database Systems (TODS)
Adaptive Techniques for Distributed Query Optimization
Proceedings of the Second International Conference on Data Engineering
Proceedings of the Second International Conference on Data Engineering
Load Control and Load Balancing in a Shared Database Management System
Proceedings of the Second International Conference on Data Engineering
Query processing strategies in a distributed database
Query processing strategies in a distributed database
Heuristic algorithms for distributed query processing
DPDS '88 Proceedings of the first international symposium on Databases in parallel and distributed systems
Dynamic distributed query processing techniques
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Correcting execution of distributed queries
DPDS '90 Proceedings of the second international symposium on Databases in parallel and distributed systems
Deciding to Correct Distributed Query Processing
IEEE Transactions on Knowledge and Data Engineering
Generating query plans for distributed query processing using genetic algorithm
ICICA'11 Proceedings of the Second international conference on Information Computing and Applications
| Hi-index | 0.00 |
A strategy to process a distributed query is formed using estimates for partial results sizes and delays/costs associated with the network data transfer and CPU processing. To guard against inaccurate estimates the strategy execution is monitored and if estimates are observed to be “inaccurate” the strategy is corrected. This paper presents and compares two methods which can be used to decide whether or not to correct a strategy. In the Reformulation method a new strategy is formulated after executing each relational operation. The Thresholds method is based on the fact that some partial results formed by the strategy's execution are more “critical” than others. The query processing strategy is represented as a network of activities and the Critical Path Method method is used to determine threshold values for partial results. If a partial result is delayed beyond its threshold value the strategy is corrected. The Reformulation and Thresholds methods are evaluated on a test-bed of queries for a modeled application of a DDB.