Large scale data processing using MapReduce

Zhengguo Sun, Florida International University

Abstract

As massive data sets become increasingly available, people are facing the problem of how to effectively process and understand these data. Traditional sequential computing models are giving way to parallel and distributed computing models, such as MapReduce, both due to the large size of the data sets and their high dimensionality. ^ This dissertation, as in the same direction of other researches that are based on MapReduce, tries to develop effective techniques and applications using MapReduce that can help people solve large-scale problems. ^ Three different problems are tackled in the dissertation. The first one deals with processing terabytes of raster data in a spatial data management system. Aerial imagery files are broken into tiles to enable data parallel computation. The second and third problems deal with dimension reduction techniques that can be used to handle data sets of high dimensionality. Three variants of the nonnegative matrix factorization technique are scaled up to factorize matrices of dimensions in the order of millions in MapReduce based on different matrix multiplication implementations. Two algorithms, which compute CANDECOMP/PARAFAC and Tucker tensor decompositions respectively, are parallelized in MapReduce based on carefully partitioning the data and arranging the computation to maximize data locality and parallelism. ^

Subject Area

Computer Science

Recommended Citation

Zhengguo Sun, "Large scale data processing using MapReduce" (January 1, 2011). ProQuest ETD Collection for FIU. Paper AAI3471602.
http://digitalcommons.fiu.edu/dissertations/AAI3471602

Files over 15MB may be slow to open. For best results, right-click and select "Save as..."

Share

COinS