Part 4 of 6 · 4 min read
Comparing the three and choosing
Single-pass, agentic and graph retrieval side by side, with a table for choosing.
Comparing the three
| System | 1 hop | 2 hops | 3 hops | 4 hops | List | No answer | All | Searches | Model calls |
|---|---|---|---|---|---|---|---|---|---|
| single pass | 100% | 0% | 0% | 0% | 50% | 100% | 42% | 1.0 | 2.0 |
| agentic loop | 100% | 100% | 100% | 100% | 100% | 100% | 100% | 2.1 | 3.1 |
| graph | 100% | 83% | 75% | 67% | 100% | 100% | 88% | 0.0 | 1.0 |
| Situation | single pass | agentic | graph |
|---|---|---|---|
| one outdated passage contradicts a current one | 38% | 92% | 79% |
| ... with "newest passage wins" | 42% | 100% | 88% |
| manager changed, graph not rebuilt | n/a | correct | stale answer |
| per-question cost | lowest | highest (loops) | lowest at question time, high at build time |
How to read this:
- The three systems fail for different reasons: single pass for lack of connection, the loop for cost and loop risk, the graph for extraction misses and staleness.
- All three correctly return nothing for the three no-answer questions. In a real system "nothing found" is a decision the agent must be built to make (module 5's gate).
- Accuracy here depends heavily on the choice of corpus. Do not carry any of these percentages elsewhere.
Choosing
| If your questions are... | Start with |
|---|---|
| mostly single-fact lookups | plain hybrid RAG (modules 1 to 3) |
| sometimes chained ("the X of the Y of Z") over changing documents | agentic RAG with a step limit |
| about relationships across a large, fairly stable corpus (org charts, dependencies, citations) or about themes | GraphRAG, accepting build cost |
| both | agentic loop whose tools include a graph query |
Rules of thumb: add the loop only for the question types that need it (route simple questions to single pass, module 4); cap steps and cost; log every search the agent makes, because you will need the trace to debug; and measure retrieval per hop (module 7), not just the final answer.
Practical advice
- Prove the need first. Collect real multi-hop questions and check how many single pass fails.
- Cap the loop: a step limit, a total-cost limit, and a "give up" path that returns a refusal (module 5).
- Verify each hop before using it to write the next query.
- Keep the trace (query, results, decision) as part of the answer's evidence.
- For graphs, test extraction first: sample 50 passages, list the edges a person would expect, and measure what the extractor missed.
- Plan updates. Decide how a changed passage updates the index and the graph (module 9).
- Decide conflict rules (newest wins, authoritative source wins, or show both).
Interview angle
"A user asks 'Which office does the manager of the team that owns service X work in?' and your RAG fails. Why, and what do you do?" The question's words match only the first fact, so one search cannot retrieve the rest; later facts depend on earlier results. Either let an agent retrieve hop by hop, writing each query from the previous result, or pre-compute a knowledge graph and walk it. Then give the trade-offs: the loop is flexible and uses current text but costs latency and can loop or drift, so you cap steps and verify each hop; the graph is cheap per question and good for aggregates and themes but expensive to build, only as good as its extraction, and stale until rebuilt. Add that you would first measure how many real questions are actually multi-hop.
Check yourself
The graph answers 4-hop questions at 67 percent and the agentic loop at 100 percent. Does that mean agentic RAG is better?
Show answer
Not by itself. The imitation planner knows only eleven question shapes, so the loop never plans badly here. The graph's misses come from phrasings its build-time schema did not read. A real planner makes mistakes too.
For the curious Small guard added
The keyword retriever divided by zero on an empty collection; it now returns no results. The stale-graph row in the freshness table is the real lesson: a graph built before a fact changed keeps giving the old answer until it is rebuilt.
What you will use daily at work
| Practice | What it looks like |
|---|---|
| A step limit on the retrieval loop | The agent may search at most a few times, then must answer or say it cannot. |
| Logging each search and its result | When a multi-hop answer is wrong you find the hop that failed. |
| Rebuild schedule for graphs and summaries | Whatever you precompute must be refreshed when documents change (module 9). |