Distributed Triangle Approximately Counting Algorithms in Simple Graph Stream
Open Access
- 8 January 2022
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 16 (4) , 1-43
Abstract
Recently, the counting algorithm of local topology structures, such as triangles, has been widely used in social network analysis, recommendation systems, user portraits and other fields. At present, the problem of counting global and local triangles in a graph stream has been widely studied, and numerous triangle counting steaming algorithms have emerged. To improve the throughput and scalability of streaming algorithms, many researches of distributed streaming algorithms on multiple machines are studied. In this article, we first propose a framework of distributed streaming algorithm based on the Master-Worker-Aggregator architecture. The two core parts of this framework are an edge distribution strategy, which plays a key role to affect the performance, including the communication overhead and workload balance, and aggregation method, which is critical to obtain the unbiased estimations of the global and local triangle counts in a graph stream. Then, we extend the state-of-the-art centralized algorithm TRIÈST into four distributed algorithms under our framework. Compared to their competitors, experimental results show that DVHT-i is excellent in accuracy and speed, performing better than the best existing distributed streaming algorithm. DEHT-b is the fastest algorithm and has the least communication overhead. What’s more, it almost achieves absolute workload balance.Keywords
Funding Information
- National Natural Science Foundation of China (62020106013 and 61572113)
- Sichuan Science and Technology Program (2020JDTD0007 and 2020YFG0298)
- The Science and Technology Achievements Transformation Demonstration Project of Sichuan Province of China (2018CC0094)
- the Fundamental Research Funds for the Central Universities (ZYGX2019J075 and 2082604401036)
This publication has 36 references indexed in Scilit:
- Uncovering social network Sybils in the wildACM Transactions on Knowledge Discovery From Data, 2014
- PATRIC2013
- Simple Topological Features Reflect Dynamics and Modularity in Protein Interaction NetworksPLOS Computational Biology, 2013
- Counting and sampling triangles from a graph streamProceedings of the VLDB Endowment, 2013
- Efficient algorithms for large-scale local triangle countingACM Transactions on Knowledge Discovery From Data, 2010
- Spectral counting of triangles via element-wise sparsification and triangle-based link recommendationSocial Network Analysis and Mining, 2010
- Short cycle connectivityDiscrete Mathematics, 2007
- Counting triangles in data streams2006
- The Structure and Function of Complex NetworksSIAM Review, 2003
- Curvature of co-links uncovers hidden thematic layers in the World Wide WebProceedings of the National Academy of Sciences, 2002