Processing multi-join query in parallel systems

In parallel systems, a number of joins from one or more queries ean be exeeuted either seriatly or in parallel. While seriat execution assigns all processors to execute each join one after another, the parallel execution distributes the joins to clusters formed by certain number of processors and exeeutes them concurrently. Both approaches employ parallelism to improve system performance. However, data skew may result in load imbalance among processors executing the same join and some clusters may be overloaded with time-consuming joins. As a result, the completion time will be much longer than what is expeeted. In this paper, we propose an algorithm to further minimize the completion time of concurrently executed multiple joins. For this algorithm, all the joins to be executed concurrently are decomposed into a set of tasks that are ordered according to decreasing task size. These tasks are dynamically allocated to available processors during exeeution. Our performance study shows that the proposed algorithm outperforms the previously proposed approaches, especially when number of processors increases, high skewness is present in the relations to be joined and relation sizes are large.