Three HNSW merge algorithms are proposed, and the fastest (IGTM) reportedly achieves roughly 70 percent fewer distance computations with comparable recall on SIFT1M.
Data structures and algorithms for nearest neighbor search in general metric spaces
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Three Algorithms for Merging Hierarchical Navigable Small World Graphs
Three HNSW merge algorithms are proposed, and the fastest (IGTM) reportedly achieves roughly 70 percent fewer distance computations with comparable recall on SIFT1M.