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
7073
Venue
SIGMOD
Year
2025
Pagerank
5.3495662e-05
Overall Rank
8,896 | 38.97%
DOI
10.1145/3709662

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
103 DuckDB: an Embeddable Analytical Database 2019 SIGMOD 0.00034161428
275 bLSM: A General Purpose Log Structured Merge Tree 2012 SIGMOD 0.00022630189
422 Umbra: A Disk-Based System with In-Memory Performance 2020 CIDR 0.00018732744
446 Monkey: Optimal Navigable Key-Value Store 2017 SIGMOD 0.00018332392
831 Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging 2018 SIGMOD 0.00013748512
857 SlimDB: A Space-Efficient Key-Value Storage Engine For Semi-Sorted Data 2017 VLDB 0.00013568886
1,347 X-Engine: An Optimized Storage Engine for Large-scale E-commerce Transaction Processing 2019 SIGMOD 0.00011073571
1,563 LDBC Graphalytics: A Benchmark for Large-Scale Graph Analysis on Parallel and Distributed Platforms 2016 VLDB 0.00010352314
1,760 Starling: An I/O-Efficient Disk-Resident Graph Index Framework for High-Dimensional Vector Similarity Search on Data Segment 2024 SIGMOD 9.8157819e-05
1,954 Chucky: A Succinct Cuckoo Filter for LSM-Tree 2021 SIGMOD 9.4208165e-05
2,126 Kuzu* Graph Database Management System 2023 CIDR 9.1329991e-05
2,141 Teseo and the Analysis of Structural Dynamic Graphs 2021 VLDB 9.0978534e-05
2,755 Lethe: A Tunable Delete-Aware LSM Engine 2020 SIGMOD 8.163097e-05
2,915 GraphScope: A Unified Engine For Big Graph Processing 2021 VLDB 7.9666977e-05
3,027 Sortledton: a Universal, Transactional Graph Data Structure 2022 VLDB 7.8374092e-05
3,054 Spooky: Granulating LSM-Tree Compactions Correctly 2022 VLDB 7.8090808e-05
3,535 TreeLine: An Update-In-Place Key-Value Store for Modern Storage 2023 VLDB 7.3333933e-05
3,758 Nova-LSM: A Distributed, Component-based LSM-tree Key-value Store 2021 SIGMOD 7.1471346e-05
4,025 Beyond Macrobenchmarks: Microbenchmark-based Graph Database Evaluation 2019 VLDB 6.947875e-05
4,129 Testing Graph Database Systems via Graph-Aware Metamorphic Relations 2024 VLDB 6.8840169e-05
4,519 G-Tran: A High Performance Distributed Graph Database with a Decentralized Architecture 2022 VLDB 6.6472999e-05
4,544 ByteGraph: A High-Performance Distributed Graph Database in ByteDance 2022 VLDB 6.6382612e-05
4,946 Spruce: A Fast yet Space-saving Structure for Dynamic Graph Storage 2024 SIGMOD 6.4319457e-05
5,012 A Comparative Study of Secondary Indexing Techniques in LSM-based NoSQL Databases 2018 SIGMOD 6.4015289e-05
5,075 CGgraph: An Ultra-fast Graph Processing System on Modern Commodity CPU-GPU Co-processor 2024 VLDB 6.3740128e-05
5,226 Breaking Down Memory Walls: Adaptive Memory Management in LSM-based Storage Systems 2021 VLDB 6.3090383e-05
5,299 GraphOS: Towards Oblivious Graph Processing 2023 VLDB 6.2767341e-05
5,608 Big Graphs: Challenges and Opportunities 2022 VLDB 6.1514145e-05
5,766 Endure: A Robust Tuning Paradigm for LSM Trees Under Workload Uncertainty 2022 VLDB 6.094771e-05
6,490 CAVE: Concurrency-Aware Graph Processing on SSDs 2024 SIGMOD 5.8643667e-05
6,843 Learning to Optimize LSM-trees: Towards A Reinforcement Learning based Key-Value Store for Dynamic Workloads 2023 SIGMOD 5.7573899e-05
7,201 An I/O-Efficient Disk-based Graph System for Scalable Second-Order Random Walk of Large Graphs 2022 VLDB 5.6755554e-05
7,380 MiniGraph: Querying Big Graphs with a Single Machine 2023 VLDB 5.6288836e-05
7,757 CAMAL: Optimizing LSM-trees via Active Learning 2024 SIGMOD 5.5508469e-05
7,897 AeonG: An Efficient Built-in Temporal Support in Graph Databases 2024 VLDB 5.5196714e-05
8,360 SA-LSM: Optimize Data Layout for LSM-tree Based Storage using Survival Analysis 2022 VLDB 5.4444442e-05
8,644 Incremental Partitioning for Efficient Spatial Data Analytics 2022 VLDB 5.3934068e-05
8,875 ChainKV: A Semantics-Aware Key-Value Store for Ethereum System 2023 SIGMOD 5.3536045e-05
9,021 Structural Designs Meet Optimality: Exploring Optimized LSM-tree Structures in A Colossal Configuration Space 2024 SIGMOD 5.3305499e-05
9,131 TED: Towards Discovering Top-k Edge-Diversified Patterns in a Graph Database 2023 SIGMOD 5.3184767e-05
9,532 Banyan: A Scoped Dataflow Engine for Graph Query Service 2022 VLDB 5.2537948e-05
10,087 Worst-Case-Optimal Similarity Joins on Graph Databases 2024 SIGMOD 5.1558402e-05
10,088 VisualNeo: Bridging the Gap between Visual Query Interfaces and Graph Query Engines 2023 VLDB 5.1558402e-05
10,089 VINCENT: Towards Efficient Exploratory Subgraph Search in Graph Databases 2022 VLDB 5.1558402e-05
Previous Page 1 / 1 Next

Semantically Similar Papers