Recently, distributed processing of large dynamic graphs has become very popular, especially in certain domains such as social network analysis, Web graph analysis and spatial network analysis. In this context, many distributed/parallel graph processing systems have been proposed, such as Pregel, PowerGraph, GraphLab, and Trinity. However, these systems deal only with static graphs and do not consider the issue of processing evolving and dynamic graphs. In this paper, we are considering the issues of scale and dynamism in the case of graph processing systems. We present bladyg, a graph processing framework that addresses the issue of dynamism in large-scale graphs. We present an implementation of bladyg on top of akka framework. We experimentally evaluate the performance of the proposed framework by applying it to problems such as distributed k-core decomposition and partitioning of large dynamic graphs. The experimental results show that the performance and scalability of bladyg are satisfying for large-scale dynamic graphs. © 2017 Elsevier Inc. All rights reserved.

BLADYG: A Graph Processing Framework for Large Dynamic Graphs / Aridhi, Sabeur; Montresor, Alberto; Velegrakis, Yannis. - In: BIG DATA RESEARCH. - ISSN 2214-5796. - ELETTRONICO. - 9:(2017), pp. 9-17. [10.1016/j.bdr.2017.05.003]

BLADYG: A Graph Processing Framework for Large Dynamic Graphs

Montresor, Alberto;Velegrakis, Yannis
2017-01-01

Abstract

Recently, distributed processing of large dynamic graphs has become very popular, especially in certain domains such as social network analysis, Web graph analysis and spatial network analysis. In this context, many distributed/parallel graph processing systems have been proposed, such as Pregel, PowerGraph, GraphLab, and Trinity. However, these systems deal only with static graphs and do not consider the issue of processing evolving and dynamic graphs. In this paper, we are considering the issues of scale and dynamism in the case of graph processing systems. We present bladyg, a graph processing framework that addresses the issue of dynamism in large-scale graphs. We present an implementation of bladyg on top of akka framework. We experimentally evaluate the performance of the proposed framework by applying it to problems such as distributed k-core decomposition and partitioning of large dynamic graphs. The experimental results show that the performance and scalability of bladyg are satisfying for large-scale dynamic graphs. © 2017 Elsevier Inc. All rights reserved.
2017
Aridhi, Sabeur; Montresor, Alberto; Velegrakis, Yannis
BLADYG: A Graph Processing Framework for Large Dynamic Graphs / Aridhi, Sabeur; Montresor, Alberto; Velegrakis, Yannis. - In: BIG DATA RESEARCH. - ISSN 2214-5796. - ELETTRONICO. - 9:(2017), pp. 9-17. [10.1016/j.bdr.2017.05.003]
File in questo prodotto:
File Dimensione Formato  
1701.00546.pdf

Open Access dal 02/10/2019

Tipologia: Post-print referato (Refereed author’s manuscript)
Licenza: Creative commons
Dimensione 948.16 kB
Formato Adobe PDF
948.16 kB Adobe PDF Visualizza/Apri
BigDataResearch17.pdf

Solo gestori archivio

Tipologia: Versione editoriale (Publisher’s layout)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 1.24 MB
Formato Adobe PDF
1.24 MB Adobe PDF   Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11572/195027
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 25
  • ???jsp.display-item.citation.isi??? 16
social impact