Skip to content

Data

Vector Database

A database that stores data as numerical embeddings and retrieves by similarity, powering semantic search and RAG.

A vector database stores information as embeddings (long lists of numbers that capture meaning), and finds results by mathematical similarity rather than exact keyword match. Ask it for things "like" a query and it returns the closest vectors, which is what makes semantic search and retrieval-augmented generation possible.

It is a specialised tool, not a replacement for your primary database. In most systems it sits alongside a normal relational store: the relational database holds the source of truth, and the vector index makes it searchable by meaning. Choosing one, sizing it, and keeping it in sync with the source data are the practical decisions.

Working out whether you need Vector Database?

Definitions are the easy part. If you are trying to decide whether Vector Database belongs in your system, describe what you are building and a senior engineer will give you a straight answer, including when the answer is that you do not need it.

  1. 01A senior engineer reads it. Not a form queue, and not an account manager.
  2. 02We reply either with questions or with a straight answer that we are not the right fit.
  3. 03If it looks like a fit, a technical call with the person who would actually run the delivery.
  4. 04Then scope, effort and risk in writing, before anyone signs anything.

Two fields required. We reply to real enquiries. No list, no sequence.