4 papers
DaiSy: A Library for Scalable Data Series Similarity Search
Francesca Del Gaudio, Manos Chatzakis, Gayathiri Ravendirane +2
Exact similarity search over large collections of data series is a fundamental operation in modern applications, yet existing solutions are often fragmented, specialized, or tailor…
ParisKV: Fast and Drift-Robust KV-Cache Retrieval for Long-Context LLMs
Yanlin Qi, Xinhang Chen, Huiqiang Jiang +3
KV-cache retrieval is essential for long-context LLM inference, yet existing methods struggle with distribution drift and high latency at scale. We introduce ParisKV, a drift-robus…
PDET-LSH: Scalable In-Memory Indexing for High-Dimensional Approximate Nearest Neighbor Search with Quality Guarantees
Jiuqi Wei, Xiaodong Lee, Botao Peng +3
Locality-sensitive hashing (LSH) is a well-known solution for approximate nearest neighbor (ANN) search with theoretical guarantees. Traditional LSH-based methods mainly focus on i…
Fast and Exact Similarity Search in less than a Blink of an Eye
Patrick Schäfer, Jakob Brand, Ulf Leser +2
Similarity search is a fundamental operation for analyzing data series (DS), which are ordered sequences of real values. To enhance efficiency, summarization techniques are employe…