#nearest-neighbor #nearest-neighbor-search #data-points #vector-sets #sparse-dense #ann-search

ann_dataset

A lightweight research library for managing Approximate Nearest Neighbor search datasets

3 releases

new 0.1.2 Apr 22, 2024
0.1.1 Apr 18, 2024
0.1.0 Apr 18, 2024

#525 in Algorithms

Download history 203/week @ 2024-04-15

203 downloads per month

MIT license

48KB
987 lines

A lightweight research library for managing Approximate Nearest Neighbor search datasets.

It offers the following features:

  • Storage of dense, sparse, and dense-sparse vector sets;
  • Storage of query sets with ground-truth (i.e., exact nearest neighbors) according to different metrics;
  • Basic functionality such as computing recall given a retrieved set; and,
  • Serialization into and deserialization from HDF5 file format.

Find out more on crates.io.

Example usage

It is straightforward to read an ANN dataset. The code snippet below gives a concise example.

use ann_dataset::{AnnDataset, Hdf5File, InMemoryAnnDataset, Metric, 
                  PointSet, QuerySet, GroundTruth};

// Load the dataset.
let dataset = InMemoryAnnDataset::<f32>::read(path_to_hdf5)
    .expect("Failed to read the dataset.");

// Get a reference to the data points.
let data_points: &PointSet<_> = dataset.get_data_points();

// Get the test query set.
let test: &QuerySet<_> = dataset.get_test_query_set()
    .expect("Failed to load test query set.");
let test_queries: &PointSet<_> = test.get_points();
let gt: &GroundTruth = test.get_ground_truth(&Metric::InnerProduct)
    .expect("Failed to load ground truth for InnerProduct search.");

// Compute recall, assuming `retrieved_set` is &[Vec<usize>],
// where the `i`-th entry is a list of ids of retrieved points
// for the `i`-th query.
let recall = gt.mean_recall(retrieved_set);

Dependencies

~8MB
~164K SLoC