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
-
Threaded block-parallel algorithm for finding the shortest paths on graph
by: O. N. Karasik, et al.
Published: (2019-06-01) -
Spatio-temporal graph data storage and calculation based on grid graph database
by: Bing Han, et al.
Published: (2025-08-01) -
Verification of systems with behavior parallelism on the basis of the graph of reachable states
by: Yu. V. Pottosin, et al.
Published: (2019-06-01) -
The Analysis of Complex Networks with Dynamic Graph Visualization
by: S. N. Pupyrev, et al.
Published: (2010-03-01) -
Recursive-Parallel Algorithm for Solving the Graph-Subgraph Isomorphism Problem
by: Vladimir V. Vasilchikov
Published: (2022-03-01)