LinkedIn analytics tracking pixel for AIDOLS AI consulting website performance measurement
Deployment & Operations

Vector Database

A vector database is a database optimized for storing and searching high-dimensional vectors (embeddings) by similarity rather than by exact match — the storage layer of every RAG and semantic-search system.

Full definition

Vector databases use approximate nearest neighbor (ANN) algorithms such as HNSW, IVF, or ScaNN to find the most similar vectors to a query in milliseconds, even across billions of items. Examples include Pinecone, Weaviate, Qdrant, Milvus, pgvector (Postgres extension), and the vector capabilities now bundled into Elastic, MongoDB, and Snowflake. The choice between a dedicated vector DB and a vector-enabled OLTP database is often more about ops than capability.

Why it matters

Vector databases are the new system-of-record for unstructured enterprise content. Every document, email, call transcript, and image becomes a searchable asset once embedded and stored. For executives this is a category-creating data-platform decision, not a tactical infrastructure choice.

Example

A bank embeds 12 million internal documents (policies, manuals, procedures) into a vector database. Employees ask natural-language questions in a chat interface; the system retrieves the top 5 chunks and the LLM answers with citations — replacing what was a 10-million-dollar legacy enterprise-search investment.

Source & further reading

Primary source: Malkov, Yashunin — "Efficient and robust approximate nearest neighbor search using HNSW" (2018).

Citation policy: this entry is part of the AIDOLS AI Implementation Glossary and may be quoted for research, journalism, and education with attribution to aidolsgroup.com/de/glossary/vector-database/.