DBScholar

Back to papers

Aster: Enhancing LSM-structures for Scalable Graph Database

Summary: Poly-LSM is a graph-oriented LSM-tree with a hybrid storage model for compact, efficient graph data; adaptive I/O handles edge insertions and deletions. Aster implements this as a Gremlin-enabled graph DB, using skew-aware encoding; delivers up to 17x throughput on billion-scale graphs. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
h127eeee6490a52c9
Venue
SIGMOD
Year
2025
Pagerank
5.2270607e-05
Overall Rank
9,064 | 39.08%
DOI
10.1145/3709662
PDF
Download (CC BY 4.0)

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{mo_sigmod25,
        title = {{Aster: Enhancing LSM-structures for Scalable Graph Database}},
        author = {Mo, Dingheng and Liu, Junfeng and Wang, Fan and Luo, Siqiang},
        series = {{SIGMOD} '25},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3709662},
        url = {https://dl.acm.org/doi/10.1145/3709662},
        year = {2025}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 44 of 44 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
71 DuckDB: an Embeddable Analytical Database 2019 SIGMOD 0.00037724477
258 bLSM: A General Purpose Log Structured Merge Tree 2012 SIGMOD 0.00022932099
373 Umbra: A Disk-Based System with In-Memory Performance 2020 CIDR 0.00019705706
400 Monkey: Optimal Navigable Key-Value Store 2017 SIGMOD 0.00019124757
753 Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging 2018 SIGMOD 0.00014232329
817 SlimDB: A Space-Efficient Key-Value Storage Engine For Semi-Sorted Data 2017 VLDB 0.00013685662
1,313 X-Engine: An Optimized Storage Engine for Large-scale E-commerce Transaction Processing 2019 SIGMOD 0.00011055196
1,486 LDBC Graphalytics: A Benchmark for Large-Scale Graph Analysis on Parallel and Distributed Platforms 2016 VLDB 0.00010517584
1,603 Starling: An I/O-Efficient Disk-Resident Graph Index Framework for High-Dimensional Vector Similarity Search on Data Segment 2024 SIGMOD 0.00010100279
1,753 Kuzu* Graph Database Management System 2023 CIDR 9.7244117e-05
1,982 Chucky: A Succinct Cuckoo Filter for LSM-Tree 2021 SIGMOD 9.2570284e-05
2,032 Teseo and the Analysis of Structural Dynamic Graphs 2021 VLDB 9.1549024e-05
2,775 GraphScope: A Unified Engine For Big Graph Processing 2021 VLDB 8.0288982e-05
2,788 Lethe: A Tunable Delete-Aware LSM Engine 2020 SIGMOD 8.0114055e-05
2,868 Spooky: Granulating LSM-Tree Compactions Correctly 2022 VLDB 7.9205462e-05
2,961 Sortledton: a Universal, Transactional Graph Data Structure 2022 VLDB 7.8039167e-05
3,233 TreeLine: An Update-In-Place Key-Value Store for Modern Storage 2023 VLDB 7.5008192e-05
3,643 Nova-LSM: A Distributed, Component-based LSM-tree Key-value Store 2021 SIGMOD 7.1406131e-05
3,937 Testing Graph Database Systems via Graph-Aware Metamorphic Relations 2024 VLDB 6.9130095e-05
4,071 Beyond Macrobenchmarks: Microbenchmark-based Graph Database Evaluation 2019 VLDB 6.8182854e-05
4,501 ByteGraph: A High-Performance Distributed Graph Database in ByteDance 2022 VLDB 6.5715206e-05
4,599 G-Tran: A High Performance Distributed Graph Database with a Decentralized Architecture 2022 VLDB 6.5061447e-05
4,943 A Comparative Study of Secondary Indexing Techniques in LSM-based NoSQL Databases 2018 SIGMOD 6.3423449e-05
5,022 Breaking Down Memory Walls: Adaptive Memory Management in LSM-based Storage Systems 2021 VLDB 6.309271e-05
5,068 Spruce: A Fast yet Space-saving Structure for Dynamic Graph Storage 2024 SIGMOD 6.2872138e-05
5,173 CGgraph: An Ultra-fast Graph Processing System on Modern Commodity CPU-GPU Co-processor 2024 VLDB 6.2410084e-05
5,212 AeonG: An Efficient Built-in Temporal Support in Graph Databases 2024 VLDB 6.222769e-05
5,250 Endure: A Robust Tuning Paradigm for LSM Trees Under Workload Uncertainty 2022 VLDB 6.2092552e-05
5,428 GraphOS: Towards Oblivious Graph Processing 2023 VLDB 6.1329964e-05
5,516 Big Graphs: Challenges and Opportunities 2022 VLDB 6.0957673e-05
6,123 Learning to Optimize LSM-trees: Towards A Reinforcement Learning based Key-Value Store for Dynamic Workloads 2023 SIGMOD 5.8771312e-05
6,622 CAVE: Concurrency-Aware Graph Processing on SSDs 2024 SIGMOD 5.7300723e-05
7,260 An I/O-Efficient Disk-based Graph System for Scalable Second-Order Random Walk of Large Graphs 2022 VLDB 5.5695153e-05
7,526 MiniGraph: Querying Big Graphs with a Single Machine 2023 VLDB 5.4999817e-05
7,909 CAMAL: Optimizing LSM-trees via Active Learning 2024 SIGMOD 5.4266123e-05
8,538 SA-LSM: Optimize Data Layout for LSM-tree Based Storage using Survival Analysis 2022 VLDB 5.3197798e-05
8,817 Incremental Partitioning for Efficient Spatial Data Analytics 2022 VLDB 5.2699112e-05
9,043 ChainKV: A Semantics-Aware Key-Value Store for Ethereum System 2023 SIGMOD 5.2310065e-05
9,191 Structural Designs Meet Optimality: Exploring Optimized LSM-tree Structures in A Colossal Configuration Space 2024 SIGMOD 5.20942e-05
9,306 TED: Towards Discovering Top-k Edge-Diversified Patterns in a Graph Database 2023 SIGMOD 5.1966832e-05
9,720 Banyan: A Scoped Dataflow Engine for Graph Query Service 2022 VLDB 5.1334824e-05
10,308 Worst-Case-Optimal Similarity Joins on Graph Databases 2024 SIGMOD 5.0377711e-05
10,309 VisualNeo: Bridging the Gap between Visual Query Interfaces and Graph Query Engines 2023 VLDB 5.0377711e-05
10,310 VINCENT: Towards Efficient Exploratory Subgraph Search in Graph Databases 2022 VLDB 5.0377711e-05
Previous Page 1 / 1 Next

Semantically Similar Papers