How it works
An embedding model maps content into a fixed-dimension space where distance approximates semantic similarity. The index makes search sub-linear: HNSW builds a navigable small-world graph, IVF partitions the space into clusters and searches a few. Both expose a recall-versus-latency dial, and both need filtering support so results can be restricted by tenant, permission or date without destroying recall.
Example
"How do I cancel?" should retrieve a passage titled "Ending your subscription" — no shared keywords, close in embedding space. The same mechanism fails on "error 0x80070005", where the exact token is the whole query. That is the case for hybrid retrieval, and it is why dedicated vector stores and vector extensions to existing databases both remain viable choices.
Why it matters
The choice is usually operational rather than algorithmic: does the workload need a separate service, or is a vector index inside the existing database enough? Data volume, filtering complexity, update rate and the cost of a second system to operate decide it — not benchmark queries per second.
