DynamicDFEP: A Distributed edge partitioning approach for large dynamic graphs

Chayma Sakouhi, Sabeur Aridhi, Alessio Guerrieri, Salma Sassi, Alberto Montresor

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussaConference contributionScientificvertaisarvioitu

3 Sitaatiot (Scopus)

Abstrakti

Distributed graph processing has become a very popular re-search topic recently, particularly in domains such as the analysis of social networks, web graphs and spatial net-works. In this context, graph partitioning is an important task. Several partitioning algorithms have been proposed, such as dfep, jabeja and powergraph, but they are lim-ited to static graphs only. In fact, they do not consider dy-namic graphs in which vertices and edges are added and/or removed. In this paper, we propose a graph partitioning method for large dynamic graphs. We present an imple-mentation of the proposed approach on top of the akka framework, and we experimentally show that our approach is efficient in the case of large dynamic graphs.

AlkuperäiskieliEnglanti
OtsikkoProceedings of the 20th International Database Engineering and Applications Symposium, IDEAS 2016
KustantajaACM
Sivut142-147
Sivumäärä6
Vuosikerta11-13-July-2016
ISBN (elektroninen)9781450341189
DOI - pysyväislinkit
TilaJulkaistu - 11 heinäkuuta 2016
OKM-julkaisutyyppiA4 Artikkeli konferenssijulkaisuussa
TapahtumaInternational Database Engineering and Applications Symposium - Montreal, Kanada
Kesto: 11 heinäkuuta 201613 heinäkuuta 2016
Konferenssinumero: 20

Conference

ConferenceInternational Database Engineering and Applications Symposium
LyhennettäIDEAS
MaaKanada
KaupunkiMontreal
Ajanjakso11/07/201613/07/2016

Siteeraa tätä