From Classical Logic to Agentic AI
Selection guide for choosing vector databases by data gravity, deployment model, hybrid search, filtering, and operational weight.
Vector Database Selection is a synthesis article, which means it connects multiple wiki pages into a practical decision guide. Selection guide for choosing vector databases by data gravity, deployment model, hybrid search, filtering, and operational weight. Instead of acting as another inventory or glossary entry, this page introduces the question a team is trying to answer, the constraints that shape the answer, and the proof needed before the recommendation should be trusted.
The introduction highlights vector, search, data, cost, hybrid, pgvector because those terms usually define the trade-off space: architecture fit, operational complexity, governance, observability, cost, and validation effort. A reader should use this page after reading the relevant concepts, entities, and inventories. The value is not just in naming options, but in showing how to choose among them, what risks to inspect, and what experiment would confirm the best path for a real LLM Wiki or AI platform environment.
Vector database selection should start from where the data already lives, how search quality will be measured, and who will operate the system. Benchmarks matter, but production fit usually turns on filtering, hybrid retrieval, tenant isolation, backup/recovery, cost, and team familiarity. ^[inferred]
| Situation | Strong Shortlist | Why |
|---|---|---|
| Managed production RAG with minimal operations | Pinecone, MongoDB Atlas Vector Search, DataStax Astra DB Vector Search | Managed services reduce operational burden when vendor/cloud fit is acceptable. |
| OSS-first vector service | Qdrant, Weaviate, Milvus, OpenSearch Vector Search | Self-hostable options with different scale and search trade-offs. |
| Existing PostgreSQL application | pgvector | Keeps embeddings close to relational data and SQL access patterns. |
| Existing Elastic/OpenSearch search estate | Elasticsearch Vector Search, OpenSearch Vector Search | Hybrid keyword/vector search can reuse search-team expertise. |
| Local or embedded prototyping | Chroma, LanceDB, pgvector | Lower setup cost and good fit for small local retrieval loops. |
| Large-scale distributed vector infrastructure | Milvus, Vespa, OpenSearch Vector Search | More operational weight, but stronger fit for complex scale/search requirements. |
| Cache or session-adjacent semantic lookup | Redis Vector Search | Useful when low-latency state/cache patterns already exist. |
| Criterion | Why It Matters | Questions To Ask |
|---|---|---|
| Data gravity | Moving source data can dominate architecture cost. | Is the content already in PostgreSQL, MongoDB, Elastic, S3, or another platform? |
| Hybrid search | Many enterprise queries need lexical and semantic matching. | Does the system need BM25, sparse vectors, filters, reranking, or all of them? |
| Metadata filtering | RAG often depends on permissions, tenants, timestamps, and document type. | Are filters indexed, expressive, and fast at expected scale? |
| Operations | Self-hosting shifts cost into reliability and tuning. | Who owns upgrades, backups, scaling, observability, and incident response? |
| Tenancy and access control | Retrieval bugs can become data leaks. | Can the store partition customers, projects, or permission scopes safely? |
| Evaluation loop | Search quality must be measured against real queries. | Is there a repeatable eval set for recall, precision, freshness, and citation quality? |
For a small-to-medium RAG app, start with the datastore closest to the application’s existing data. If there is no existing data gravity, choose a managed vector service for speed or an OSS vector database for portability. Move to heavier distributed systems only when scale, latency, hybrid ranking, or governance justify the operational cost. ^[inferred]
Use this rubric before shortlisting vendors. Score each criterion from 1 to 5, then weight based on the workload.
| Criterion | Weight | What A High Score Means |
|---|---|---|
| Data gravity fit | 5 | The vector store sits near the source data or avoids large migration/sync burden |
| Permission filtering | 5 | Tenant/user/document permissions can be enforced at query time without brittle app logic |
| Hybrid retrieval | 4 | Dense, sparse, lexical, filters, and reranking can be composed cleanly |
| Operational maturity | 4 | Backups, scaling, upgrades, monitoring, and incident ownership are clear |
| Cost predictability | 3 | Pricing and capacity are understandable before load grows |
| Ecosystem fit | 3 | Integrates with chosen embeddings, RAG framework, observability, and deployment platform |
| Portability | 2 | Migration path exists if scale, vendor, or architecture changes |
pgvector first.Before moving to reviewed, validate with a small benchmark:
| Test | Minimum Evidence |
|---|---|
| Permission filter test | Queries never return documents outside the allowed tenant/user scope |
| Hybrid relevance test | Compare semantic-only, lexical-only, hybrid, and reranked results on real questions |
| Update/delete test | Changed documents are reflected or removed within the freshness target |
| Operations test | Backup/restore, metrics, and error handling are documented |
| Cost test | Expected monthly cost is estimated from real document and query volume |
draft to reviewed.For the Vector Database Selection synthesis page, practical implementation means using a vector database selection matrix to make a decision path testable. The page should connect concepts, inventories, references, and entities into a clear argument about which vector store fits retrieval and operations constraints, then name the evidence needed before the recommendation is trusted.
Implementation note: this vector database selection matrix should keep the decision about which vector store fits retrieval and operations constraints tied to a validation path where reviewers load sample embeddings, test filtered search, and measure recall.
For the Vector Database Selection synthesis page, the reference pattern is a vector database selection matrix. It should not merely summarize tools; it should explain which vector store fits retrieval and operations constraints, what trade-offs matter, and what proof would validate the choice.
decision_record:
topic: "Vector Database Selection"
artifact: "vector database selection matrix"
decision: "which vector store fits retrieval and operations constraints"
inputs:
- "filtering model"
- "latency target"
- "operations burden"
evaluation:
- "index size"
- "hybrid search need"
- "backup policy"
proof_of_fit: "sample queries meet recall and latency targets with required metadata filters"
next_action: "measure recall"
For example, after updating the related concept and inventory pages, a team can ask $wiki-synthesize to compare the options and then use this page as the durable place for the trade-off, the recommended next experiment, and the evidence needed before adoption.
Vector Database Selection synthesis page should operate as a vector database selection matrix. It owns the decision path for which vector store fits retrieval and operations constraints, so it should be reviewed whenever constraints, tools, or architecture assumptions change.
Operational review should inspect filtering model, latency target, and operations burden, then compare that evidence with index size, hybrid search need, and backup policy.
The synthesis is still trustworthy when reviewers can load sample embeddings, test filtered search, and measure recall. The proof point is that sample queries meet recall and latency targets with required metadata filters.
Review this page whenever source material changes, linked pages are promoted, or a reader would make a different decision because of new information. The review should check content accuracy, link integrity, and whether the operational proof still matches the current LLM Wiki graph.
A reader should leave with a decision path and a concrete validation step.
It helps readers connect related concepts, entity profiles, and inventory candidates into a practical decision path with clear trade-offs.
Define a proof-of-fit scenario, test the riskiest assumption, and record the result back into the wiki so the synthesis remains grounded.
An inventory lists candidates. A synthesis page explains how to choose among them under constraints such as vector, search, data.
Vector Database Selection should end as a decision aid. The article connects concepts, inventories, and entity profiles so readers can understand which option fits a real constraint set rather than simply collecting tool names. Its conclusion should point back to the decision that needs to be made and the proof needed to trust that decision.
The next step is to turn the trade-offs around vector, search, data, cost into a small validation plan: choose the likely path, define what success looks like, test the risky assumption, and feed the result back into the wiki. That loop is what makes a synthesis page operational instead of merely descriptive.