Metraipolis › archive › dc_ca32d3381b2f
FROG: Efficient Range-Filtering Approximate Nearest Neighbor Search on GPUs — arXiv:2608.16491
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.16491
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T23:35:36.343Z
- SHA-256 of the archived text
0de4868b53fe0e412199194ac870ccd3568955d6fcb48c2bf8a10a7e4bb5c0ed- Stable URL of this page
https://metraipolis.com/documento/dc_ca32d3381b2f
How to cite
FROG: Efficient Range-Filtering Approximate Nearest Neighbor Search on GPUs — arXiv:2608.16491 — arXiv (en), https://arxiv.org/abs/2608.16491 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ca32d3381b2f (Metraipolis archive dc_ca32d3381b2f, sha256 0de4868b53fe0e412199194ac870ccd3568955d6fcb48c2bf8a10a7e4bb5c0ed)
BibTeX
@misc{dcca32d3381b2f,
title = {FROG: Efficient Range-Filtering Approximate Nearest Neighbor Search on GPUs — arXiv:2608.16491},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.16491},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ca32d3381b2f; sha256 0de4868b53fe0e412199194ac870ccd3568955d6fcb48c2bf8a10a7e4bb5c0ed},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.16491. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Range-filtering approximate nearest neighbor search (RFANNS) is a fundamental operation in modern vector databases. Given a query vector $q$ and a numerical range predicate, RFANNS returns the $k$-approximate nearest neighbors ($k$-ANN) of the query $q$ among the objects whose attributes satisfy the range predicate. However, existing RFANNS methods are not well suited to high-throughput GPU execution. CPU indexes offer limited parallel scalability, generic GPU filtering is highly selectivity-dependent, and GPU indexes built from locally optimized subgraphs can incur long search trajectories and redundant distance computations. To address these limitations, we present FROG, a GPU-oriented RFANNS index that replaces multiple locally optimal substructure building with a globally aware, vertex-centric design. It organizes diverse expansion neighbor candidates for each vertex in a GPU-friendly structure and rapidly identifies the expansion neighbors used for computation at query time. Moreover, GPU-oriented algorithms and implementations are developed for both index construction and query processing. Experiments on six datasets show that FROG improves mixed-selectivity query throughput by 14.7--37.7$\times$ over 44-core CPU baselines and 4.5--7.6$\times$ over the strongest GPU baseline. It also accelerates index construction by 2.4--14.8$\times$ over the GPU baseline. Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-08-18 in cs.DB). Categorie arXiv: Databases (cs.DB) ; Information Retrieval (cs.IR). Pagina del lavoro: https://arxiv.org/abs/2608.16491 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-18T23:02:17.577Z dalla pagina https://arxiv.org/catchup/cs.DB/2026-08-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).