Vector databases are specialized data storage systems optimized for high-dimensional vector embeddings, enabling fast similarity search at scale. Unlike traditional databases that retrieve exact matches through structured queries, vector databases find semantically similar items by computing distances between numerical representations of unstructured data like text, images, audio, and video. They power modern AI applications—from retrieval-augmented generation (RAG) systems that ground large language models in factual knowledge, to agentic AI with persistent memory, recommendation engines, semantic and multimodal search, and real-time anomaly detection. As the AI industry matures, vector databases are becoming load-bearing production infrastructure—with advances in quantization (RaBitQ achieving 32× compression at 95% recall), disk-based indexing (DiskANN), natively multimodal embeddings (Gemini Embedding 2, Jina v4), and advanced RAG architectures (GraphRAG, Agentic RAG) reshaping what these systems can achieve. The key insight: by representing complex data as points in a multi-dimensional space, vector databases make "meaning" mathematically searchable, transforming how applications discover and retrieve relevant information.
What This Cheat Sheet Covers
This topic spans 21 focused tables and 136 indexed concepts. Below is a complete table-by-table outline of this topic, spanning foundational concepts through advanced details.
Table 1: Core Concepts
| Concept | Example | Description |
|---|---|---|
[0.21, -0.45, 0.88, ..., 0.12] (768 dims) | • Numerical representation of data as a high-dimensional array of floats • captures semantic meaning so similar items cluster together in vector space | |
Find top 10 images most similar to query image | • Core operation that retrieves nearest neighbors by computing distance between query vector and database vectors • returns k most similar items | |
[0.23, 0.41, ..., 0.19] (every dimension has value) | • Vector where most or all dimensions contain non-zero values • generated by neural networks (BERT, Sentence Transformers) • captures rich semantic information | |
{42: 0.8, 137: 1.2, 891: 0.5} (mostly zeros) | • Vector with few non-zero values stored as key-value pairs • learned sparse models (SPLADE, BGE-M3) outperform BM25 • efficient for keyword-aware representations | |
384, 768, 1536, 3072 dimensions | • Number of elements in a vector • higher dimensions capture more nuance but increase storage and computation • modern models support flexible dims via MRL (e.g., 3072 → 768) |