Approximate Nearest Neighbor Search / Vector Search

- [ ] [GitHub - harsha-simhadri/big-ann-benchmarks: Framework for evaluating ANNS algorithms on billion scale datasets.](https://github.com/harsha-simhadri/big-ann-benchmarks) - [ ] [ANN Benchmarks](https://github.com/erikbern/ann-benchmarks/) - [ ] [Faiss](https://github.com/facebookresearch/faiss) - [ ] [Pytorch Interop](https://github.com/facebookresearch/faiss/pull/1484) - [ ] [Sharding Indices](https://github.com/facebookresearch/faiss/wiki/Indexes-that-do-not-fit-in-RAM) - [ ] [Contrib Modules (pytorch, clusterng, on disk)](https://github.com/facebookresearch/faiss/tree/main/contrib) - [ ] [Faiss: The Missing Manual | Pinecone](https://www.pinecone.io/learn/faiss/) - [ ] [Distributed Faiss](https://github.com/facebookresearch/distributed-faiss) - [ ] [Autofaiss](https://github.com/criteo/autofaiss) - [ ] [faiss tips](https://github.com/matsui528/faiss_tips) - [ ] [DiskANN](https://github.com/microsoft/diskann) - [ ] [NGT](https://github.com/yahoojapan/NGT) - [ ] [pynndescent](https://github.com/lmcinnes/pynndescent) - [ ] [GitHub - rapidsai/raft: RAFT contains fundamental widely-used algorithms and primitives for data science, graph and machine learning.](https://github.com/rapidsai/raft) - [ ] [GitHub - spotify/voyager: 🛰️ Voyager is an approximate nearest-neighbor search library for Python and Java with a focus on ease of use, simplicity, and deployability.](https://github.com/spotify/voyager) - [ ] [GitHub - BlaiseMuhirwa/flatnav: Fast and minimal header-only graph-based index for approximate nearest neighbor search (ANNS). https://blaisemuhirwa.github.io/flatnav](https://github.com/BlaiseMuhirwa/flatnav)

GitHub - meilisearch/arroy: Annoy-inspired Approximate Nearest Neighbors in Rust, based on LMDB and optimized for memory usage :boom:

Approximate Nearest Neighbor Search / Vector Search

Release Scaling Vector Search: Numba, Cppyy, PeachPy, and SimSIMD · unum-cloud/usearch · GitHub

Open Source

Libraries

Databases and Search Engines