Cover Image

Don't Forget Range Delete! Enhancing LSM-based Key-Value Stores with More Compatible Lookups and Deletes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Wang, Fan, Mo, Dingheng, Luo, Siqiang
Format:	Preprint
Published:	2025
Subjects:	Databases
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Aster: Enhancing LSM-structures for Scalable Graph Database
by: Mo, Dingheng, 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)

Rethinking LSM-tree based Key-Value Stores: A Survey
by: Lv, Yina, et al.
Published: (2025)

Are Joins over LSM-Trees Ready? Take RocksDB as an Example
by: Yu, Weiping, 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)

Forgetting by Pruning: Data Deletion in Join Cardinality Estimation
by: He, Chaowei, et al.
Published: (2025)

CAMAL: Optimizing LSM-trees via Active Learning
by: Yu, Weiping, et al.
Published: (2024)

ELMo-Tune-V2: LLM-Assisted Full-Cycle Auto-Tuning to Optimize LSM-Based Key-Value Stores
by: Thakkar, Viraj, et al.
Published: (2025)

Avoiding Thread Stalls and Switches in Key-Value Stores: New Latch-Free Techniques and More
by: Lomet, David, et al.
Published: (2026)

Scavenger+: Revisiting Space-Time Tradeoffs in Key-Value Separated LSM-trees
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)

On 10x Better Scalability: KV Stores Scale Up KV Cache
by: Yu, Weiping, et al.
Published: (2025)

TEE-based Key-Value Stores: a Survey
by: Messaoud, Aghiles Ait, et al.
Published: (2025)

Evaluating Learned Indexes in LSM-tree Systems: Benchmarks,Insights and Design Choices
by: Liu, Junfeng, et al.
Published: (2025)

VectorMaton: Efficient Vector Search with Pattern Constraints via an Enhanced Suffix Automaton
by: Xie, Haoxuan, et al.
Published: (2026)

Is Integer Linear Programming All You Need for Deletion Propagation? A Unified and Practical Approach for Generalized Deletion Propagation
by: Makhija, Neha, et al.
Published: (2024)

BVLSM: Write-Efficient LSM-Tree Storage via WAL-Time Key-Value Separation
by: Li, Ming, et al.
Published: (2025)

Inference-Aware & Privacy-Preserving Deletion in Databases
by: Chakraborty, Vishal, et al.
Published: (2026)

FlashMap: A Flash Optimized Key-Value Store
by: Guo, Zonglin, et al.
Published: (2025)

CIDER: Boosting Memory-Disaggregated Key-Value Stores with Pessimistic Synchronization
by: Du, Yuxuan, et al.
Published: (2026)

Femur: A Flexible Framework for Fast and Secure Querying from Public Key-Value Store
by: Zhang, Jiaoyi, et al.
Published: (2025)

Insert-Only versus Insert-Delete in Dynamic Query Evaluation
by: Khamis, Mahmoud Abo, et al.
Published: (2023)

Outback: Fast and Communication-efficient Index for Key-Value Store on Disaggregated Memory
by: Liu, Yi, et al.
Published: (2025)

CompassDB: Pioneering High-Performance Key-Value Store with Perfect Hash
by: Jiang, Jin, et al.
Published: (2024)

Don't go gaga with GIGO
by: Decker, Hendrik, et al.
Published: (2024)

vLSM: Low tail latency and I/O amplification in LSM-based KV stores
by: Xanthakis, Giorgos, et al.
Published: (2024)

LSM-OPD: Boosting Scan in LSM-Trees by Enabling Direct Computing on Compressed Data
by: Huang, Jianfeng, et al.
Published: (2025)

DLHT: A Non-blocking Resizable Hashtable with Fast Deletes and Memory-awareness
by: Katsarakis, Antonios, et al.
Published: (2024)

Nezha: A Key-Value Separated Distributed Store with Optimized Raft Integration
by: Wang, Yangyang, et al.
Published: (2026)

O^3-LSM: Maximizing Disaggregated LSM Write Performance via Three-Layer Offloading
by: Lin, Qi, et al.
Published: (2026)

From FASTER to F2: Evolving Concurrent Key-Value Store Designs for Large Skewed Workloads
by: Kanellis, Konstantinos, et al.
Published: (2023)

TierBase: A Workload-Driven Cost-Optimized Key-Value Store
by: Shen, Zhitao, et al.
Published: (2025)

MetaHive: A Cache-Optimized Metadata Management for Heterogeneous Key-Value Stores
by: Heidari, Alireza, et al.
Published: (2024)

DBgDel: Database-Enhanced Gene Deletion Framework for Growth-Coupled Production in Genome-Scale Metabolic Models
by: Yang, Ziwei, et al.
Published: (2024)

Employ SmartNICs' Data Path Accelerators for Ordered Key-Value Stores
by: Schimmelpfennig, Frederic, et al.
Published: (2026)

The SpaceSaving$\pm$ Family of Algorithms for Data Streams with Bounded Deletions
by: Zhao, Fuheng, et al.
Published: (2023)

Analysis and Evaluation of Using Microsecond-Latency Memory for In-Memory Indices and Caches in SSD-Based Key-Value Stores
by: Bando, Yosuke, et al.
Published: (2025)

RadixGraph: A Fast, Space-Optimized Data Structure for Dynamic Graph Storage (Extended Version)
by: Xie, Haoxuan, et al.
Published: (2026)