SMDG: Enhancing In-Memory Dynamic Graph Processing With Storage-Class Memory

View at publisher Summarise with VIRAT
Authors: Tongfeng Weng, Mo Sha, Xu Zhou, Jingjing Lu, Wentao Huang, Keqin Li, Kian‐Lee Tan
Cited by: 0
References: 63

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

In-memory dynamic graph processing faces three critical challenges: limited DRAM capacity, inefficient concurrent update/query handling, and vulnerability to crashes. Traditional segment-level systems struggle with write amplification on emerging Storage-Class Memory (SCM), while existing persistent-memory systems suffer from coarse-grained synchronization and high recovery overhead. This study presents the Storage-Class Memory Dynamic Graph (SMDG) processing framework, an architecture-level redesign centered on the block as the atomic unit across storage, concurrency, and recovery. The system addresses these challenges through three key innovations. First, a block-granular storage design organizes adjacency data at fixed-size block granularity on heterogeneous DRAM-SCM architecture, employing buffered batched writes to significantly reduce write amplification while preserving logarithmic update complexity. Second, block-level multi-version concurrency control maintains timestamped block versions under per-vertex read-write synchronization to provide task-ordered snapshot visibility for concurrent queries without copying entire vertices or pages. Third, a block-granular crash recovery protocol with decentralized per-vertex logs enables independent parallel reconstruction, ensuring application-level semantic consistency while achieving substantially faster recovery than sequential approaches. Experimental results validate that this unified block-granular design improves update efficiency, sustains mixed update-query workloads with controlled memory overhead, and accelerates crash recovery compared with prior dynamic graph systems.

Fields of Study & Subjects

Advanced Database Systems and Queries Graph Theory and Algorithms Advanced Data Storage Technologies

Publication details

Journal / source
IEEE Transactions on Knowledge and Data Engineering
Volume
38
Issue
6
Pages
3895–3911
Publication date
23 March 2026
Language
EN