mlsanityData to 7 Oct 2026

Incremental IVF Index Maintenance for Streaming Vector Search

arXiv 2411.00970 ↗First posted 1 Nov 2024cs.DB cs.AI cs.LGcited by 7

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 25 of its 66 references that are in the map. First posted on arXiv 1 Nov 2024.

Builds on

25 of 66 references.

References · 25

  1. 2017A Comprehensive Survey of Graph Embedding: Problems, Techniques and Applicationscited by 260
  2. 2018A Comprehensive Survey of Deep Learning for Image Captioningcited by 213
  3. 2020Machine Learning on Graphs: A Model and Comprehensive Taxonomycited by 156
  4. 2016Deep Image Retrieval: Learning global representations for image searchcited by 147
  5. 2018Billion-scale Commodity Embedding for E-commerce Recommendation in Alibabacited by 105
  6. 2017Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graphcited by 103
  7. 2020PinnerSage: Multi-Modal User Embedding Framework for Recommendations at Pinterestcited by 75
  8. 2018Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighborscited by 37
  9. 2021FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Searchcited by 36
  10. 2021SPANN: Highly-efficient Billion-scale Approximate Nearest Neighbor Searchcited by 35
  11. 2024SPFresh: Incremental In-Place Update for Billion-Scale Vector Searchcited by 28
  12. 2017Related Pins at Pinterest: The Evolution of a Real-World Recommender Systemcited by 24
13 more
  1. 2023High-Throughput Vector Similarity Search in Knowledge Graphscited by 19
  2. 2022Saga: A Platform for Continuous Construction and Serving of Knowledge At Scalecited by 18
  3. 2024Starling: An I/O-Efficient Disk-Resident Graph Index Framework for High-Dimensional Vector Similarity Search on Data Segmentcited by 16
  4. 2023Constructing Tree-based Index for Efficient and Effective Dense Retrievalcited by 15
  5. 2022ELIAS: End-to-End Learning to Index and Search in Large Output Spacescited by 14
  6. 2017Online Product Quantizationcited by 11
  7. 2023DeDrift: Robust Similarity Search under Content Driftcited by 11
  8. 2024Locally-Adaptive Quantization for Streaming Vector Searchcited by 10
  9. 2023Automating Nearest Neighbor Search Configuration with Constrained Optimizationcited by 7
  10. 2023DiskANN++: Efficient Page-based Search over Isomorphic Mapped Graph Index using Query-sensitivity Entry Vertexcited by 7
  11. 2023Co-design Hardware and Algorithm for Vector Searchcited by 6
  12. 2016PAM: Parallel Augmented Mapscited by 4
  13. 2024A Survey of Learned Indexes for the Multi-dimensional Spacecited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 3; 2026: 4.

7 papers.