Marbor: A Novel Large-Scale Graph Data Storage and Processing Framework

被引：0

作者：

Zhou, Wei ^{[1
,2
]}

Gao, Yun ^{[1
,2
]}

Han, Jizhong ^{[1
]}

Xu, Zhiyong ^{[3
]}

机构：

[1] Chinese Acad Sci, Inst Informat Engn, Beijing, Peoples R China

[2] Univ Chinese Acad Sci, Beijing, Peoples R China

[3] Suffolk Univ, Dept Math & Comp Sci, Boston, MA 02114 USA

来源：

2014 IEEE INTERNATIONAL PERFORMANCE COMPUTING AND COMMUNICATIONS CONFERENCE (IPCCC) | 2014年

关键词：

social network; large-scale graph data; graph organization; synchronization;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this paper, we propose Marbor, a novel graph data processing framework to analyze the large-scale data in social network services. It develops an efficient graph organization model to minimize the costs of graph data accesses and reduce the memory consumption. In addition, we present a novel control message method in Marbor to improve the synchronization iterations performance. During the graph data processing, in each iteration, it analyzes the relationships among tasks and forwards the tasks to the next iteration with control messages, so no synchronization operations are used. We compare Marbor with other graph processing methods on several large-scale real world SNS datasets with two widely used applications, and the results show that Marbor outperforms the current mechanisms.

引用

页数：2