Chapter CVector databases explainedPage 7 of 8

Vector databases explained

Trace a worked example

Vector databases becomes useful when you can predict its behavior, measure it, and name its limits.

~13 minWorked example

Before you start

Why this matters

For the worked trace, estimate the result before calculating it: 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. Record the assumptions that make the estimate valid.

1Learn the idea

Read

Trace one decision end to end

Scenario: 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.

Write the trace as numbered state transitions, not a polished story:

  1. Capture the input, version, identity, and assumptions.
  2. Apply the mechanism: An embedding model maps content and queries into the same vector space. The database builds an approximate-nearest-neighbor index such as HNSW or an inverted-file variant. At query time it applies tenant or metadata filters, searches candidate neighborhoods, returns IDs and distances, and lets the application fetch source records or rerank results.
  3. Record the relevant controls: embedding model and dimension; similarity metric; index type; HNSW search breadth; candidate top-k; metadata filters; hybrid keyword weight; quantization; replication; and refresh strategy.
  4. Calculate or inspect the intermediate signal: 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.
  5. Compare the result with a baseline and an acceptance threshold.
  6. Store enough evidence to reproduce the decision without storing unnecessary sensitive content.

Now perturb the trace. Change one input to a long, stale, ambiguous, or unauthorized case. A robust design should either continue within its contract or abstain visibly. Silent degradation is worse than a clear refusal because downstream systems may interpret fluent output as verified output.

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

Perform sensitivity analysis

The trace used one set of assumptions. Change one quantity by a realistic amount while holding the others fixed, then recompute the result. Next change a categorical assumption: model version, tenant, language, traffic shape, data freshness, or permission level. Mark which steps remain valid and which must be repeated. This is a stronger test than narrating the happy path because it reveals hidden coupling. Preserve the original and perturbed traces side by side, including intermediate values, so a reviewer can locate the first point at which their behavior diverges.

Checking tutor…

Continue learning · glossary & guides