4 papers · 1 filter
[Extended Version] ArceKV: Towards Workload-driven LSM-compactions for Key-Value Store Under Dynamic Workloads
Junfeng Liu, Haoxuan Xie, Siqiang Luo
Key-value stores underpin a wide range of applications due to their simplicity and efficiency. Log-Structured Merge Trees (LSM-trees) dominate as their underlying structure, excell…
On 10x Better Scalability: KV Stores Scale Up KV Cache
Weiping Yu, Ye Jiarui, He Mengke +2
Large language models (LLMs) rely on Key-Value (KV) cache to reduce time-to-first-token (TTFT) latency, but existing disk-based KV cache systems using file-per-object layouts suffe…
Evaluating Learned Indexes in LSM-tree Systems: Benchmarks,Insights and Design Choices
Junfeng Liu, Jiarui Ye, Mengshi Chen +2
LSM-tree-based data stores are widely used in industry due to their exceptional performance. However, as data volumes grow, efficiently querying large-scale databases becomes incre…
Aster: Enhancing LSM-structures for Scalable Graph Database
Dingheng Mo, Junfeng Liu, Fan Wang +1
There is a proliferation of applications requiring the management of large-scale, evolving graphs under workloads with intensive graph updates and lookups. Driven by this challenge…