Showing cs.DBShow all
3 papers · 1 filter
cs.DB2026★ 1 cited
Are Joins over LSM-Trees Ready? Take RocksDB as an Example
Weiping Yu, Fan Wang, Xuwei Zhang +1
LSM-tree-based data stores are widely adopted in industries for their excellent performance. As data scales increase, disk-based join operations become indispensable yet costly for…
cs.DB2025
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…
cs.DB2024
CAMAL: Optimizing LSM-trees via Active Learning
Weiping Yu, Siqiang Luo, Zihao Yu +1
We use machine learning to optimize LSM-tree structure, aiming to reduce the cost of processing various read/write operations. We introduce a new approach Camal, which boasts the f…