Bridging the Gap between Relational OLTP and Graph-based OLAP
Sijie Shen, Zihang Yao, Lin Shi, Lei Wang, Longbin Lai, Qian Tao, Li Su, Rong Chen, Wenyuan Yu, Haibo Chen, Binyu Zang, Jingren Zhou
Abstract
Recently, many applications have required the ability to perform dynamic graph analytical processing (GAP) tasks on the datasets generated by relational OLTP in real time. To meet the two key requirements of performance and freshness, this paper presents GART, an in-memory system that extends hybrid transactional/analytical processing (HTAP) systems to support GAP, resulting in hybrid transactional and graph analytical processing (HTGAP). GART fulfills two unique goals that are not encountered by HTAP systems. First, to adapt to rich workloads flexibility, GART proposes transparent data model conversion by graph extraction interfaces, which define rules for relational-graph mapping. Second, to ensure GAP performance, GART proposes an efficient dynamic graph storage with good locality that stems from key insights into HTGAP workloads, including (1) an efficient and mutable compressed sparse row (CSR) representation to guarantee the locality of edge scan, (2) a coarsegrained multi-version concurrency control (MVCC) scheme to reduce the temporal and spatial overhead of versioning, and (3) a flexible property storage to efficiently run different GAP workloads. Evaluations show that GART performs several orders of magnitude better than existing solutions in terms of freshness or performance. Meanwhile, for GAP workloads on the LDBC SNB dataset, GART outperforms the state-of-the-art general-purpose dynamic graph storage (i.e., LiveGraph) by up to 4.4×. PERSON 30 70.0 807 20.0 ...
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext d4fdedf9-ba66-4e7b-952f-39e921576c2fCited by top-tier papers8
- LSMGraph: A High-Performance Dynamic Graph Storage System with Multi-Level CSRSong Yu, Shufeng Gong, Qian Tao, Sijie Shen et al.SIGMOD 2025 · 25 citations
- Towards a Converged Relational-Graph Optimization FrameworkYunkai Lou, Longbin Lai, Bingqing Lyu, Yufan Yang et al.SIGMOD 2025 · 4 citations
- GTX: A Write-Optimized Latch-free Graph Data System with Transactional SupportLibin Zhou, Lu Xing, Yeasir Rayhan, Walid G. ArefSIGMOD 2025 · 3 citations
- BACH: Bridging Adjacency List and CSR Format using LSM-Trees for HGTAP WorkloadsJianfeng Huang, Cao Yihao, Ren Shubing, Baohua Wu et al.VLDB 2025 · 3 citations
- RapidStore: An Efficient Dynamic Graph Storage System for Concurrent QueriesChiyu Hao, Jixian Su, Shixuan Sun, Hao Zhang et al.VLDB 2025 · 2 citations
Builds on12
- Learning to Hash with Graph Neural Networks for Recommender SystemsQiaoyu Tan, Ninghao Liu, Xing Zhao, Hongxia Yang et al.WWW 2020 · 106 citations
- GNNLab: a factored system for sample-based GNN training over GPUsJianbang Yang, Dahai Tang, Xiaoniu Song, Lei Wang et al.EuroSys 2022 · 105 citations
- FlexGraph: a flexible and efficient distributed framework for GNN trainingLei Wang, Qiang Yin, Chao Tian, Jianbang Yang et al.EuroSys 2021 · 66 citations
- Teseo and the Analysis of Structural Dynamic GraphsDean De Leo, Peter BonczVLDB 2021 · 65 citations
- GraphWalker: An I/O-Efficient and Resource-Friendly Graph Analytic System for Fast and Scalable Random WalksRui Wang, Yongkun Li, Hong Xie, Yinlong Xu et al.USENIX ATC 2020 · 64 citations
Related papers
- Retrofitting High Availability Mechanism to Tame Hybrid Transaction/Analytical ProcessingSijie Shen, Rong Chen, Haibo Chen, Binyu ZangOSDI 2021 · 20 citations
- Rethink Query Optimization in HTAP DatabasesHaoze Song, Wenchao Zhou, Feifei Li, Xiang Peng et al.SIGMOD 2024 · 7 citations
- Scalable Garbage Collection for In-Memory MVCC SystemsJan Böttcher, Viktor Leis, Thomas Neumann, Alfons KemperVLDB 2020 · 50 citations
- PUSHtap: PIM-based In-Memory HTAP with Unified Data Storage FormatYilong Zhao, Mingyu Gao, Huanchen Zhang, Fangxin Liu et al.ASPLOS 2025 · 4 citations
- LiveGraph: A Transactional Graph Storage System with Purely Sequential Adjacency List ScansXiaowei Zhu, Marco Serafini, Xiaosong Ma, Ashraf Aboulnaga et al.VLDB 2020 · 53 citations
