An Efficient Join Query Processing Based on MJR Framework

Abstract

Large data analysis is an important topic in cloud computing. Large-scale data analysis requires complex data analysis, such as Theta-Join, which includes equi-join and nonequi-join. On the other hand, MapReduce is a programming framework in cloud computing to compute data analysis in parallel. In order to improve MapRduce performance in complex data analysis, researchers propose the Map-Join-Reduce API to support the equi-join operation. The proposed method not only extends the Map-Join-Reduce framework but also supports nonequi-join. We propose three concepts. First data are filtered first according to the query statements. Second, the filtered data are sent to its corresponding worker according to the join expression for higher level parallelism. Each worker then performs the corresponding join operation after receiving the filtered data. Finally, we aggregate the result by using aggregate functions specified in the select clause.