2016 · 11 citations · 10 references
ComputingComputer ScienceAlgorithmsDistributed SystemsParallel AlgorithmsData PartitioningDistributed AlgorithmsDistributed ComputingGraph AlgorithmsGraph AnalyticsGraph TheoryDistributed Data PartitioningDistributed Graph ProcessingDynamic Graph AlgorithmsDynamic Graph AnalysisGraph DecompositionsGraph PartitioningSpatial Networks
Distributed graph processing has become a very popular research topic recently, particularly in domains such as the analysis of social networks, web graphs and spatial networks. In this context, graph partitioning is an important task. Several partitioning algorithms have been proposed, such as DFEP, JABEJA and POWERGRAPH, but they are limited to static graphs only. In fact, they do not consider dynamic 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 implementation 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.
10
Grzegorz Malewicz, Matthew H. Austern, Aart J. C. Bik et al. · 2010 · 3.5K citations
{SNAP Datasets}: {Stanford} Large Network Dataset Collection
Jure Leskovec, Andrej Krevl · 2014 · 2.8K citations
Yucheng Low, Danny Bickson, Joseph E. Gonzalez et al. · Proceedings of the VLDB Endowment · 2012 · 1.7K citations
PowerGraph: distributed graph-parallel computation on natural graphs
Joseph E. Gonzalez, Yucheng Low, Haijie Gu et al. · 2012 · 1.5K citations