Towards A Massive-scale Distributed Neighborhood Graph Construction
Keita Iwabuchi, Trevor Steil, Benjamin W. Priest, Roger Pearce, Geoffrey Sanders · 2023
Graph-based approximate nearest neighbor algorithms have shown high performance and quality. However, such approaches require a large amount of memory and still take a long time to construct high-quality nearest neighbor graphs (NNGs). Using distributed memory systems is important when data is large or a shorter indexing time is desired.