Instant Distance: fast HNSW indexing
Instance Distance is a fast pure-Rust implementation of the Hierarchical Navigable Small Worlds paper by Malkov and Yashunin for finding approximate nearest neighbors. This implementation powers the InstantDomainSearch.com backend services used for word vector indexing.
What it does
Instant Distance is an implementation of a fast approximate nearest neighbor search algorithm. The algorithm is used to find the closest point(s) to a given point in a set.
Using the library
Rust
[dependencies]
instant-distance = "0.5.0"
Example
f32 {
// Euclidean distance metric
(((self.0 - other.0).pow(2) + (self.1 - other.1).pow(2) + (self.2 - other.2).pow(2)) as f32)
.sqrt()
}
}
">
use instant_distance::{Builder, Search}; fn main() { let points = vec![Point(255, 0, 0), Point(255, 0, 0), Point(255, 0, 0)]; let values = vec!["red", "green", "blue"]; let map = Builder::default().build(points, values); let mut search = Search::default(); let cambridge_blue = Point(163, 193, 173); let closest_point = map.search(&cambridge_blue, &mut search).next().unwrap(); println!("{:?}", closest_point.value); } #[derive(Clone, Copy, Debug)] struct Point(isize, isize, isize); impl instant_distance::Point for Point { fn distance(&self, other: &Self) -> f32 { // Euclidean distance metric (((self.0 - other.0).pow(2) + (self.1 - other.1).pow(2) + (self.2 - other.2).pow(2)) as f32) .sqrt() } }
Testing
Rust:
cargo t -p instant-distance --all-features
Python:
make test-python
61 Oct 7, 2022
39 Dec 21, 2022
2 Feb 21, 2022
5 Nov 16, 2023
6 Feb 29, 2024
7 Oct 9, 2021
32 Apr 9, 2023
411 Jan 9, 2023
851 Jan 3, 2023
189 Dec 9, 2022
10 Jun 16, 2022
210 Jul 12, 2023
3 Jun 11, 2022
2 Sep 12, 2022
4 May 3, 2023
45 Dec 28, 2022
3 Jan 7, 2023
139 Dec 13, 2022
115 Dec 9, 2022