Life & fun · alternatives · 2026
24 alternatives to Vicinity – Fast, Lightweight Nearest Neighbors with Flexible Back Ends
We’ve just open-sourced Vicinity, a lightweight approximate nearest neighbors (ANN) search package that allows for fast experimentation and comparison of a larger number of well known algorithms. Main features: - Lightweight: the base package only uses Numpy - Unified interface: use any of the supported algorithms and backends with a single interface: HNSW, Annoy, FAISS, and many more algorithms and libraries are supported - Easy evaluation: evaluate the performance of your backend with a simple function to measure queries per second vs recall - Serialization: save and load your index for…
Vicinity is an open-source Python package for approximate nearest neighbors search that provides a unified interface across multiple algorithms including HNSW, Annoy, and FAISS. It requires only NumPy as a base… Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes. Vicinity – Fast, Lightweight Nearest Neighbors with Flexible Back Ends launched in 2024; newer entries below may have overtaken it.
- 1
HNSW implementation in Rust. Reference: https://arxiv.org/ftp/arxiv/papers/1603/1603.09320.pdf - swapneel/hnsw-rust
2024 · github.com · its alternatives →
- 2FS
I made this website with my wife in mind; it makes it possible to browse for similar fashion products over many different retailers at once. The backend is written in Swift, and is hosted on a single Mac Mini. It performs nearest neighbors on the GPU over ~3M product images. No vector DB, just pure matrix multiplications. Since we aren't just doing approximate nearest neighbors but rather sorting all results by distance, it's possible to show different "variety" levels by changing the stride over the sorted search results. Nearest neighbors are computed in a latent vector space. The model…
2025 · vibewall.shop · its alternatives →
- 3
Geohashes in proximity. Contribute to ashwin711/proximityhash development by creating an account on GitHub.
2017 · github.com · its alternatives →
- 4
I recently found myself computing the similarity between lots of very high dimensional vectors (i.e., sentence embedding vectors from LLMs), and I wanted to try some more powerful measures of similarity/dependency than just Cosine similarity, which seems to be the default for everything nowadays because of its computational efficiency. There are many other more involved measures that can detect more subtle relationships, but the problem is that some of them are quite slow to compute, especially if you're trying to do it in Python. For my favorite measure of statistical dependency,…
2023 · github.com · its alternatives →
- 5
In an effort to understand it, I put together a simple, pure python implementation of HNSW, an approximate nearest neighbor library. Learned a lot, and I think for anyone interested in vector search it's an exercise that's absolutely worth doing. The code is optimized (imo) for readability, and working (albeit, quite slowly) on putting together a tutorial that walks through the motivation and implementation of HNSW. There's also working code examples for using the library for text and image search with sentence transformers and CLIP!
2025 · github.com · its alternatives →
- 6
All-pair set similarity search on millions of sets in Python and on a laptop - GitHub - ekzhu/SetSimilaritySearch: All-pair set similarity search on millions of sets in Python and on a laptop
2018 · github.com · its alternatives →
- 7GR
A platform that helps users quickly find airports near any location worldwide.
2012 · emergentone.com · its alternatives →
- 8
Heirarchical Navigable Small Worlds. Contribute to dicroce/hnsw development by creating an account on GitHub.
2025 · github.com · its alternatives →
- 9
Hey folks! As someone doing hybrid search daily and wishing I could have a pgvector-like experience but with actual prefiltered approximate nearest neighbours, I decided to just take a punt on implementing ACORN on a fork of the DuckDB VSS extension. I had to make some changes to (vendored) usearch that I'm thinking of submitting upstream. But this does the business. Approximate nearest neighbours with WHERE prefiltering. Edit: Just to clarify, this has been accepted into the community extensions repo. So you can use it like: ``` INSTALL hnsw_acorn FROM community; LOAD hnsw_acorn; ```
Mar 2026 · github.com · its alternatives →
- 10
Hey HN! I’ve recently open-sourced Pyversity, a lightweight library for diversifying retrieval results. Most retrieval systems optimize only for relevance, which can lead to top-k results that look almost identical. Pyversity efficiently re-ranks results to balance relevance and diversity, surfacing items that remain relevant but are less redundant. This helps with improving retrieval, recommendation, and RAG pipelines without adding latency or complexity. Main features: - Unified API: one function (diversify) supporting several well-known strategies: MMR, MSD, DPP, and COVER (with more to…
2025 · github.com · its alternatives →
- 11
2019 · github.com · its alternatives →
- 12
Frustrated by the inability to play with semantic search / ANN in Go w/o a heavy-weight external DB, I created this HNSW library. I hope other gophers find it useful.
2024 · github.com · its alternatives →
- 13
Experimental Global Optimization Algorithm. Contribute to chrisstroemel/Simple development by creating an account on GitHub.
2018 · github.com · its alternatives →
- 14RW
Been messing with cosine similarity and decided to try calculating nearest neighbors over the entire link graph for the marginalia search engine. Turns out that you can just bruteforce that in a day or two. And the results are pretty good. One drawback is that depending on if you're looking at an older website, a lot of the links are dead. The deduplication isn't great either.
2022 · explore2.marginalia.nu · its alternatives →
- 15
A web-based application for quick, scalable, and automated hyperparameter tuning and stacked ensembling in Python. - reiinakano/xcessiv
2017 · github.com · its alternatives →
- 16SA
Hi everyone, I've made an open-source library for fast spatial search in Rust. It's called Spart, and it currently provides the following features: - Five tree implementations: Quadtree, Octree, Kd-tree, R-tree, and R*-tree - Python bindings (`pyspart` on PyPI) - Fast k-nearest neighbor (kNN) and radius search - Bulk data loading for efficient tree construction Project's GitHub repo: https://github.com/habedi/spart
2025 · its alternatives →
- 17AG
This is a vector index I built that supports insertion and k-nearest neighbors (k-NN) querying, optimized for GPUs. It operates entirely in CUDA and can process queries on half a billion vectors in under 200 milliseconds. The codebase is structured as a standalone library with an HTTP API for remote access. It’s intended for high-performance search tasks—think similarity search, AI model retrieval, or reinforcement learning replay buffers. The codebase is located at https://github.com/rodlaf/BinaryGPUIndex.
2025 · rlafuente.com · its alternatives →
- 18
Here's a small demonstration of the fundamental aspects of the word-to-vec algorithm. It's implemented in a single python script and depends only on a single text file for training. It's not meant to be blazingly fast or anything, just a toy example to aid my understanding of how word vectors might be learnt from a corpus.
2023 · github.com · its alternatives →
- 19
OctaneDB is an open-source vector database for Python that focuses on ultra-fast similarity search for high-dimensional data—perfect for AI/ML, semantic search, and large-scale document or embedding retrieval. What does it do? Store, index, and search millions of embeddings (text, images, etc.) with sub-millisecond query time. Supports in-memory and efficient HDF5 persistent storage. Integrates seamlessly with sentence-transformers for automatic text embedding. Key Features: 10x faster than Pinecone or ChromaDB for vector search and batch insertions. Advanced indexing: HNSW (approximate…
2025 · github.com · its alternatives →
- 20
Vector space model implemented in a few lines . Contribute to felipehummel/TinySearchEngine development by creating an account on GitHub.
2011 · github.com · its alternatives →
- 21UI
Hey everyone! I am excited to share updates on four of my & my teams' open-source projects that take large-scale search systems to the next level: USearch, UForm, UCall, and StringZilla. These projects are designed to work seamlessly together, end-to-end—covering everything from indexing and AI to storage and networking. And yeah, they're optimized for x86 AVX2/512 and Arm NEON/SVE hardware. USearch [1]: Think of it as Meta FAISS on steroids. It's now quicker, supports clustering of any granularity, and offers multi-index lookups. Plus, it's got more native bindings than probably…
2023 · usearch-images.com · its alternatives →
- 22MA
2017 · lmcinnes.github.io · its alternatives →
- 23
See what’s nearby and what’s missing instantly
Mar 2026 · proximitymap.io · its alternatives →
- 24OA
https://github.com/gugarosa/opytimizer Did you ever reach a bottleneck in your computational experiments? Are you tired of selecting suitable parameters for a chosen technique? If yes, Opytimizer is the real deal! This package provides an easy-to-go implementation of meta-heuristic optimizations. From agents to search space, from internal functions to external communication, we will foster all research related to optimizing stuff. Use Opytimizer if you need a library or wish to: - Create your optimization algorithm; - Design or use pre-loaded optimization tasks; -…
2021 · its alternatives →
Also compare
- A fast HNSW implementation in Rust alternatives
- Fashion Shopping with Nearest Neighbors alternatives
- ProximityHash – Geohashes in Proximity alternatives
- Fast vector similarity using Rust and Python alternatives
- Tinyhnsw – The Littlest Vector Database alternatives
- All-pair similarity search on millions of sets in Python and on laptop alternatives
Ranked by how close each launch is in meaning, then by votes. Prices were read from each product’s own site when checked and can change. Refine with your own description →