Skip to content

other

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

Relationships

No evidence-backed relationships are recorded.

Current stories

build1 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
build1 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
Insufficient
Hype gap+5
Incentives
Insufficient
Confidence62
build1 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
Insufficient
Hype gap+55
Incentives55
Confidence45