3 papers
cs.DB2026
VectorMaton: Efficient Vector Search with Pattern Constraints via an Enhanced Suffix Automaton
Haoxuan Xie, Siqiang Luo
Approximate nearest neighbor search (ANNS) has become a cornerstone in modern vector database systems. Given a query vector, ANNS retrieves the closest vectors from a set of base v…
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.DB2025
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…