On optimal processor allocation to support pipelined hash joins
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
On parallel execution of multiple pipelined hash joins
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Parallelism and its price: a case study of nonstop SQL/MP
ACM SIGMOD Record
Considering data skew factor in multi-way join query optimization for parallel execution
The VLDB Journal — The International Journal on Very Large Data Bases - Parallelism in database systems
Applying Segmented Right-Deep Trees to Pipelining Multiple Hash Joins
IEEE Transactions on Knowledge and Data Engineering
Optimizing Large Join Queries Using A Graph-Based Approach
IEEE Transactions on Knowledge and Data Engineering
Coloring Away Communication in Parallel Query Optimization
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
| Hi-index | 0.00 |
A consensus on parallel architecture for very large database management has emerged. This architecture is based on a shared-nothing hardware organization. This computation model, however, is very sensitive to the skewness in the tuple distribution. Recently, several parallel join algorithms with dynamic load balancing capabilities have been proposed to address this issue. However, none of these algorithms consider the multi-way join problems. In this paper, we propose a dynamic load balancing technique for multi-way joins, and investigate the effect of load balancing on query optimization.