Abstrakt

Comparison of Join Algorithms in Map Reduce Framework

Mani Bushan, Balaraj J, Oinam Martina Devi

In the current technological world, there is generation of enormous data each and every day by different media and social networks. The MapReduce framework is increasingly being used widely to analyse large volumes of data. One of the techniques that framework is join algorithm. Join algorithms can be divided into two groups: Reduceside join and Map-side join. The aim of our work is to compare existing join algorithms which are used by the MapReduce framework. We have compared Reducer-side merge join and Map-side replication-join in terms of preprocessing, the number of phases involved, whether it is sensitive to data skew, whether there is need for distributed Cache, memory overflow.