Skip to content

HNSW

HNSW (Hierarchical Navigable Small World) is a graph-based algorithm for approximate nearest-neighbor search, used to index vector embeddings in databases.

Known aliases

  • Hierarchical Navigable Small World
  • Hierarchical Navigable Small Worlds
  • HNSW

Current stories

buildOne report1 publisher

Turbopuffer v3 demotes the ANN index to one secondary index among several

Turbopuffer is rewriting its serverless database as v3, moving the ANN index out of the core of storage and making it one of several secondary indexes. A dev.to explainer of the September 30 post says the vector-first layout held back GROUP BY and aggregation queries.

Publishers:dev.to

Reality

Evidence40
Adoption25
Hype gap+35
Incentives45
Confidence50
buildOne report1 publisher

Full-precision embeddings push a 100-million-vector OpenSearch index to 1.3 TB of RAM

Amazon OpenSearch Service needs about 1.3 TB of resident RAM for 100 million 1,536-dimension FP32 vectors with one replica, a dev.to sizing post calculates. Raw vector values are about 98% of each entry, so the encoding picked before ingestion decides most of that memory and the node count behind it.

Publishers:dev.to

Reality

Evidence58
Adoption
Not scored
Hype gap+5
Incentives
Not scored
Confidence62
buildOne report1 publisher

Mandi benchmark scores pre-, post- and in-index vector filtering against exact search on 120,000 listings

Open-source benchmark grades pre-filtering, post-filtering and Qdrant's in-index filtering on 120,000 mandi listings against exact brute-force neighbours. Filter placement is the only variable it changes, but the supplied write-up ends before any recall or latency figures.

Publishers:dev.to

Reality

Evidence25
Adoption
Not scored
Hype gap+10
Incentives
Not scored
Confidence30
buildOne report1 publisher

Serving RAG retrieval as a cacheable GET lets an edge proxy absorb repeat lookups

Password-reset queries made up 38% of one support RAG bot's vector lookups, says a dev.to write-up that moves retrieval behind an HTTP cache. Any saving depends on identical queries repeating within one tenant inside five minutes.

Publishers:dev.to

Reality

Evidence35
Adoption
Not scored
Hype gap+30
Incentives70
Confidence40
buildOne report1 publisher

Post-filtering a RAG query spends its LIMIT 10 on chunks the user cannot read

A dev.to walkthrough of a permission-aware Postgres project puts the ACL test in a CTE that the vector ranking reads from, so the nearest-neighbour search only ever orders rows the caller may see.

Publishers:dev.to

Reality

Evidence72
Adoption
Not scored
Hype gap+10
Incentives35
Confidence66
buildOne report1 publisher

A dedicated vector database adds a sync job to every write

A dev.to post argues that moving embeddings out of Postgres buys a second source of truth, a four-leg query path and 50 to 150 ms of internet latency. Its 8 ms pgvector counter-figure has no benchmark behind it.

Publishers:dev.to

Reality

Evidence24
Adoption
Not scored
Hype gap+55
Incentives55
Confidence45
buildOne report1 publisher

Pinecone charges about 72 read units for one query against a 10M-vector index

A September 2026 comparison pins the workload at 10 million 1536-dimension vectors and reports Qdrant between $250 and $947 a month, while Pinecone's serverless bill is set by the gigabytes each query scans.

Publishers:dev.to

Reality

Evidence38
Adoption
Not scored
Hype gap+24
Incentives62
Confidence52
buildOne report1 publisher

Aurora pgvector caps Bedrock Knowledge Bases at 2,000 dimensions in single precision

AWS's comparison of the three customer-managed backends credits OpenSearch with in-memory speed and S3 Vectors with sub-second queries at up to 90 percent lower storage cost. The Aurora spec sets a ceiling your embedding model has to fit under.

Publishers:aws.amazon.com

Reality

Evidence46
Adoption20
Hype gap+30
Incentives85
Confidence55
buildOne report1 publisher

ACORN moves the filter into the HNSW graph walk with predicate subgraph traversal

The paper reports 2 to 1,000 times the throughput of prior filtered-search methods at fixed recall, and says an existing HNSW library is enough to implement it. Both claims turn on how the graph is built.

Publishers:arxiv.org

Reality

Evidence46
Adoption
Not scored
Hype gap+35
Incentives65
Confidence50
buildOne report1 publisher

pgvector's cost-based planner picks approximate scans where exact scans hit perfect recall

A three-engine evaluation of filtered vector search on a purpose-built relational dataset credits Milvus's hybrid approximate/exact execution with stable recall, and puts pgvector's plan choice ahead of its index choice as the thing that loses it.

Publishers:arxiv.org

Reality

Evidence52
Adoption
Not scored
Hype gap+10
Incentives32
Confidence55
buildOne report1 publisher

JSONB and pgvector cover two of the five roles this Postgres consolidation absorbs

A dev.to design guide moves JSON documents and vector search into one PostgreSQL instance, and the evidence it offers is operational: deleted ETL pipelines and sync bugs, with no query timings on either side.

Publishers:dev.to

Reality

Evidence35
Adoption
Not scored
Hype gap+30
Incentives20
Confidence55
buildOne report1 publisher

Co-locating embeddings with permissions collapses the RAG fetch into one SQL statement

A dev.to walkthrough builds the whole retrieval path on pgvector and the azure_ai extension inside Azure Database for PostgreSQL. The costs land in the DDL, the extension allowlist, and a transaction that waits on an HTTP call.

Publishers:dev.to

Reality

Evidence42
Adoption
Not scored
Hype gap+28
Incentives55
Confidence55
buildOne report1 publisher

A Postgres default of 40 caps how many neighbors your vector search can return

pgvector ships hnsw.ef_search at 40, the size of the candidate list its graph walk keeps in flight, and a top-20 query with a tenant filter can come back with two rows and no error to explain it.

Publishers:dev.to

Reality

Evidence62
Adoption
Not scored
Hype gap+12
Incentives20
Confidence58
buildOne report1 publisher

One Postgres column replaced the sync pipeline that kept the vector store in step

The dedicated store won every unfiltered benchmark this team ran, which happened to be the one query their product never issued. What they were paying for was a copy of derived data that could disagree with its source in silence.

Publishers:dev.to

Reality

Evidence42
Adoption22
Hype gap+20
Incentives30
Confidence48
buildOne report1 publisher

LatticeDB's traversal speed margin over SQLite narrows by three hops, then widens sharply by depth ten

An independent rebuild of the SQLite side says the gap is real, but the published tables measure two different queries on two different graphs, so the depth at which SQLite's plan collapses on your data is a number you have to take yourself.

Publishers:dev.to

Reality

Evidence55
Adoption10
Hype gap+30
Incentives60
Confidence50
buildOne report1 publisher

The model was fine: a 3-second P99 at 740K ops/sec was reads queueing behind writes

One engineer's trading app hit a three-second P99 tail while average latency looked healthy. The cause sat in Postgres and the feature lookups, not the model, and cache tuning could not reach it.

Publishers:thenewstack.io

Reality

Evidence34
Adoption
Not scored
Hype gap+18
Incentives72
Confidence42
buildOne report1 publisher

DuckDB's vss extension removes a database from your RAG stack, then names the price

HNSW indexing runs inside the SQL engine, so there is no second service and no network hop. There is also no index persistence unless you turn on an experimental flag.

Publishers:dev.to

Reality

Evidence58
Adoption
Not scored
Hype gap+12
Incentives
Not scored
Confidence52