HRNN combines a navigation graph, ranked KNN graph, and reverse-neighbor lists with proxy-based candidate generation and materialized kNN-radii to achieve up to 10x higher throughput for approximate RkNN on datasets up to 10M vectors.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
HRNN: A Hybrid Graph Index for Approximate Reverse k-Nearest Neighbor Search on High-Dimensional Vectors
HRNN combines a navigation graph, ranked KNN graph, and reverse-neighbor lists with proxy-based candidate generation and materialized kNN-radii to achieve up to 10x higher throughput for approximate RkNN on datasets up to 10M vectors.