BACH: Bridging Adjacency List and CSR Format using LSM-Trees for HGTAP Workloads
Summary: BACH introduces a graph-aware LSM-tree that progressively transforms transaction-friendly adjacency lists into analytics-friendly CSR across levels. Elastic merge handles workload and degree skew, while lightweight MVCC enables snapshot-isolated HGTAP with fresh, concurrent access. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Jianfeng Huang (Harbin Engineering University)
- 2. Yihao Cao (Harbin Engineering University)
- 3. Shubing Ren (Harbin Engineering University)
- 4. Baohua Wu (Central South University)
- 5. Dongjing Miao (Harbin Engineering University)
BibTeX Citation
@article{huang_vldb25,
title = {{BACH: Bridging Adjacency List and CSR Format using LSM-Trees for HGTAP Workloads}},
author = {Huang, Jianfeng and Cao, Yihao and Ren, Shubing and Wu, Baohua and Miao, Dongjing},
journal = {PVLDB},
series = {{VLDB} '25},
volume = {18},
number = {5},
pages = {1509--1521},
doi = {10.14778/3718057.3718076},
url = {https://doi.org/10.14778/3718057.3718076},
year = {2025}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,207 | Bw-Graph: An Efficient Graph Storage System Harmonizing Topology-Aware Tree with Paged CSR | 2026 | SIGMOD | 5.093636e-05 |
| 10,252 | GraphRTX: Lighting the Way to Scalable Graph Analytics | 2026 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 15 of 15 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,554 | Workload-Adaptive Filtering in Storage Engines | 2022 | SIGMOD |
| 2 | 6,828 | Breaking Down Memory Walls in LSM-based Storage Systems | 2020 | SIGMOD |
| 3 | 8,811 | ArceKV: Towards Workload-driven LSM-compactions for Key-Value Store Under Dynamic Workloads | 2026 | VLDB |
| 4 | 9,810 | B-Trees Are Back: Engineering Fast and Pageable Node Layouts | 2025 | SIGMOD |
| 5 | 3,357 | Columnar Storage and List-based Processing for Graph Database Management Systems | 2021 | VLDB |
| 6 | 7,597 | Galaxybase: A High Performance Native Distributed Graph Database for HTAP | 2024 | VLDB |
| 7 | 1,238 | BatchDB: Efficient Isolated Execution of Hybrid OLTP+OLAP Workloads for Interactive Applications | 2017 | SIGMOD |
| 8 | 275 | bLSM: A General Purpose Log Structured Merge Tree | 2012 | SIGMOD |
| 9 | 6,456 | LSMGraph: A High-Performance Dynamic Graph Storage System with Multi-Level CSR | 2024 | SIGMOD |
| 10 | 10,207 | Bw-Graph: An Efficient Graph Storage System Harmonizing Topology-Aware Tree with Paged CSR | 2026 | SIGMOD |