GO TO A SECTION

↑ ↓ to navigate · Enter to openExplore all sections →
FDEInterviews logo
arXiv preprint

When Large Language Models Meet Vector Databases: A Survey

Vector databases support retrieval, semantic caching and agent memory. Learn what each role requires, where similarity fails and how to test filtered search.

Breakdown by FDE Interviews · 15 min read · Updated

About the original · 2024
AUTHORS
Jing, Su, Han, Yuan, Xu, Liu, Chen, Zhang
FROM
Carnegie Mellon, Purdue, University of Michigan, Harbin Institute of Technology (Shenzhen), Chinese Academy of Sciences, Shandong University of Technology
PUBLISHED
Jan 2024 · arXiv preprint
IN THIS BREAKDOWN · 10 SECTIONS

You can read 13% of this breakdown.

01

The paper in one minute

A support assistant needs to find a refund policy, remember a customer's preferred language and avoid answering the same general question repeatedly. Vector search can help with all of these. The records it retrieves, and the conditions for using them, differ substantially.

This survey organizes the relationship between language models and vector databases around three roles: an external knowledge base, a semantic response cache and a store of longer-term memory. Embeddings represent records as vectors so a query can find nearby representations even when the wording differs. The application then retrieves the associated records and decides what to do with them.

For a knowledge base, the record is evidence used to compose an answer. For a semantic cache, it includes a previous answer that might be reused. For memory, it might be a preference or an event from an earlier interaction. A similar refund question from another customer is unsuitable for answer reuse if the answer depends on that customer's order. A remembered preference can also become wrong after the customer changes it.

The paper is a survey, with a useful taxonomy and discussion of limitations. It offers no controlled benchmark proving that one database makes all these tasks cheaper or more accurate. This explanation uses its June 2025 revision and separates the survey's categories from the application checks an FDE needs to build around them.

THE IDEA, VISUALLY
ONE RETRIEVAL MECHANISM, DIFFERENT DECISIONS A nearby vector identifies a candidate. The application decides whether it can be used. Knowledge retrieval RETRIEVES Source passages BEFORE USE Check access and source version. Keep evidence linked to its source. Generate a grounded answer Semantic cache RETRIEVES Prior question + answer BEFORE USE Match scope and dependencies. Check that the answer still applies. Reuse only if valid Long-term memory RETRIEVES Prior events or preferences BEFORE USE Check identity and provenance. Resolve corrections and expiry. Add relevant context Roles: survey sections 3.1–3.3. Checks: our deployment guidance; similarity alone grants no authority.
An original comparison of the survey's three uses for vector databases (sections 3.1–3.3). The checks below each role are our deployment guidance: retrieving similar material and deciding whether to use it are separate operations.
Research notes: the problem, approach and results
3 roles

knowledge, cache and memory (sections 3.1–3.3)

12 systems

historical product comparison, not a current ranking (Table 1)

6 KiB

1536-dimensional float32 vector (our derivation of section 5's example)

THE PROBLEM

An LLM needs customer knowledge, reusable answers and context from earlier interactions, but each has different rules for safe reuse.

THE IDEA

Use vector similarity to retrieve relevant records, then apply the checks required by the record's purpose.

THE RESULT

A useful map of retrieval, semantic caching and memory. The survey does not establish a universal database winner or a measured improvement for every application.

02

Why it matters to an FDE

“We need a vector database” leaves most of a customer's requirements unresolved. Who may see a retrieved record? How quickly must a policy correction reach the assistant? Can an answer be reused across users? What should happen when a memory contradicts an authoritative source?

Answer those questions before comparing index speeds. A fast nearest-neighbor query can return perfectly similar records that the application cannot use. Conversely, an exact product code may be better served by a structured lookup even when the rest of the workflow uses semantic retrieval.

The survey provides a starting map for those decisions. Read it alongside the vector database concept, then choose one concrete customer operation to evaluate. For a policy assistant, test whether it retrieves current, permitted evidence. For a cache, measure incorrect reuse as well as hit rate. For memory, test a correction and a deletion all the way through to the next response. These are different acceptance tests, even if one storage engine serves every role.

THE FULL BREAKDOWN

Understand the mechanism. Try it on a real problem.

Unlock this breakdown and 199 more papers.

Premium opens every paper in full, plus every answer, concept, course and guide on the site. One payment for six months of access.

6 months · One payment · No auto-renewal

Get Premium · ₹2,000 / $25
  • ◇1 architecture diagram
  • </>2 runnable code blocks
  • ▦3 results tables
  1. 03Key takeaways

    Six decisions that connect vector search to useful, trustworthy application behavior

    Free account
  2. 04How it works

    Follow a query from trusted scope to candidates, stored records and a decision to use them

    Premium
  3. 05The numbers that matter

    The survey's scope, a reproducible storage estimate and the limits of its comparison

    Premium
  4. 06Try it yourself

    Run a small experiment that exposes filtered-search gaps and unsafe cache candidates

    Premium
  5. 07Where it breaks

    Exact identifiers, incompatible embeddings, stale answers and limitations in the source

    Premium
  6. 08Using it on a deployment

    Build a policy assistant with separate contracts for evidence, cache entries and memory

    Premium
  7. 09Interview angles

    Explain the architecture, diagnose missing filtered results and defend cache eligibility

    Premium
Back to the paper library →