Vector database
A store built to find the vectors nearest to a query vector fast, across millions of items.
Comparing a query against every stored embedding is fine for a few thousand documents and too slow past that. A vector database uses approximate nearest-neighbour indexes and returns close matches in milliseconds. You give up a little recall and get a lot of speed.
Qdrant, Weaviate, Milvus and Pinecone are dedicated options. You can also add the capability to a database you already run, with pgvector for PostgreSQL or the vector types in Elasticsearch and Redis. Start there if you can.
Most production systems pair vector search with keyword search, since exact strings such as error codes, SKUs and names are what embeddings handle worst.
Tagged
Where this comes up
Prompts, configs and tutorials in the library that touch this term.
- ConfigClaude
CLAUDE.md for a data pipeline repository
A Claude Code project file that names the pipeline stages, says which scripts touch production data, and lists what needs a human sign-off before it…
- PromptUniversal
Check a SQL query for what it actually does before running it
Explains a query in plain language and flags anything destructive or unbounded. Use it before you run something you did not write against a real…
PostgreSQL MCP server
Lets the model query your database directly. Read-only is the setting that counts, and it is not the default everywhere.
Tested on Claude Sonnet · May 2026
- PromptUniversal
Write a SQL query from a plain question
Produces one query against a schema you provide, and asks a question instead of guessing when the schema is ambiguous.