Incremental IVF Index Maintenance for Streaming Vector Search
Abstract
The prevalence of vector similarity search in modern machine learning applications and the continuously changing nature of data processed by these applications necessitate efficient and effective index maintenance techniques for vector search indexes. Designed primarily for static workloads, existing vector search indexes degrade in search quality and performance as the underlying data is updated unless costly index reconstruction is performed. To address this, we introduce Ada-IVF, an incremental indexing methodology for Inverted File (IVF) indexes. Ada-IVF consists of 1) an adaptive maintenance policy that decides which index partitions are problematic for performance and should be repartitioned and 2) a local re-clustering mechanism that determines how to repartition them. Compared with state-of-the-art dynamic IVF index maintenance strategies, Ada-IVF achieves an average of 2x and up to 5x higher update throughput across a range of benchmark workloads.
Cite
@article{arxiv.2411.00970,
title = {Incremental IVF Index Maintenance for Streaming Vector Search},
author = {Jason Mohoney and Anil Pacaci and Shihabur Rahman Chowdhury and Umar Farooq Minhas and Jeffery Pound and Cedric Renggli and Nima Reyhani and Ihab F. Ilyas and Theodoros Rekatsinas and Shivaram Venkataraman},
journal= {arXiv preprint arXiv:2411.00970},
year = {2024}
}
Comments
14 pages, 14 figures