Practice of Streaming Processing of Dynamic Graphs: Concepts, Models, and Systems
Maciej Besta, Marc Fischer, Vasiliki Kalavri, Michael Kapralov,, Torsten Hoefler

TL;DR
This paper provides a comprehensive analysis and taxonomy of dynamic and streaming graph processing systems, clarifying concepts, models, and system architectures to advance understanding and development in this rapidly evolving field.
Contribution
It offers the first detailed taxonomy of streaming graph processing systems, analyzing their architectures, concurrency support, and workloads, and bridges practical systems with theoretical models.
Findings
Identifies key system design patterns for streaming graph processing
Clarifies distinctions among dynamic, temporal, and online graphs
Highlights research challenges and future directions
Abstract
Graph processing has become an important part of various areas of computing, including machine learning, medical applications, social network analysis, computational sciences, and others. A growing amount of the associated graph processing workloads are dynamic, with millions of edges added or removed per second. Graph streaming frameworks are specifically crafted to enable the processing of such highly dynamic workloads. Recent years have seen the development of many such frameworks. However, they differ in their general architectures (with key details such as the support for the concurrent execution of graph updates and queries, or the incorporated graph data organization), the types of updates and workloads allowed, and many others. To facilitate the understanding of this growing field, we provide the first analysis and taxonomy of dynamic and streaming graph processing. We focus on…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
