Title: DynamoGraph: extending the Pregel paradigm for large-scale temporal graph processing

Authors: Matthias Steinbauer; Gabriele Anderst-Kotsis

Addresses: Institute of Telecooperation, Johannes Kepler University Linz, Linz, Austria ' Institute of Telecooperation, Johannes Kepler University Linz, Linz, Austria

Abstract: Large-scale temporal graphs can serve as a model in many application scenarios. Owing to the popularity of online social networks and increased research interest in gathering and analysing data about human behaviour and interaction (reality mining) temporal graphs gain attraction in social network analysis and more specifically in the analysis of dynamic processes in social networks. Originally developed for web-graph analysis, systems supporting a Pregel-style processing paradigm can be used to process large-scale social network data. However, current methods for social network analysis require data to be processed off-line, or lack support for temporal graphs, or support datasets of limited size only. In this work we present a cloud-based distributed processing framework extending the Pregel paradigm for large-scale temporal graphs. By using computing resources in the cloud this system is scalable and prepared to scale for the massive datasets that occur in social network analysis.

Keywords: distributed graphs; temporal graphs; social network analysis; SNA; big data; online social networks; Pregel paradigm; temporal graph processing; dynamic processes; cloud computing.

DOI: 10.1504/IJGUC.2016.077491

International Journal of Grid and Utility Computing, 2016 Vol.7 No.2, pp.141 - 151

Received: 31 Oct 2014
Accepted: 02 Feb 2015
Published online: 04 Jul 2016 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article