2010 · 13 citations · 4 references
ComputingComputer ScienceComputer SystemsDistributed SystemsParallel AlgorithmsParallel ComputingData ParallelismData PartitioningDistributed ComputingDistributed Data ProcessingParallel Performance AnalysisQuery ProcessingData Partitioning StrategiesDistributed Data PartitioningMapreduceMapreduce AlgorithmsParallel PartitioningParallel Query ProcessingParallel Speedup AnalysisScalability
MapReduce has excellent scalability and fault-tolerance. It fits well with dominant distributed architectures of today, such as cluster or Grid, which are usually shared-nothing computing environments. However, using MapReduce for data analysis application still meets some challenges, since MapReduce is a low-level procedural programming paradigm and it does not directly support relational algebraic operators. In this work, we addressed a typical data analytic query, multiple group-by query. We parallelized the calculations involved in this type of query with MapReduce, and we introduced indexation and data partition in our work. We measured the speedup performance for implementations over both horizontally partitioned data and vertically partitioned data. We analysed the performance affecting factors from both measurement and formal estimation during this procedure.
4
Sanjay Ghemawat · Communications of the ACM · 2008 · 18.5K citations · Full text
Christopher Olston, Benjamin Reed, Utkarsh Srivastava et al. · 2008 · 1.7K citations
A. A. ABOUZEID, Kamil Bajda-Pawlikowski, Daniel J. Abadi et al. · Proceedings of the VLDB Endowment · 2009 · 856 citations
Google’s MapReduce programming model — Revisited
Ralf Lämmel · Science of Computer Programming · 2007 · 491 citations