Vector embeddings convert real-world content, like documents and images, into 1-D numerical representations (arrays). These arrays have N values, representing N dimensions. They are called vectors and can be compared with each other efficiently. These vectors aren’t random blobs of numbers. They live in a semantic multi-dimensional space, and their position encodes real meaning.
Key Takeaways ● Vector embeddings = position in a multi-dimensional space. ● Each axis can be thought of as representing a property: realism, length, time, and popularity. ● Similar vectors = semantically similar content. ● Clusters = emergent structure from data, not hard-coded.
Key Takeaways ● Vector compression allows fast, scalable search. ● PQ: Sub-vector + codebook trick (most powerful). ● SQ: Per-float quantization. ● INT8: Hardware-friendly, model-compatible. ● Always balance: size vs recall vs latency.
Step 1: Embed the Query
Step 2: Search the Index
we use ANN (Approximate Nearest Neighbor) indexes like IVF and HNSW.
Step 3: Score & Rank For each candidate vector from the index, compute a similarity score using either: