Large-scale graph processing systems: a survey

被引:0
作者
Ning Liu
Dong-sheng Li
Yi-ming Zhang
Xiong-lve Li
机构
[1] National University of Defense Technology,Science and Technology on Parallel and Distributed Processing Laboratory
来源
Frontiers of Information Technology & Electronic Engineering | 2020年 / 21卷
关键词
Graph workloads; Graph applications; Graph processing systems; TP391.41;
D O I
暂无
中图分类号
学科分类号
摘要
Graph is a significant data structure that describes the relationship between entries. Many application domains in the real world are heavily dependent on graph data. However, graph applications are vastly different from traditional applications. It is inefficient to use general-purpose platforms for graph applications, thus contributing to the research of specific graph processing platforms. In this survey, we systematically categorize the graph workloads and applications, and provide a detailed review of existing graph processing platforms by dividing them into general-purpose and specialized systems. We thoroughly analyze the implementation technologies including programming models, partitioning strategies, communication models, execution models, and fault tolerance strategies. Finally, we analyze recent advances and present four open problems for future research.
引用
收藏
页码:384 / 404
页数:20
相关论文
共 105 条
[1]  
Bader DA(2006)Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs J Parall Distr Comput 66 1366-1378
[2]  
Cong G(2015)Large scale graph processing systems: survey and an experimental evaluation Clust Comput 18 1189-1213
[3]  
Batarfi O(2016)The end of slow networks: it’s time for a redesign Proc VLDB Endowm 9 528-539
[4]  
El S R(2001)A faster algorithm for betweenness centrality J Math Sociol 25 163-177
[5]  
Fayoumi AG(2010)HaLoop: efficient iterative data processing on large clusters Proc VLDB Endowm 3 285-296
[6]  
Binnig C(2014)Pregelix: big(ger) graph analytics on a dataflow engine Proc VLDB Endowm 8 161-172
[7]  
Crotty A(2010)More algorithms for all-pairs shortest paths in weighted graphs SIAM J Comput 39 2075-2089
[8]  
Galakatos A(2015)Optimal enumeration: efficient top- Proc VLDB Endowm 8 533-544
[9]  
Brandes U(1983) tree matching IEEE Trans Softw Eng 9 504-512
[10]  
Bu YY(2008)Graph traversal techniques and the maximum flow problem in distributed computation Commun ACM 51 107-113