At production scale, exhaustive vector search can become too slow. HNSW is an approximate nearest-neighbor (ANN) indexing method used to speed up top-k similarity search, trading a small amount of recall for much faster queries. section 4.5.3
HNSW is a common default because it tunes well across corpus sizes. The practical choice depends on scale: a flat NumPy array can suit tens of thousands of chunks, an in-process index such as FAISS can suit hundreds of thousands, and a vector database can support multi-tenant production workloads with millions. section 4.5.3
Pinecone, Weaviate, Qdrant, and pgvector are named systems using HNSW. IVF is an alternative associated with FAISS and is noted as better suited to corpora sharded across many machines. HNSW is presented as a practical selection, not explained through graph construction or parameter tuning. section 4.5.3










