Vector databases explained
Evaluate with evidence
Vector databases becomes useful when you can predict its behavior, measure it, and name its limits.
Before you start
Why this matters
Define “good” for Vector databases with one quality metric and one operational metric. Avoid words such as “better” unless you specify how they are measured.
1Learn the idea
Read
Build an evaluation that can disagree
Use these measures: Use recall@k against an exact-search or labeled baseline, precision@k, filter correctness, p95 latency, index build time, memory, freshness lag, and cost. Evaluate downstream answer quality separately from retrieval quality.
An evaluation set should represent the actual decision, including easy cases, common cases, rare costly cases, and adversarial or malformed inputs. Freeze a test set before tuning. If examples repeatedly influence prompt, threshold, or architecture choices, move them into a development set and obtain a fresh test set. Report sample count and uncertainty; a 95% score on 20 examples means only one observed miss and says little about rare failures.
Pair offline quality with online operations. A component can score well offline and fail under concurrency, stale data, changed users, or dependency outages. Slice results by relevant dimensions rather than trusting one average. Always compare with a simple baseline: deterministic rules, keyword search, a smaller model, or the current human workflow.
Read
Apply it to a concrete case
A catalog embeds product descriptions and stores category, region, and tenant metadata. “Waterproof trail shoe” retrieves semantically related items, but a tenant filter is applied inside the query and a lexical component preserves exact model-number matches.
The worked number is for normalized vectors a and b, cosine similarity is a·b; vectors [1,0] and [0.8,0.6] have similarity 0.8 because both have length 1. State the unit and denominator whenever you report it. A percentage without a denominator can conceal a tiny sample; a latency without a percentile can conceal slow users; a similarity score without a labeled task can conceal irrelevant neighbors. Compare the observed value with a threshold chosen before seeing the final test result.
Now test the tempting shortcut. Suppose the team optimizes only the most visible metric. The result may look better while the system becomes less trustworthy. The reason is concrete: Approximate indexes trade a little recall for major speed gains. Higher search breadth improves recall but costs latency. Filtering after vector search can miss eligible results; filtering during search needs index support. A managed service reduces operations while raising cost and portability concerns. This is why the decision record must include both the intended gain and the tolerated regression. If the tolerated regression is unknown, the change is not ready for a consequential workflow.
Read
Decision rules
- Prefer a measured baseline over a persuasive demo.
- Keep versions, inputs, and thresholds reproducible.
- Separate syntactic success from semantic correctness and authorization.
- Escalate or abstain when evidence falls outside the contract.
- Re-evaluate when data, traffic, models, providers, or user goals change.
These rules turn the topic into an engineering decision rather than a slogan. They also make disagreement productive: another person can challenge the assumptions, rerun the evaluation, and reach a documented conclusion.
Read
Read the result honestly
For every percentage, report numerator, denominator, and slice. For every latency, report workload and percentile. For every human rating, define the rubric and check agreement on a shared subset. Compare paired outputs on the same examples when possible; this reduces noise from case difficulty. Investigate regressions, not only the aggregate win. Finally, reserve a fresh set for confirmation after tuning. If the candidate misses a hard safety, authorization, or correctness threshold, a higher average score elsewhere does not compensate—the candidate fails the gate.