What Defines a Vector Database?

Representing complex data like text, images, or audio as high-dimensional vectors (embeddings) allows us to capture semantic meaning. However, the databases we typically use for application development, such as relational databases (like PostgreSQL, MySQL) or even many NoSQL databases (like MongoDB, Cassandra), weren't originally built for the primary task these vectors demand: finding the most similar vectors to a given query vector based on geometric distance or orientation.

Think about a standard SQL query: SELECT * FROM products WHERE category = 'electronics' AND price < 500. This relies on exact matches or comparisons on scalar values organized in structured rows and columns. Traditional indexes, like B-trees, are highly effective for these operations. Searching for text often involves inverted indexes that map keywords to documents.

Vector search operates differently. The fundamental query isn't about matching exact values but finding "neighbors" in a high-dimensional space. Given a query vector $q$, we want to find data vectors $p$ in the database that minimize a distance function, like the Euclidean distance:

$$d(p, q) = \sqrt{\sum_{i=1}^{n}(p_i - q_i)^2}$$

or maximize a similarity function, such as cosine similarity:

$$similarity(p, q) = \frac{p \cdot q}{\|p\| \|q\|}$$

Performing this calculation exhaustively against millions or billions of high-dimensional vectors (where $n$, the dimensionality, can be hundreds or thousands) is computationally infeasible for real-time applications. This is where vector databases come in.

So, what defines a vector database?

A vector database is a database system specifically designed and optimized for the storage, indexing, and querying of high-dimensional vector embeddings alongside, typically, associated metadata.

Key distinguishing characteristics include:

1. Native Vector Support: Vectors are a first-class data type. The database understands how to store and operate on these dense numerical arrays efficiently.
2. Specialized Indexing for Similarity Search: This is perhaps the most defining feature. Vector databases implement Approximate Nearest Neighbor (ANN) algorithms. These algorithms build specialized index structures (which we'll explore in detail in Chapter 3) that allow for rapid searching of vectors similar to a query vector, trading off a small amount of accuracy for massive gains in speed and resource efficiency compared to an exact search.
3. Vector Similarity Queries: The query language or API provides direct methods to perform similarity searches using various distance metrics (e.g., Euclidean distance, cosine similarity, dot product). The goal is to retrieve the top-k most similar vectors to a query vector.
4. Scalability for High Dimensions and Volume: They are architected to handle datasets with potentially billions of vectors, each having hundreds or thousands of dimensions, while maintaining acceptable query latency.
5. Metadata Storage and Filtering: While vectors are central, applications usually need to associate metadata with them (e.g., the original text chunk, product ID, image filename). Vector databases allow storing this metadata alongside the vectors and often support pre-filtering (filtering metadata before the vector search) or post-filtering (filtering the results after the vector search) to refine results.

In essence, while traditional databases are optimized for filtering and retrieving structured data based on exact matches or range comparisons, vector databases are optimized for finding approximate matches in high-dimensional vector spaces based on similarity. They provide the necessary infrastructure to build applications like semantic search, recommendation engines, image retrieval systems, and anomaly detection, which depend heavily on understanding relationships encoded within vector embeddings.

The following sections will examine the internal architecture, data models, and specific operations that enable these capabilities.