ruvector-diskann 2.2.3

Vamana graph: greedy search + α-robust pruning for bounded out-degree
Product Quantization (PQ): compressed distance for candidate filtering
Memory-mapped graph: SSD-friendly access, only load neighbors on demand

DiskANN/Vamana — SSD-friendly approximate nearest neighbor search with product quantization

Coverage
100%
50 out of 50 items documented0 out of 41 items with examples
Size
Source code size: 100.1 kB This is the summed size of all the files inside the crates.io package for this release.
Documentation size: 1.36 MB This is the summed size of all files generated by rustdoc for all configured targets
Ø build duration
this release: 9s Average build duration of successful builds.
all releases: 24s Average build duration of successful builds in releases after 2024-10-23.
Links
ruvnet/RuVector
4257 566 31
crates.io
Dependencies
Versions
- 2.2.3 (2026-06-18)
- 2.1.0 (2026-04-06)
Owners

ruvector-diskann

DiskANN/Vamana implementation for billion-scale approximate nearest neighbor search.

Subramanya et al., "DiskANN: Fast Accurate Billion-point Nearest Neighbor Search on a Single Node" (NeurIPS 2019)