AI CompendiumA public chart of the language
Home / Retrieval & Memory / Vector Database
Retrieval & Memory

Vector Database

also called Vector store

Storage built for finding the nearest vectors, fast.

Definition

A datastore that indexes embeddings and answers approximate nearest-neighbour queries at scale. Examples: pgvector, Pinecone, Weaviate, Qdrant, LanceDB.

For most teams, adding a vector index to the database you already run (pgvector on Postgres) beats operating a separate system. Reach for a dedicated store when scale or filtering demands it.

The choice matters less than people expect, because most are approximate-nearest-neighbour indexes with similar trade-offs between recall, latency and memory. The decision that actually changes outcomes is the chunking and embedding strategy feeding it — a good index over badly split chunks loses to a plain one over well-prepared text.

How people use it
Architecture review.
"We already have Postgres. Start with pgvector. If recall or latency becomes the problem, revisit."
Worked example

When you already have one

A team with PostgreSQL is about to adopt a dedicated vector store.

Add an extension and keep the vectors next to the relational data. One system to back up, one place for permissions to live, and joins against existing tables for free. Adopt a separate store when scale or filtering genuinely demands it, not by default.

Sources
Related terms