Aster: Enhancing LSM-structures for Scalable Graph Database
Fuente:
arXiv
Saved in:
| Main Authors: | Mo, Dingheng, Liu, Junfeng, Wang, Fan, Luo, Siqiang |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Don't Forget Range Delete! Enhancing LSM-based Key-Value Stores with More Compatible Lookups and Deletes
by: Wang, Fan, et al.
Published: (2025)
by: Wang, Fan, et al.
Published: (2025)
How to Grow an LSM-tree? Towards Bridging the Gap Between Theory and Practice
by: Mo, Dingheng, et al.
Published: (2025)
by: Mo, Dingheng, et al.
Published: (2025)
LSM-VEC: A Large-Scale Disk-Based System for Dynamic Vector Search
by: Zhong, Shurui, et al.
Published: (2025)
by: Zhong, Shurui, et al.
Published: (2025)
[Extended Version] ArceKV: Towards Workload-driven LSM-compactions for Key-Value Store Under Dynamic Workloads
by: Liu, Junfeng, et al.
Published: (2025)
by: Liu, Junfeng, et al.
Published: (2025)
Are Joins over LSM-Trees Ready? Take RocksDB as an Example
by: Yu, Weiping, et al.
Published: (2025)
by: Yu, Weiping, et al.
Published: (2025)
Evaluating Learned Indexes in LSM-tree Systems: Benchmarks,Insights and Design Choices
by: Liu, Junfeng, et al.
Published: (2025)
by: Liu, Junfeng, et al.
Published: (2025)
RadixGraph: A Fast, Space-Optimized Data Structure for Dynamic Graph Storage (Extended Version)
by: Xie, Haoxuan, et al.
Published: (2026)
by: Xie, Haoxuan, et al.
Published: (2026)
CAMAL: Optimizing LSM-trees via Active Learning
by: Yu, Weiping, et al.
Published: (2024)
by: Yu, Weiping, et al.
Published: (2024)
On 10x Better Scalability: KV Stores Scale Up KV Cache
by: Yu, Weiping, et al.
Published: (2025)
by: Yu, Weiping, et al.
Published: (2025)
VectorMaton: Efficient Vector Search with Pattern Constraints via an Enhanced Suffix Automaton
by: Xie, Haoxuan, et al.
Published: (2026)
by: Xie, Haoxuan, et al.
Published: (2026)
LSM-OPD: Boosting Scan in LSM-Trees by Enabling Direct Computing on Compressed Data
by: Huang, Jianfeng, et al.
Published: (2025)
by: Huang, Jianfeng, et al.
Published: (2025)
O^3-LSM: Maximizing Disaggregated LSM Write Performance via Three-Layer Offloading
by: Lin, Qi, et al.
Published: (2026)
by: Lin, Qi, et al.
Published: (2026)
Unifews: You Need Fewer Operations for Efficient Graph Neural Networks
by: Liao, Ningyi, et al.
Published: (2024)
by: Liao, Ningyi, et al.
Published: (2024)
vLSM: Low tail latency and I/O amplification in LSM-based KV stores
by: Xanthakis, Giorgos, et al.
Published: (2024)
by: Xanthakis, Giorgos, et al.
Published: (2024)
LSM Trees in Adversarial Environments
by: Tirmazi, Hayder
Published: (2025)
by: Tirmazi, Hayder
Published: (2025)
Rethinking LSM-tree based Key-Value Stores: A Survey
by: Lv, Yina, et al.
Published: (2025)
by: Lv, Yina, et al.
Published: (2025)
Scavenger+: Revisiting Space-Time Tradeoffs in Key-Value Separated LSM-trees
by: Zhang, Jianshun, et al.
Published: (2025)
by: Zhang, Jianshun, et al.
Published: (2025)
Scavenger: Better Space-Time Trade-Offs for Key-Value Separated LSM-trees
by: Zhang, Jianshun, et al.
Published: (2025)
by: Zhang, Jianshun, et al.
Published: (2025)
CUTTANA: Scalable Graph Partitioning for Faster Distributed Graph Databases and Analytics
by: Hajidehi, Milad Rezaei, et al.
Published: (2023)
by: Hajidehi, Milad Rezaei, et al.
Published: (2023)
BVLSM: Write-Efficient LSM-Tree Storage via WAL-Time Key-Value Separation
by: Li, Ming, et al.
Published: (2025)
by: Li, Ming, et al.
Published: (2025)
A survey of LSM-Tree based Indexes, Data Systems and KV-stores
by: Mishra, Supriya
Published: (2024)
by: Mishra, Supriya
Published: (2024)
HotRAP: Hot Record Retention and Promotion for LSM-trees with Tiered Storage
by: Qiu, Jiansheng, et al.
Published: (2024)
by: Qiu, Jiansheng, et al.
Published: (2024)
RESYSTANCE: Unleashing Hidden Performance of Compaction in LSM-trees via eBPF
by: Byun, Hongsu, et al.
Published: (2026)
by: Byun, Hongsu, et al.
Published: (2026)
KV-Tandem -- a Modular Approach to Building High-Speed LSM Storage Engines
by: Bortnikov, Edward, et al.
Published: (2024)
by: Bortnikov, Edward, et al.
Published: (2024)
Crane: An Accurate and Scalable Neural Sketch for Graph Stream Summarization
by: Wang, Boyan, et al.
Published: (2026)
by: Wang, Boyan, et al.
Published: (2026)
Graph Neural Networks for Databases: A Survey
by: Li, Ziming, et al.
Published: (2025)
by: Li, Ziming, et al.
Published: (2025)
What If: Causal Analysis with Graph Databases
by: Pachera, Amedeo, et al.
Published: (2024)
by: Pachera, Amedeo, et al.
Published: (2024)
Graph Neural Networks on Graph Databases
by: Lopushanskyy, Dmytro, et al.
Published: (2024)
by: Lopushanskyy, Dmytro, et al.
Published: (2024)
Logica-TGD: Transforming Graph Databases Logically
by: Skvortsov, Evgeny, et al.
Published: (2025)
by: Skvortsov, Evgeny, et al.
Published: (2025)
Accelerating Regular Path Queries over Graph Database with Processing-in-Memory
by: Ma, Ruoyan, et al.
Published: (2024)
by: Ma, Ruoyan, et al.
Published: (2024)
Algorithm Support for Graph Databases, Done Right
by: de Graaf, Daan, et al.
Published: (2026)
by: de Graaf, Daan, et al.
Published: (2026)
Schema-Based Query Optimisation for Graph Databases
by: Sharma, Chandan, et al.
Published: (2024)
by: Sharma, Chandan, et al.
Published: (2024)
The Context Model: A Graph Database Model
by: Spyratos, Nicolas
Published: (2023)
by: Spyratos, Nicolas
Published: (2023)
AeonG: An Efficient Built-in Temporal Support in Graph Databases
by: Hou, Jiamin, et al.
Published: (2023)
by: Hou, Jiamin, et al.
Published: (2023)
Effective Bug Detection in Graph Database Engines: An LLM-based Approach
by: Wu, Jiayi, et al.
Published: (2024)
by: Wu, Jiayi, et al.
Published: (2024)
HAKES: Scalable Vector Database for Embedding Search Service
by: Hu, Guoyu, et al.
Published: (2025)
by: Hu, Guoyu, et al.
Published: (2025)
Scalability, Availability, Reproducibility and Extensibility in Islamic Database Systems
by: Siddiqui, Umar, et al.
Published: (2025)
by: Siddiqui, Umar, et al.
Published: (2025)
Autumn: A Scalable Read Optimized LSM-tree based Key-Value Stores with Fast Point and Range Read Speed
by: Zhao, Fuheng, et al.
Published: (2023)
by: Zhao, Fuheng, et al.
Published: (2023)
Fast Tuning the Index Construction Parameters of Proximity Graphs in Vector Databases
by: Zhou, Wenyang, et al.
Published: (2026)
by: Zhou, Wenyang, et al.
Published: (2026)
On the Expressiveness of Languages for Querying Property Graphs in Relational Databases
by: Rotschield, Hadar, et al.
Published: (2025)
by: Rotschield, Hadar, et al.
Published: (2025)
Similar Items
-
Don't Forget Range Delete! Enhancing LSM-based Key-Value Stores with More Compatible Lookups and Deletes
by: Wang, Fan, et al.
Published: (2025) -
How to Grow an LSM-tree? Towards Bridging the Gap Between Theory and Practice
by: Mo, Dingheng, et al.
Published: (2025) -
LSM-VEC: A Large-Scale Disk-Based System for Dynamic Vector Search
by: Zhong, Shurui, et al.
Published: (2025) -
[Extended Version] ArceKV: Towards Workload-driven LSM-compactions for Key-Value Store Under Dynamic Workloads
by: Liu, Junfeng, et al.
Published: (2025) -
Are Joins over LSM-Trees Ready? Take RocksDB as an Example
by: Yu, Weiping, et al.
Published: (2025)