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.2097768e-05
Overall Rank
9,084 | 39.11%
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.00037688945
261 bLSM: A General Purpose Log Structured Merge Tree 2012 SIGMOD 0.00022862412
375 Umbra: A Disk-Based System with In-Memory Performance 2020 CIDR 0.00019660459
402 Monkey: Optimal Navigable Key-Value Store 2017 SIGMOD 0.00019070605
761 Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging 2018 SIGMOD 0.00014191047
814 SlimDB: A Space-Efficient Key-Value Storage Engine For Semi-Sorted Data 2017 VLDB 0.00013697533
1,324 X-Engine: An Optimized Storage Engine for Large-scale E-commerce Transaction Processing 2019 SIGMOD 0.00011019001
1,487 LDBC Graphalytics: A Benchmark for Large-Scale Graph Analysis on Parallel and Distributed Platforms 2016 VLDB 0.00010496006
1,610 Starling: An I/O-Efficient Disk-Resident Graph Index Framework for High-Dimensional Vector Similarity Search on Data Segment 2024 SIGMOD 0.00010066881
1,764 Kuzu* Graph Database Management System 2023 CIDR 9.6923285e-05
1,991 Chucky: A Succinct Cuckoo Filter for LSM-Tree 2021 SIGMOD 9.2264312e-05
2,044 Teseo and the Analysis of Structural Dynamic Graphs 2021 VLDB 9.1246306e-05
2,594 GraphScope: A Unified Engine For Big Graph Processing 2021 VLDB 8.2278437e-05
2,796 Lethe: A Tunable Delete-Aware LSM Engine 2020 SIGMOD 7.9849253e-05
2,882 Spooky: Granulating LSM-Tree Compactions Correctly 2022 VLDB 7.894356e-05
2,977 Sortledton: a Universal, Transactional Graph Data Structure 2022 VLDB 7.7781129e-05
3,249 TreeLine: An Update-In-Place Key-Value Store for Modern Storage 2023 VLDB 7.4761584e-05
3,650 Nova-LSM: A Distributed, Component-based LSM-tree Key-value Store 2021 SIGMOD 7.1170026e-05
3,940 Testing Graph Database Systems via Graph-Aware Metamorphic Relations 2024 VLDB 6.8942302e-05
4,086 Beyond Macrobenchmarks: Microbenchmark-based Graph Database Evaluation 2019 VLDB 6.7974939e-05
4,520 ByteGraph: A High-Performance Distributed Graph Database in ByteDance 2022 VLDB 6.549791e-05
4,617 G-Tran: A High Performance Distributed Graph Database with a Decentralized Architecture 2022 VLDB 6.4848168e-05
4,970 A Comparative Study of Secondary Indexing Techniques in LSM-based NoSQL Databases 2018 SIGMOD 6.3213732e-05
5,046 Breaking Down Memory Walls: Adaptive Memory Management in LSM-based Storage Systems 2021 VLDB 6.2884087e-05
5,087 Spruce: A Fast yet Space-saving Structure for Dynamic Graph Storage 2024 SIGMOD 6.2664244e-05
5,193 CGgraph: An Ultra-fast Graph Processing System on Modern Commodity CPU-GPU Co-processor 2024 VLDB 6.2203717e-05
5,238 AeonG: An Efficient Built-in Temporal Support in Graph Databases 2024 VLDB 6.2021926e-05
5,272 Endure: A Robust Tuning Paradigm for LSM Trees Under Workload Uncertainty 2022 VLDB 6.1887235e-05
5,444 GraphOS: Towards Oblivious Graph Processing 2023 VLDB 6.1127169e-05
5,496 Big Graphs: Challenges and Opportunities 2022 VLDB 6.0944008e-05
6,137 Learning to Optimize LSM-trees: Towards A Reinforcement Learning based Key-Value Store for Dynamic Workloads 2023 SIGMOD 5.8576977e-05
6,632 CAVE: Concurrency-Aware Graph Processing on SSDs 2024 SIGMOD 5.7111251e-05
7,279 An I/O-Efficient Disk-based Graph System for Scalable Second-Order Random Walk of Large Graphs 2022 VLDB 5.551099e-05
7,543 MiniGraph: Querying Big Graphs with a Single Machine 2023 VLDB 5.4817954e-05
7,925 CAMAL: Optimizing LSM-trees via Active Learning 2024 SIGMOD 5.4086685e-05
8,555 SA-LSM: Optimize Data Layout for LSM-tree Based Storage using Survival Analysis 2022 VLDB 5.3021893e-05
8,834 Incremental Partitioning for Efficient Spatial Data Analytics 2022 VLDB 5.2524856e-05
9,064 ChainKV: A Semantics-Aware Key-Value Store for Ethereum System 2023 SIGMOD 5.2137096e-05
9,215 Structural Designs Meet Optimality: Exploring Optimized LSM-tree Structures in A Colossal Configuration Space 2024 SIGMOD 5.1921944e-05
9,334 TED: Towards Discovering Top-k Edge-Diversified Patterns in a Graph Database 2023 SIGMOD 5.1794997e-05
9,750 Banyan: A Scoped Dataflow Engine for Graph Query Service 2022 VLDB 5.1165079e-05
10,336 Worst-Case-Optimal Similarity Joins on Graph Databases 2024 SIGMOD 5.0211131e-05
10,337 VisualNeo: Bridging the Gap between Visual Query Interfaces and Graph Query Engines 2023 VLDB 5.0211131e-05
10,338 VINCENT: Towards Efficient Exploratory Subgraph Search in Graph Databases 2022 VLDB 5.0211131e-05
Previous Page 1 / 1 Next

Semantically Similar Papers