Instant Distance: 快速HNSW索引

Instance Distance是Malkov和Yashunin撰写的《层次可导航小世界》（Hierarchical Navigable Small Worlds）论文的快速纯Rust实现，用于寻找近似最近邻。此实现为Instant Domain Search后端服务提供动力，用于单词向量索引。

功能

Instant Distance是快速近似最近邻搜索算法的实现。该算法用于在集合中找到与给定点最接近的点。例如，它可以用于制作简单翻译。

使用库

Rust

[dependencies]
instant-distance = "0.5.0"

示例

use instant_distance::{Builder, Search};

fn main() {
    let points = vec![Point(255, 0, 0), Point(0, 255, 0), Point(0, 0, 255)];
    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()
    }
}

测试

Rust

cargo t -p instant-distance --all-features

Python

make test-python