High-Level Programming Abstractions for Distributed Graph Processing

Vasiliki Kalavri

doi:10.1109/TKDE.2017.2762294

Return

High-Level Programming Abstractions for Distributed Graph Processing

2018-02-01

Vasiliki Kalavri *

Vladimir Vlassov

Haridi, Seif

DOI：10.1109/TKDE.2017.2762294

Original

Save

View PDF

Abstract

En 中文

Efficient processing of large-scale graphs in distributed environments has been an increasingly popular topic of research in recent years. Inter-connected data that can be modeled as graphs appear in application domains such as machine learning, recommendation, web search, and social network analysis. Writing distributed graph applications is inherently hard and requires programming models that can cover a diverse set of problems, including iterative refinement algorithms, graph transformations, graph aggregations, pattern matching, ego-network analysis, and graph traversals. Several high-level programming abstractions have been proposed and adopted by distributed graph processing systems and big data platforms. Even though significant work has been done to experimentally compare distributed graph processing frameworks, no qualitative study and comparison of graph programming abstractions has been conducted yet. In this survey, we review and analyze the most prevalent high-level programming models for distributed graph processing, in terms of their semantics and applicability. We review 34 distributed graph processing systems with respect to the graph processing models they implement and we survey applications that appear in recent distributed graph systems papers. Finally, we discuss trends and open research questions in the area of distributed graph processing.

Keywords:

Distributed graph processing

large-scale graph analysis

big data

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.