Computing Connected Components with linear communication cost in pregel-like systems

Publisher:
IEEE
Publication Type:
Conference Proceeding
Citation:
2016 IEEE 32nd International Conference on Data Engineering, ICDE 2016, 2016, pp. 85 - 96
Issue Date:
2016-06-22
Full metadata record
Files in This Item:
Filename Description Size
Computing+paper.pdfAccepted Manuscript Version824.03 kB
Adobe PDF
© 2016 IEEE.The paper studies two fundamental problems in graph analytics: computing Connected Components (CCs) and computing BiConnected Components (BCCs) of a graph. With the recent advent of Big Data, developing effcient distributed algorithms for computing CCs and BCCs of a big graph has received increasing interests. As with the existing research efforts, in this paper we focus on the Pregel programming model, while the techniques may be extended to other programming models including MapReduce and Spark. The state-of-the-art techniques for computing CCs and BCCs in Pregel incur O(m × #supersteps) total costs for both data communication and computation, where m is the number of edges in a graph and #supersteps is the number of supersteps. Since the network communication speed is usually much slower than the computation speed, communication costs are the dominant costs of the total running time in the existing techniques. In this paper, we propose a new paradigm based on graph decomposition to reduce the total communication costs from O(m×#supersteps) to O(m), for both computing CCs and computing BCCs. Moreover, the total computation costs of our techniques are smaller than that of the existing techniques in practice, though theoretically they are almost the same. Comprehensive empirical studies demonstrate that our approaches can outperform the existing techniques by one order of magnitude regarding the total running time.
Please use this identifier to cite or link to this item: