Affiliations: [a] Computer Engineering Department, Jordan University of Science and Technology, Irbid, Jordan
| [b] Computer Information Systems Department, Jordan University of Science and Technology, Irbid, Jordan
Correspondence:
[*]
Corresponding author. Amer Al-Badarneh, Computer Information Systems Department, Jordan University of Science and Technology, Irbid, Jordan. E-mail: [email protected].
Abstract: Large-scale datasets collected from heterogeneous sources often require a join operation to extract valuable information. MapReduce is an efficient programming model for processing large-scale data. However, it has some limitations in processing heterogeneous datasets. This is because of the large amount of redundant intermediate records that are transferred through the network. Several filtering techniques have been developed to improve the join performance, but they require multiple MapReduce jobs to process the input datasets. To address this issue, the adaptive filter-based join algorithms are presented in this paper. Specifically, three join algorithms are introduced to perform the processes of filters creation and redundant records elimination within a single MapReduce job. A cost analysis of the introduced join algorithms shows that the I/O cost is reduced compared to the state-of-the-art filter-based join algorithms. The performance of the join algorithms was evaluated in terms of the total execution time and the total amount of I/O data transferred. The experimental results show that the adaptive Bloom join, semi-adaptive intersection Bloom join, and adaptive intersection Bloom join decrease the total execution time by 30%, 25%, and 35%, respectively; and reduce the total amount of I/O data transferred by 18%, 25%, and 50%, respectively.
Keywords: Join algorithms, big data management, query optimization, MapReduce
