Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/PCCC.2014.7017031 | IPCCC |
Keywords | Field | DocType |
large-scale real world sns datasets,control messages,graph organization model,social network,marbor,memory consumption,graph data accesses,synchronization iterations performance,graph organization,large-scale graph data storage framework,synchronization,social network services,data handling,graph theory,large-scale graph data,large-scale graph data processing framework,social networking (online),graph processing methods,iterative methods,synchronisation,computational modeling,memory management,organizations,data processing | Data mining,Synchronization,Graph database,Data processing,Social network,Computer data storage,Computer science,Theoretical computer science,Memory management,Wait-for graph,Graph (abstract data type) | Conference |
ISSN | Citations | PageRank |
1097-2641 | 0 | 0.34 |
References | Authors | |
1 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wei Zhou | 1 | 10 | 6.30 |
| Yun Gao | 2 | 10 | 2.69 |
| Jizhong Han | 3 | 355 | 54.72 |
| Zhiyong Xu | 4 | 156 | 15.97 |