DynamicDFEP: A Distributed edge partitioning approach for large dynamic graphs

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

3 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of the 20th International Database Engineering and Applications Symposium, IDEAS 2016
PublisherACM
Pages142-147
Number of pages6
Volume11-13-July-2016
ISBN (Electronic)9781450341189
DOIs
Publication statusPublished - 11 Jul 2016
MoE publication typeA4 Article in a conference publication
EventInternational Database Engineering and Applications Symposium - Montreal, Canada
Duration: 11 Jul 201613 Jul 2016
Conference number: 20

Conference

ConferenceInternational Database Engineering and Applications Symposium
Abbreviated titleIDEAS
CountryCanada
CityMontreal
Period11/07/201613/07/2016

Cite this