Per-Query Recall Guarantees for Approximate Nearest Neighbor Search in Dynamic Vector Databases
cs.DB
Submitted: 2026-11-05
Updated: 2026-11-11
Code: https://github.com/pgvector/pgvector
Terminology
Sources
- RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search
- Towards Robustness: A Critique of Current Vector Database Assessments
- OOD-DiskANN: Efficient and Scalable Graph ANNS for Out-of-Distribution Queries
- ANN Search: Recall What Matters
- Toward Optimal Search and Retrieval for RAG
- The 2021 Image Similarity Dataset and Challenge
- FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search
- Incremental IVF Index Maintenance for Streaming Vector Search
- Graph-Based Nearest-Neighbor Search with Recall Guarantees Using Graph Spanners
- CLIP: Lightweight Cosine-Law-Based Inverted-List Pruning for IVF-Based Vector Search
Related papers
- Beyond Overlap: Hierarchical Graph Abstraction for Out-of-Core Vector Search
- EMA: Approximate Nearest Neighbor Search with General Attribute Filtering and Dynamic Updates
- Open Biomedical Knowledge Graphs at Scale: Construction, Federation, and AI Agent Access with Samyama Graph Database
- Samyama: A Unified Graph-Vector Database with In-Database Optimization, Agentic Enrichment, and Hardware Acceleration
- GenTUS: Table Union Search via Constrained Generation of Semantic Table Identifiers
- Common-Neighbor-Count-Based Representative Possible World Finding on Uncertain Graphs