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)
Dynamic rematerialization: processing distributed queries using redundant data
The INGRES papers: anatomy of a relational database system
Optimizing joins between two partitioned relations in distributed databases
Journal of Parallel and Distributed Computing
R* optimizer validation and performance evaluation for local queries
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
ACM Transactions on Database Systems (TODS)
Implications of certain assumptions in database performance evauation
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)
A threshold mechanism for distributed query processing
CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
Distributed Query Processing Optimization Objectives
Proceedings of the Fourth International Conference on Data Engineering
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
R* Optimizer Validation and Performance Evaluation for Distributed Queries
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
The optimization of query processing on distributed database systems
The optimization of query processing on distributed database systems
Query processing strategies in a distributed database
Query processing strategies in a distributed database
Combinatorial Algorithms: Theory and Practice
Combinatorial Algorithms: Theory and Practice
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
Intensive Data Management in Parallel Systems: A Survey
Distributed and Parallel Databases
Deciding to Correct Distributed Query Processing
IEEE Transactions on Knowledge and Data Engineering
Large Join Optimization on a Hypercube Multiprocessor
IEEE Transactions on Knowledge and Data Engineering
Testing of heuristic methods: a case study of greedy algorithm
CEE-SET'08 Proceedings of the Third IFIP TC 2 Central and East European conference on Software engineering techniques
| Hi-index | 0.00 |
This paper examines heuristic algorithms for processing distributed queries using generalized joins. As this optimization problem is NP-hard heuristic algorithms are deemed to be justified. A heuristic algorithm to form/formulate strategies to process queries is presented. It has a special property in that its overhead can be “controlled”: The higher its overhead the better the strategies it produces. Modeling on a test-bed of queries is used to demonstrate that there is a trade-off between the strategy's execution and formulation delays. The modeling results also support the notion that simple greedy heuristic algorithms such as are proposed by many researchers are sufficient in that they are likely to lead to near-optimal strategies and that increasing the overhead in forming strategies is only marginally beneficial. Both the strategy formulation and execution delays are examined in relation to the number of operations specified by the strategy and the total size of partial results.