Author:
Sharafeldeen Ahmed,Alrahmawy Mohammed,Elmougy Samir
Abstract
AbstractCounting number of triangles in the graph is considered a major task in many large-scale graph analytics problems such as clustering coefficient, transitivity ratio, trusses, etc. In recent years, MapReduce becomes one of the most popular and powerful frameworks for analyzing large-scale graphs in clusters of machines. In this paper, we propose two new MapReduce algorithms based on graph partitioning. The two algorithms avoid the problem of duplicate counting triangles that other algorithms suffer from. The experimental results show a high efficiency of the two algorithms in comparison with an existing algorithm, overcoming it in the execution time performance, especially in very large-scale graphs.
Publisher
Springer Science and Business Media LLC
Reference24 articles.
1. Dean, J. & Ghemawat, S. Mapreduce: Simplified data processing on large clusters. In OSDI’04: Sixth Symposium on Operating System Design and Implementation 137–150 (2004).
2. Apache. Apache hadoop. http://hadoop.apache.org/. Accessed: 2022-04-09.
3. Li, X., Chang, L., Zheng, K., Huang, Z. & Zhou, X. Ranking weighted clustering coefficient in large dynamic graphs. World Wide Web 20, 855–883. https://doi.org/10.1007/s11280-016-0420-2 (2016).
4. Opsahl, T. & Panzarasa, P. Clustering in weighted networks. Soc. Netw. 31, 155–163. https://doi.org/10.1016/j.socnet.2009.02.002 (2009).
5. Chen, P.-L., Chou, C.-K. & Chen, M.-S. Distributed algorithms for k-truss decomposition. In 2014 IEEE International Conference on Big Data (Big Data) (IEEE, 2014).https://doi.org/10.1109/bigdata.2014.7004264.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献