Database Paper Browser

Back to papers

BACH: Bridging Adjacency List and CSR Format using LSM-Trees for HGTAP Workloads

Summary: Extends LSM‑trees to store different graph layouts at different levels, transforming TP‑friendly adjacency lists into AP‑friendly CSR during compaction to support real‑time HGTAP access. Adds elastic‑merge compaction and lightweight multi‑version snapshot isolation (GR‑LSM‑Tree) to boost freshness and throughput on disk‑based dynamic graph workloads. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
13815
Venue
VLDB
Year
2025
Pagerank
4.1945683e-05
Overall Rank
10,558 | 26.55%
DOI
10.14778/3718057.3718076

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
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