Life & fun · alternatives · 2026

24 alternatives to PgANN Approximate Nearest Neighbor Searches with PostgreSQL Back End

Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes. Prices are shown for the 3 we have checked on their own sites, 3 of them free or with a free tier. PgANN Approximate Nearest Neighbor Searches with PostgreSQL Back End launched in 2019; newer entries below may have overtaken it.

1. 1
   Vicinity – Fast, Lightweight Nearest Neighbors with Flexible Back Ends▲57

   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…

   2024 · github.com · its alternatives →

2. 2
   Exa 3.0free tier, from $4/mo▲189

   Smarter search that gives AI agent richer data at lower cost

   3d ago · exa.ai · its alternatives →

3. 3FS
   Fashion Shopping with Nearest Neighbors▲76

   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 →

4. 4
   Postgres extension for BM25 relevance-ranked full-text search▲203

   Last summer we faced a conundrum at my company, Tiger Data, a Postgres cloud vendor whose main business is in timeseries data. We were trying to grow our business towards emerging AI-centric workloads and wanted to provide a state-of-the-art hybrid search stack in Postgres. We'd already built pgvectorscale in house with the goal of scaling semantic search beyond pgvector's main memory limitations. We just needed a scalable ranked keyword search solution too. The problem: core Postgres doesn't provide this; the leading Postgres BM25 extension, ParadeDB, is guarded behind AGPL; developing our…

   Mar 2026 · github.com · its alternatives →

5. 5
   A fast HNSW implementation in Rust▲111

   HNSW implementation in Rust. Reference: https://arxiv.org/ftp/arxiv/papers/1603/1603.09320.pdf - swapneel/hnsw-rust

   2024 · github.com · its alternatives →

6. 6AN
   a Navigational Query Language for PostgreSQL▲9

   2011 · htsql.org · its alternatives →

7. 7
   Visibyfree tier, from $49/mo▲144

   Track and grow your visibility across AI search

   Sep 2026 · visiby.net · its alternatives →

8. 8
   Software Engineering Daily - Scaling PostgreSQL▲70

   A look at modern database approaches and how Citus scales PG

   2016 · softwareengineeringdaily.com · its alternatives →

9. 9
   Pg_analytics – Speed Up Postgres Analytical Queries by 94x▲8

   2024 · github.com · its alternatives →

10. 10
    Ranktunefree tier, from $30/mo▲72

    Track AI visibility, citations, and referral traffic

    19d ago · tryranktune.com · its alternatives →

11. 11AG
    A GPU-accelerated binary vector index▲65

    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 →

12. 12
    20x faster pgvector alternative written in Rust▲23

    Scalable, Low-latency and Hybrid-enabled Vector Search in Postgres. Revolutionize Vector Search, not Database. - tensorchord/pgvecto.rs

    2023 · github.com · its alternatives →

13. 13FN
    FriendlyData – Natural Language Interface for Databases▲9

    2016 · friendlydata.io · its alternatives →

14. 14RS
    Ranked Search for Semi-Structured Data▲24

    We’ve been working on a search problem that requires querying both text and numbers simultaneously. For example, in a dataset of clothing items with descriptions and prices, a search for “slim pants for $20” should prioritize skinny jeans for $25 over slim pants for $50 because they are semantically similar and the price is closer. I’ve found that standard embedding models struggle with numerical ordering, while text-to-SQL methods rely on exact matches and often filter out too many results. To solve this, we built a system designed specifically for structured datasets like CSVs or tables.…

    2025 · demo.tryvoker.com · its alternatives →

15. 15DL
    Database Lab – thin Postgres clones for faster development and testing▲7

    2020 · postgres.ai · its alternatives →

16. 16PT
    Pg_textsearch – BM25 Ranking for Postgres▲13

    I built pg_textsearch, a Postgres extension that brings proper BM25 ranking to full-text search. It's designed for AI/RAG workloads where search quality directly impacts LLM output. Postgres native ts_rank lacks corpus-aware signals (no IDF, no TF saturation, no length normalization). This causes mediocre documents to rank above excellent matches, which matters when your LLM depends on retrieval quality. Quick example: CREATE EXTENSION pg_textsearch; CREATE INDEX articles_idx ON articles USING bm25(content); SELECT title, content to_bm25query('database performance', 'articles_idx') AS…

    Oct 2025 · docs.tigerdata.com · its alternatives →

17. 17AP
    AI-Powered SQL Tools▲7

    Generate arduous database queries in a snap

    2023 · dbsensei.com · its alternatives →

18. 18PA
    Plisqin, an SQL generator written in Racket▲7

    2018 · docs.racket-lang.org · its alternatives →

19. 19
    Pg_sorted_heap–Physically sorted PostgreSQL with builtin vector search▲10

    Sorted heap table AM for PostgreSQL with zone map scan pruning - skuznetsov/pg_sorted_heap

    Mar 2026 · github.com · its alternatives →

20. 20PE
    PgModeler – EER Diagramming for postgres▲9

    2017 · pgmodeler.com.br · its alternatives →

21. 21MA
    Milvus – An open-source vector similarity search engine▲8

    2020 · milvus.io · its alternatives →

22. 22AS
    A Simple, Serverless Machine Learning API▲7

    2019 · mlrequest.com · its alternatives →

23. 23
    Rust Based Per-Token Late Interaction Dense Search▲8

    Happy to release FastPlaid, which aim to ease and accelerate ColBERT and ColPali retrieval

    2025 · github.com · its alternatives →

24. 24
    Tinyhnsw – The Littlest Vector Database▲17

    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 →

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 →