ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Scalable Graph Processing Frameworks: A Taxonomy and Open Challenges

Heidari, Safiollah and Simmhan, Yogesh and Calheiros, Rodrigo N and Buyya, Rajkumar (2018) Scalable Graph Processing Frameworks: A Taxonomy and Open Challenges. In: ACM COMPUTING SURVEYS, 51 (3).

[img] PDF
ACM_Com_Sur_51-3_60_2018.pdf - Published Version
Restricted to Registered users only

Download (2MB) | Request a copy
Official URL: https://dx.doi.org/10.1145/3199523


The world is becoming a more conjunct place and the number of data sources such as social networks, online transactions, web search engines, and mobile devices is increasing even more than had been predicted. A large percentage of this growing dataset exists in the form of linked data, more generally, graphs, and of unprecedented sizes. While today's data from social networks contain hundreds of millions of nodes connected by billions of edges, inter-connected data from globally distributed sensors that forms the Internet of Things can cause this to grow exponentially larger. Although analyzing these large graphs is critical for the companies and governments that own them, big data tools designed for text and tuple analysis such as MapReduce cannot process them efficiently. So, graph distributed processing abstractions and systems are developed to design iterative graph algorithms and process large graphs with better performance and scalability. These graph frameworks propose novel methods or extend previous methods for processing graph data. In this article, we propose a taxonomy of graph processing systems and map existing systems to this classification. This captures the diversity in programming and computation models, runtime aspects of partitioning and communication, both for in-memory and distributed frameworks. Our effort helps to highlight key distinctions in architectural approaches, and identifies gaps for future research in scalable graph systems.

Item Type: Journal Article
Additional Information: Copyright of this article belong to ASSOC COMPUTING MACHINERY, 2 PENN PLAZA, STE 701, NEW YORK, NY 10121-0701 USA
Department/Centre: Division of Interdisciplinary Research > Supercomputer Education & Research Centre
Depositing User: Id for Latest eprints
Date Deposited: 09 Aug 2018 16:18
Last Modified: 09 Aug 2018 16:18
URI: http://eprints.iisc.ac.in/id/eprint/60395

Actions (login required)

View Item View Item