A MapReduce is a framework that allows processing the very big amounts of formless data in parallel across a distributed cluster of processors or individual computers. The MapReduce framework is mostly used to analyze the large amount of datasets in clustering environments. MapReduce has become a dominant parallel computing paradigm for big data. This paper describes well known strategies in MapReduce, and present comprehensive comparative algorithms in MapReduce in clustering environment.

1. Bin Cao, Jianwei Yin, Qi Zhang, Yanming Ye, "A MapReduce-based architecture for rule matching in production system", 2nd IEEE International Conference on Cloud Computing Technology and Science ,2010.
2. Guoping Wang and CheeYong Chan, "MultiQuery Optimization in MapReduce Framework", 40th International Conference on Very Large Data Bases, September 2014.
3. Thomas Wirtz and Rong Ge, "Improving MapReduce Energy Efficiency for Computation Intensive Workloads", Green Computing Conference and Workshops (IGCC), 2011 International.
4. Prajesh P Anchalia, Anjan K Koundinya, Srinath N K, "MapReduce Design of K-Means Clustering Algorithm", 2013 IEEE.
5. Cheng T. Chu, Sang K. Kim, Yi A. Lin, Yuanyuan Yu, Gary R. Bradski, Andrew Y. Ng, and Kunle Olukotun, "Map-Reduce for Machine Learning on Multicore", NIPS, page 281--288. MIT Press, 2006.
6. Yaobin He, Haoyu Tan, Wuman Luo, Huajian Mao, Di Ma, Shengzhong Feng, Jianping Fan, "MR-DBSCAN: An Efficient Parallel Density-based Clustering Algorithm using MapReduce", 2011 IEEE 17th International Conference on Parallel and Distributed Systems.
7. Martin Ester, Hans-Peter Kriegel, Jörg Sander, Xiaowei Xu, "A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise", Published in Proceedings of 2nd International Conference on Knowledge Discovery and Data Mining (KDD-96).

Big Data Clustering Algorithm Mapreduce