#disk-ann #nearest-neighbors-search #approximate-nearest-neighbor #reborrow #matrix-view

diskann-utils

DiskANN is a fast approximate nearest neighbor search library for high dimensional data

11 releases (breaking)

new 0.52.0 May 12, 2026
0.50.1 Apr 27, 2026
0.50.0 Mar 31, 2026

#2818 in Algorithms

Download history 53/week @ 2026-01-23 523/week @ 2026-01-30 538/week @ 2026-02-06 897/week @ 2026-02-13 714/week @ 2026-02-20 670/week @ 2026-02-27 729/week @ 2026-03-06 870/week @ 2026-03-13 402/week @ 2026-03-20 598/week @ 2026-03-27 525/week @ 2026-04-03 489/week @ 2026-04-10 724/week @ 2026-04-17 549/week @ 2026-04-24 735/week @ 2026-05-01 1983/week @ 2026-05-08

4,216 downloads per month
Used in 10 crates (9 directly)

MIT license

195KB
4.5K SLoC

DiskANN Utils

Traits, structs, and algorithms to be shared between the diskann specific crates and auxiliary crates like quantization.

The goal is to allow crates like diskann to use traits like Reborrow and structs like MatrixView without relying on quantization.

Dependencies of this crate should be kept to a minimum as like vector and wide, it sits at the very bottom of the DiskANN dependency stack.

Dependencies

~5MB
~100K SLoC