arXiv (OAI Expanded)
open access
BOA: Beamwidth Online Adaptation for Filtered-ANNS on a GPU
Filtered approximate nearest neighbor search, i.e. returning the top-k vectors nearest to a query vector among those satisfying one or more attribute predicates, has become a fundamental operation in modern vector search systems. Graph-based solutions employ beam search to solve a batch of queries i
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- BOA: Beamwidth Online Adaptation for Filtered-ANNS on a GPU#919339
- FliX: Flipped-Indexing for Scalable GPU Queries and Updates#120487
- RACORN-1: Adaptive Recall-Preserving Speedup for Low-Selectivity Filtered Vector Search#329175
- Anon: Extrapolating Adaptivity Beyond SGD and Adam#1062898
- The Database Safari : Exploring Vector, Time‑Series, Graph, Columnar/OLAP, and Geospatial Databases in the Wild / by Gabor Koos#1089555
Record · ID 1110553
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive