Parallel data processing with MapReduce

Kyong-Ha Lee, Yoon-Joon Lee, Hyun‐Sik Choi, Yon Dohn Chung, Bongki Moon

ACM SIGMOD Record · 2012 · 555 citations · 80 references

Concepts

TL;DR

MapReduce is a widely adopted parallel data‑processing framework whose growing data volumes have spurred industry and academic interest, yet debates remain about its performance, node‑level efficiency, and abstraction simplicity. This survey aims to help database and open‑source communities understand the technical aspects of the MapReduce framework. The survey characterizes MapReduce’s architecture, evaluates its strengths and weaknesses, reviews recent optimization strategies, and highlights open challenges in parallel data analysis.

Abstract

A prominent parallel data processing tool MapReduce is gaining significant momentum from both industry and academia as the volume of data to analyze grows rapidly. While MapReduce is used in many areas where massive data analysis is required, there are still debates on its performance, efficiency per node, and simple abstraction. This survey intends to assist the database and open source communities in understanding various technical aspects of the MapReduce framework. In this survey, we characterize the MapReduce framework and discuss its inherent pros and cons. We then introduce its optimization strategies reported in the recent literature. We also discuss the open issues and challenges raised on parallel data analysis with MapReduce.

References

80