Expand description
Beam search for DiskANN
Implements the greedy best-first beam search algorithm used in DiskANN for approximate nearest neighbor search on the Vamana graph.
§Algorithm
- Start from entry points
- Maintain a priority queue of top-L closest candidates
- Greedily expand the closest unvisited node
- Continue until no closer nodes are found
§References
- DiskANN: Fast Accurate Billion-point Nearest Neighbor Search on a Single Node (Jayaram Subramanya et al., NeurIPS 2019)
Structs§
- Beam
Search - Beam search implementation
- Search
Result - Search result containing neighbors and statistics
- Search
Stats - Search statistics