vLSM: Low tail latency and I/O amplification in LSM-based KV stores
Fuente:
arXiv
Saved in:
| Main Authors: | Xanthakis, Giorgos, Katsarakis, Antonios, Saloustros, Giorgos, Bilas, Angelos |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
A survey of LSM-Tree based Indexes, Data Systems and KV-stores
by: Mishra, Supriya
Published: (2024)
by: Mishra, Supriya
Published: (2024)
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)
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)
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)
LSM Trees in Adversarial Environments
by: Tirmazi, Hayder
Published: (2025)
by: Tirmazi, Hayder
Published: (2025)
LearnedKV: Integrating LSM and Learned Index for Superior Performance on Storage
by: Wang, Wenlong, et al.
Published: (2024)
by: Wang, Wenlong, et al.
Published: (2024)
DumpKV: Learning based lifetime aware garbage collection for key value separation in LSM-tree
by: Zhuang, Zhutao, et al.
Published: (2024)
by: Zhuang, Zhutao, et al.
Published: (2024)
Rethinking LSM-tree based Key-Value Stores: A Survey
by: Lv, Yina, et al.
Published: (2025)
by: Lv, Yina, et al.
Published: (2025)
Aster: Enhancing LSM-structures for Scalable Graph Database
by: Mo, Dingheng, et al.
Published: (2025)
by: Mo, Dingheng, et al.
Published: (2025)
DLHT: A Non-blocking Resizable Hashtable with Fast Deletes and Memory-awareness
by: Katsarakis, Antonios, et al.
Published: (2024)
by: Katsarakis, Antonios, et al.
Published: (2024)
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)
[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)
CAMAL: Optimizing LSM-trees via Active Learning
by: Yu, Weiping, et al.
Published: (2024)
by: Yu, Weiping, et al.
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)
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)
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)
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)
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)
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)
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)
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)
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)
ELMo-Tune-V2: LLM-Assisted Full-Cycle Auto-Tuning to Optimize LSM-Based Key-Value Stores
by: Thakkar, Viraj, et al.
Published: (2025)
by: Thakkar, Viraj, 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)
LSM and CPT
by: Seiberg, Nathan, et al.
Published: (2025)
by: Seiberg, Nathan, et al.
Published: (2025)
Guardian: Safe GPU Sharing in Multi-Tenant Environments
by: Pavlidakis, Manos, et al.
Published: (2024)
by: Pavlidakis, Manos, et al.
Published: (2024)
LSM I: Library Skills Module for English 131.
by: Wright, Nancy Kirkpatrick
Published: (1981)
by: Wright, Nancy Kirkpatrick
Published: (1981)
PETLP: A Privacy-by-Design Pipeline for Social Media Data in AI Research
by: Oh, Nick, et al.
Published: (2025)
by: Oh, Nick, et al.
Published: (2025)
On 10x Better Scalability: KV Stores Scale Up KV Cache
by: Yu, Weiping, et al.
Published: (2025)
by: Yu, Weiping, et al.
Published: (2025)
Dynamic read & write optimization with TurtleKV
by: Astolfi, Tony, et al.
Published: (2025)
by: Astolfi, Tony, et al.
Published: (2025)
Mycelium: A Transformation-Embedded LSM-Tree
by: Casaletto, Holly, et al.
Published: (2025)
by: Casaletto, Holly, et al.
Published: (2025)
A harmonized and interoperable format for storing and processing polysomnography data
by: Huttunen, Riku, et al.
Published: (2024)
by: Huttunen, Riku, et al.
Published: (2024)
LSM II: Library Skills Module for English 132.
by: Wright, Nancy Kirkpatrick
Published: (1981)
by: Wright, Nancy Kirkpatrick
Published: (1981)
FIER: Fine-Grained and Efficient KV Cache Retrieval for Long-context LLM Inference
by: Wang, Dongwei, et al.
Published: (2025)
by: Wang, Dongwei, et al.
Published: (2025)
FOCUS: Boosting Schema-aware Access for KV Stores via Hierarchical Data Management
by: Liu, Zhen, et al.
Published: (2025)
by: Liu, Zhen, et al.
Published: (2025)
ParisKV: Fast and Drift-Robust KV-Cache Retrieval for Long-Context LLMs
by: Qi, Yanlin, et al.
Published: (2026)
by: Qi, Yanlin, et al.
Published: (2026)
KVzip: Query-Agnostic KV Cache Compression with Context Reconstruction
by: Kim, Jang-Hyun, et al.
Published: (2025)
by: Kim, Jang-Hyun, et al.
Published: (2025)
Adaptive KV-Cache Compression without Manually Setting Budget
by: Tang, Chenxia, et al.
Published: (2025)
by: Tang, Chenxia, et al.
Published: (2025)
(SPT-)LSM theorems from projective non-invertible symmetries
by: Pace, Salvatore D., et al.
Published: (2024)
by: Pace, Salvatore D., et al.
Published: (2024)
Parity anomaly from LSM: exact valley symmetries on the lattice
by: Pace, Salvatore D., et al.
Published: (2025)
by: Pace, Salvatore D., et al.
Published: (2025)
Similar Items
-
A survey of LSM-Tree based Indexes, Data Systems and KV-stores
by: Mishra, Supriya
Published: (2024) -
O^3-LSM: Maximizing Disaggregated LSM Write Performance via Three-Layer Offloading
by: Lin, Qi, 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) -
KV-Tandem -- a Modular Approach to Building High-Speed LSM Storage Engines
by: Bortnikov, Edward, et al.
Published: (2024) -
LSM Trees in Adversarial Environments
by: Tirmazi, Hayder
Published: (2025)