{"total":23,"rows":[{"id":"2401.08281","title":"The Faiss library","created":"2024-01-16","cited_by_count":376,"area":null},{"id":"2205.03763","title":"Results of the NeurIPS'21 Challenge on Billion-Scale Approximate Nearest Neighbor Search","created":"2022-05-08","cited_by_count":45,"area":null},{"id":"2409.17424","title":"Results of the Big ANN: NeurIPS'23 competition","created":"2024-09-25","cited_by_count":22,"area":null},{"id":"2308.02752","title":"DeDrift: Robust Similarity Search under Content Drift","created":"2023-08-05","cited_by_count":11,"area":null},{"id":"2402.02044","title":"Locally-Adaptive Quantization for Streaming Vector Search","created":"2024-02-03","cited_by_count":11,"area":null},{"id":"2201.05409","title":"Progressively Optimized Bi-Granular Document Representation for Scalable Embedding Based Retrieval","created":"2022-01-14","cited_by_count":7,"area":null},{"id":"2411.00970","title":"Incremental IVF Index Maintenance for Streaming Vector Search","created":"2024-11-01","cited_by_count":7,"area":null},{"id":"2406.19651","title":"CANDY: A Benchmark for Continuous Approximate Nearest Neighbor Search with Dynamic Data Ingestion","created":"2024-06-28","cited_by_count":4,"area":null},{"id":"2312.03940","title":"PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search","created":"2023-12-06","cited_by_count":3,"area":null},{"id":"2401.07119","title":"Curator: Efficient Indexing for Multi-Tenant Vector Databases","created":"2024-01-13","cited_by_count":3,"area":null},{"id":"2405.12207","title":"Optimistic Query Routing in Clustering-based Approximate Maximum Inner Product Search","created":"2024-05-20","cited_by_count":3,"area":null},{"id":"2502.01528","title":"SQUASH: Serverless and Distributed Quantization-based Attributed Vector Similarity Search","created":"2025-02-03","cited_by_count":3,"area":null},{"id":"2609.07561","title":"EigenLI: Spectral Approximations to Late Interaction","created":"2026-09-07","cited_by_count":1,"area":null},{"id":"2505.15636","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","created":"2025-05-21","cited_by_count":0,"area":null},{"id":"2511.04073","title":"Learning Filter-Aware Distance Metrics for Nearest Neighbor Search with Multiple Filters","created":"2025-11-06","cited_by_count":0,"area":null},{"id":"2604.11274","title":"Mycelium-Index: A Streaming Approximate Nearest Neighbor Index with Myelial Edge Decay, Traffic-Driven Reinforcement, and Adaptive Living Hierarchy","created":"2026-04-13","cited_by_count":0,"area":null},{"id":"2605.17415","title":"IVF-TQ: Calibration-Free Streaming Vector Search via a Codebook-Free Residual Layer","created":"2026-05-17","cited_by_count":0,"area":null},{"id":"2605.23887","title":"CHRONOS: Temporally-Aware Multi-Agent Coordination for Evolving Data Marketplaces","created":"2026-05-22","cited_by_count":0,"area":null},{"id":"2606.25237","title":"Extreme Meta-Classification for Large-Scale Zero-Shot Retrieval","created":"2026-06-23","cited_by_count":0,"area":null},{"id":"2607.17582","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","created":"2026-07-20","cited_by_count":0,"area":null},{"id":"2608.22141","title":"MEMONDEMAND: A Memory Management System for Large-Scale Enterprise Data","created":"2026-08-22","cited_by_count":0,"area":null},{"id":"2609.02143","title":"A Power Law in Logarithm's Clothing: On the Scalability of Graph-Based Vector Search","created":"2026-09-02","cited_by_count":0,"area":null},{"id":"2609.36359","title":"Better Nearest Neighbor Graph Indices via (Efficient) LLM-Guided Pruning","created":"2026-09-28","cited_by_count":0,"area":null}],"next_cursor":null}