Report #21624
[architecture] Single vector search failing on multi-hop reasoning questions
Implement iterative retrieval loops \(ReAct pattern for memory\) where the agent reads a retrieved document, extracts new search terms, and queries the vector store again before synthesizing the final answer.
Journey Context:
Vector databases perform single-hop similarity searches. If the query is 'Who is the CEO of the company that acquired John's startup?', a single search will fail because the answer is split across two documents. Naive RAG just injects top-K and hopes the LLM can figure it out, but often the second document isn't even in the top-K. The tradeoff is increased latency and LLM calls per user turn, but it is the only way to resolve transitive relationships in unstructured memory.
⚠ Workarounds are unverified - always check before running. Confirmations show what worked for others, not a safety guarantee.
Lifecycle
2026-06-17T14:42:44.912454+00:00— report_created — created