# HNSW
A multilayer graph index used for Approximate Nearest Neighbor (ANN) searches. It offers high performance and superior speed-recall tradeoffs, though it requires more memory and has slower build times than simpler methods.
---
_First compiled from job `4bea023b` on 2026-04-10T19:21:54Z._
## Update from job `5d226c4b` (2026-04-10T19:22:16Z)
A graph-based algorithm designed for Approximate Nearest Neighbor (ANN) search in high-dimensional vector spaces. It utilizes a multi-layered hierarchical structure to enable fast and scalable similarity searches for embeddings.
## Update from job `4bea023b` (2026-04-10T19:38:37Z)
A multilayer graph index used for Approximate Nearest Neighbor (ANN) searches. It offers high performance and superior speed-recall tradeoffs, though it requires more memory and has slower build times than simpler methods.
## Update from job `5d226c4b` (2026-04-10T19:38:55Z)
A graph-based algorithm designed for Approximate Nearest Neighbor (ANN) search in high-dimensional vector spaces. It utilizes a multi-layered hierarchical structure to enable fast, scalable similarity searches for embeddings.
## Update from job `4bea023b` (2026-04-11T14:23:49Z)
A multilayer graph index used for Approximate Nearest Neighbor search within pgvector. This mechanism offers high performance and superior speed-recall tradeoffs, though it requires more memory and slower build times than simpler methods.
## Update from job `5d226c4b` (2026-04-11T14:24:22Z)
A graph-based algorithm designed for Approximate Nearest Neighbor (ANN) search in high-dimensional vector spaces. It utilizes a multi-layered hierarchical structure to balance low-latency queries with high search accuracy.