What Is a Vector Database?

A vector database stores data as high-dimensional embeddings and retrieves by similarity rather than exact match, so a query returns the items closest in meaning. It is the retrieval half of retrieval-augmented generation: an agent embeds a question, finds the nearest stored passages, and grounds its answer in them. It is how an agent gives a fixed-size context window access to a corpus far larger than it, and how memory persists across sessions.

Retrieval

By similarity, not exact match

Powers

Retrieval-augmented generation (RAG)

Agent use

Memory beyond the context window

Meaning as geometry

An embedding model maps text (or images, or code) to a point in a high-dimensional space where nearness corresponds to similarity of meaning. A vector database indexes those points so the nearest neighbours of a query can be found quickly across millions of items.

This is why an agent can answer from a knowledge base it was never trained on: it retrieves the relevant passages at query time and reasons over them, rather than relying on what is baked into the model.

Related standards

Questions

Is a vector database a replacement for a normal database?

No. It complements one — relational and document stores handle exact, structured queries; a vector store handles similarity over unstructured meaning.

Does an agent need one to have memory?

Not always, but it is the common way to give an agent durable, searchable memory larger than its context window.