The Current Landscape of Scalable Dynamic Graph Processing
With the rapid growth in data volume, workloads from various domains have undergone drastic changes in recent years. Today, streaming workloads are commonplace. This generates the need for systems and algorithms that can receive and process streams of data with high throughput. Various graph applica...
Saved in:
| Main Authors: | Gabriel G. Dos Santos, Cesar A. F. de Rose, Kartik Lakhotia |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2025-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/11119499/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Recent Advances in Efficient Dynamic Graph Processing
by: Zi Chen, et al.
Published: (2025-05-01) -
Threaded block-parallel algorithm for finding the shortest paths on graph
by: O. N. Karasik, et al.
Published: (2019-06-01) -
Computability of Generalized Graphs
by: Zvonko Iljazović, et al.
Published: (2024-11-01) -
Domain-Specific Languages for Algorithmic Graph Processing: A Systematic Literature Review
by: Houda Boukham, et al.
Published: (2025-07-01) -
DGAT: a dynamic graph attention neural network framework for EEG emotion recognition
by: Shihang Ding, et al.
Published: (2025-07-01)