Distributed databases principles and systems
Distributed databases principles and systems
Optimizing chain queries in a distributed database system.
SIAM Journal on Computing
Optimization of distributed tree queries
Journal of Computer and System Sciences
ACM Computing Surveys (CSUR)
A state transition model for distributed query processing
ACM Transactions on Database Systems (TODS)
Optimizing Join Queries in Distributed Databases
IEEE Transactions on Software Engineering
Query processing in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
Using Semi-Joins to Solve Relational Queries
Journal of the ACM (JACM)
Graph Algorithms
Query processing for distributed databases using generalized semi-joins
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
An Intelligent Search Method for Query Optimization by Semijoins
IEEE Transactions on Knowledge and Data Engineering
Optimizing Star Queries in a Distributed Database System
VLDB '84 Proceedings of the 10th 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
Adaptive Join Algorithms in Dynamic Distributed Databases
Distributed and Parallel Databases
Interleaving a Join Sequence with Semijoins in Distributed Query Processing
IEEE Transactions on Parallel and Distributed Systems
Combining Joint and Semi-Join Operations for Distributed Query Processing
IEEE Transactions on Knowledge and Data Engineering
Database placement in communication networks for minimizing the overall transmission cost
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.00 |
Semijoin has traditionally been relied upon for reducing the communication cost required for distributed query processing. However, judiciously applying join operations as reducers can lead to further reduction in the communication cost. In view of this fact, we explore in this paper the approach of using join operations, in addition to semijoins, as reducers in distributed query processing. We first show that the problem of determining a sequence of join operations for a query graph can be transformed to that of finding a set of cuts to that graph, where a cut to a graph is a partition of the nodes in that graph. In light of the mapping we develop an efficient heuristic algorithm to determine an effective sequence of join reducers for a query. The algorithm using the concept of divide-and-conquer is shown to have polynomial time complexity. Examples are also given to illustrate our results.