Editing Embeddings Vector Dbs (section)

== <span style="color: #FFFFFF;">Understanding</span> ==
The magic of embeddings is that they transform the hard problem of semantic similarity into simple geometric distance. After training on massive amounts of text data (or image-text pairs), embedding models learn to place words, sentences, and documents that mean similar things close together in a high-dimensional space.

The classic demonstration: In a good word embedding space:
* "king" - "man" + "woman" ≈ "queen"
* "Paris" - "France" + "Italy" ≈ "Rome"

This isn't hardcoded — it emerges from the statistical patterns of how words co-occur in language.

'''Why not use keyword search?''' Keywords match exact strings. Semantic search understands meaning. A query for "cardiac event" will find documents about "heart attack" via embeddings; keyword search would miss this unless the exact phrase appears.

'''How vector databases work''': Storing millions of embedding vectors and doing exact search (computing cosine similarity against every stored vector) would be too slow. ANN algorithms solve this by building smart index structures. HNSW (Hierarchical Navigable Small World) builds a layered graph where each layer is a sparser approximation of the dense lower layer — like a highway system where you first navigate between cities (coarse layer) then between neighborhoods (fine layer). This achieves sub-millisecond query times on millions of vectors.

'''Hybrid search''' combines vector (semantic) search with BM25 keyword search, using a Reciprocal Rank Fusion (RRF) algorithm to merge results. This consistently outperforms either approach alone, because different query types benefit from different retrieval mechanisms.
</div>

<div style="background-color: #8B0000; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">