The Community for Technology Leaders
2012 IEEE 12th International Conference on Data Mining Workshops (2012)
Brussels, Belgium Belgium
Dec. 10, 2012 to Dec. 10, 2012
ISBN: 978-1-4673-5164-5
pp: 218-225
Network structures, especially social networks, grow rapidly and provide huge datasets intractable to analyse. In this paper, two parallel approaches to process large graph structures within the Hadoop environment were compared: Bulk Synchronous Parallel (BSP) and MapReduce (MR). The experimental studies were carried out for two different graph problems: collective classification by means of Relational Influence Propagation (RIP) and Single Source Shortest Path (SSSP) calculation. The appropriate BSP and MapReduce algorithms for these problems were applied to various network datasets differing in size and structural profile, originating from three domains: telecommunication, multimedia and microblog. The collected results revealed that iterative graph processing with BSP implementation significantly outperform popular MapReduce, especially for algorithms with many iterations and sparse communication. However, MapReduce still remains the only alternative for enormous networks.
Networked Data, Bulk Synchronous Parallel, MapReduce, Large Graph Processing, Big Data, Cloud Computing, Parallel Processing, Collective Classification, Shortest Path

T. Kajdanowicz, W. Indyk, P. Kazienko and J. Kukul, "Comparison of the Efficiency of MapReduce and Bulk Synchronous Parallel Approaches to Large Network Processing," 2012 IEEE 12th International Conference on Data Mining Workshops(ICDMW), Brussels, Belgium Belgium, 2012, pp. 218-225.
83 ms
(Ver 3.3 (11022016))