61 Open source projects that are alternatives of or similar to Annoy

Open-source vector similarity search for Postgres

A Python package for hubness analysis and high-dimensional data mining

An open-source vector database for embedding similarity search and AI applications.

LSH index for approximate set containment search

All the code for a series of Medium articles on Approximate Nearest Neighbors

annoy-rb provides Ruby bindings for the Annoy (Approximate Nearest Neighbors Oh Yeah).

K-dimensional tree in Rust for fast geospatial indexing and lookup

NGT Go client library

Collections of vector search related libraries, service and research papers

Web服务：使用腾讯 800 万词向量模型和 spotify annoy 引擎得到相似关键词

Training of Locally Optimized Product Quantization (LOPQ) models for approximate nearest neighbor search of high dimensional data in Python and Spark.

A k-d tree implementation in Go.

⚡ A fast embedded library for approximate nearest neighbor search

A tutorial on scalable retrieval of matrix factorization recommendations

an implementation of parallel linear BVH (LBVH) on GPU

TLSH lib in Golang

Statistical Machine Intelligence & Learning Engine

Building Annoy Index on Apache Spark

A framework for building (and incrementally growing) graph-based data structures used in hierarchical or DAG-structured clustering and nearest neighbor search

Fast search algorithm for product-quantized codes via hash-tables

FAst Lookups of Cosine and Other Nearest Neighbors (based on fast locality-sensitive hashing)

Fast and lightweight header-only C++ library (with Python bindings) for approximate nearest neighbor search

A header-only C++ library for k nearest neighbor search with Eigen3.

A Java library implementing practical nearest neighbour search algorithm for multidimensional vectors that operates in sublinear time. It implements Locality-sensitive Hashing (LSH) and multi index hashing for hamming space.

Vald. A Highly Scalable Distributed Vector Search Engine

A Python nearest neighbor descent for approximate nearest neighbors

Efficient approximate k-nearest neighbors graph construction and search in Julia

Pure python implementation of product quantization for nearest neighbor search

Near-duplicate image detection using Locality Sensitive Hashing

BagMinHash - Minwise Hashing Algorithm for Weighted Sets

Generate kmers/minimizers/hashes/MinHash signatures, including with multiple kmer sizes.

Source Code for KNN Matting, CVPR 2012 / TPAMI 2013. MATLAB code ready to run. Simple and robust implementation under 40 lines.

Code for papers "Hashing with Mutual Information" (TPAMI 2019) and "Hashing with Binary Matrix Pursuit" (ECCV 2018)

Nearest neighbor search for Rails and Postgres

Fast and memory-efficient ANN with a subset-search functionality

Unofficial python wrapper to the nanoflann k-d tree

The data structure for unstructured data

Fast approximate nearest neighbor searching in Rust, based on HNSW index

Open source audio fingerprinting in .NET. An efficient algorithm for acoustic fingerprinting written purely in C#.

Plugin to integrate approximate nearest neighbor(ANN) search with Elasticsearch

Software for exploration of gene expression data from single-cell RNA sequencing.

📝Awesome and classical image retrieval papers

Quick ADC

Benchmarking approximate nearest neighbors. Note: This is an archived version from our SISAP 2017 paper, see below.

A scalable nearest neighbor search library in Apache Spark

TOROS N2 - lightweight approximate Nearest Neighbor library which runs fast even with large datasets

Some useful tips for faiss

High Dimensional Approximate Near(est) Neighbor

Fast Approximate Nearest Neighbor (ANN) searches with a PostgreSQL database.

Utilities for point cloud processing. read ply, write ply, search nearest neighbors using octree ...

Elasticsearch plugin for nearest neighbor search. Store vectors and run similarity search using exact and approximate algorithms.

Website for "A survey of learning to hash for Computer Vision" https://learning2hash.github.io

mlpack: a scalable C++ machine learning library --

gann(go-approximate-nearest-neighbor) is a library for Approximate Nearest Neighbor Search written in Go

🙃Implementation of vector quantization algorithms, codes for Norm-Explicit Quantization: Improving Vector Quantization for Maximum Inner Product Search.

GGNN: State of the Art Graph-based GPU Nearest Neighbor Search

Fast Near-Duplicate Image Search and Delete using pHash, t-SNE and KDTree.

Nearest Neighbor Search with Neighborhood Graph and Tree for High-dimensional Data

SetSketch: Filling the Gap between MinHash and HyperLogLog

Code for my PhD thesis. Library of quantization-based methods for fast similarity search in high dimensions. Presented at ECCV 18.