How it works
Vector databases store high-dimensional vectors (typically 768-3072 dims) and use approximate nearest-neighbor algorithms (HNSW, IVF) to find the K closest matches to a query vector in milliseconds, even across millions of items.
Example
An e-commerce product Q&A agent embeds 10,000 product specs and reviews into pgvector, then for any customer question retrieves the top-5 most relevant chunks for grounding.
