17 Repositories
Rust k-nearest-neighbors Libraries
๐ง WIP ๐ง Vector database plugin for Postgres, written in Rust, specifically designed for LLM.
pgvecto.rs pgvecto.rs is a Postgres extension that provides vector similarity search functions. It is written in Rust and based on pgrx. Features cosi
A simple url checker for finding fraud url(s) or nearest url
urlchecker A simple url checker for finding fraud url(s) or nearest url while being fast (threading) Eg:- use std::collections::HashMap; use urlchecke
Rust-port of spotify/annoy as a wrapper for Approximate Nearest Neighbors in C++/Python optimized for memory usage.
Fareast This library is a rust port of spotify/annoy , currently only index serving is supported. It also provides FFI bindings for jvm, dotnet and da
Rust-port of spotify/annoy as a wrapper for Approximate Nearest Neighbors in C++/Python optimized for memory usage.
Rust-port of spotify/annoy as a wrapper for Approximate Nearest Neighbors in C++/Python optimized for memory usage.
Rust wrappers for NGT approximate nearest neighbor search
ngt-rs โ Rust wrappers for NGT, which provides high-speed approximate nearest neighbor searches against a large volume of data. Note that NGT will be
Hamming Weight Tree from the paper Online Nearest Neighbor Search in Hamming Space
hwt Hamming Weight Tree from the paper Online Nearest Neighbor Search in Hamming Space To understand how the data structure works, please see the docs
Nearest neighbor search algorithms including a ball tree and a vantage point tree.
petal-neighbors Nearest neighbor search algorithms including a ball tree and a vantage point tree. Examples The following example shows how to find tw
Image search example by approximate nearest-neighbor library In Rust
rust-ann-search-example Image search example by approximate nearest-neighbor library In Rust use - tensorflow 0.17.0 - pretrain ResNet50 - hora (Ru
Webassembly binding for Hora Approximate Nearest Neighbor Search Library
hora-wasm [Homepage] [Document] [Examples] [Hora] Javascript bidding for the Hora Approximate Nearest Neighbor Search, in WebAssembly way. Features Pe
๐ efficient approximate nearest neighbor search algorithm collections library written in Rust ๐ฆ .
๐ efficient approximate nearest neighbor search algorithm collections library written in Rust ๐ฆ .
K-dimensional tree in Rust for fast geospatial indexing and lookup
kdtree K-dimensional tree in Rust for fast geospatial indexing and nearest neighbors lookup Crate Documentation Usage Benchmark License Usage Add kdtr
C library for finding nearest (most similar) element in a set
VP-tree nearest neighbor search A relatively simple and readable Rust implementation of Vantage Point tree search algorithm. The VP tree algorithm doe
Qdrant - vector similarity search engine with extended filtering support
Vector Similarity Search Engine with extended filtering support Qdrant (read: quadrant ) is a vector similarity search engine. It provides a productio
Graph-based Approximate Nearest Neighbor Search
granne* granne (graph-based retrieval of approximate nearest neighbors) is a Rust library for approximate nearest neighbor search based on Hierarchica
HNSW ANN from the paper "Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs"
hnsw Hierarchical Navigable Small World Graph for fast ANN search Enable the serde feature to serialize and deserialize HNSW. Tips A good default for
Instance Distance is a fast pure-Rust implementation of the Hierarchical Navigable Small Worlds paper
Fast approximate nearest neighbor searching in Rust, based on HNSW index
K-dimensional tree in Rust for fast geospatial indexing and lookup
kdtree K-dimensional tree in Rust for fast geospatial indexing and nearest neighbors lookup Crate Documentation Usage Benchmark License Usage Add kdtr