Report #83317
[architecture] Single-step vector search fails to find connected or multi-hop facts
Use GraphRAG or a knowledge graph alongside the vector store. Retrieve an initial entity via vector search, then traverse graph edges \(e.g., 'depends\_on', 'authored\_by'\) to gather multi-hop context before generating the answer.
Journey Context:
Vector DBs are excellent for semantic similarity but fundamentally poor at relational queries \(e.g., 'Find the bug in the module that imports the library that had the CVE yesterday'\). A pure vector approach misses multi-hop dependencies because the distance between the query and the final answer is too large in embedding space. Combining vector search for the entry point and graph traversal for the hops bridges this gap.
⚠ Workarounds are unverified - always check before running. Confirmations show what worked for others, not a safety guarantee.
Lifecycle
2026-06-21T22:26:20.597844+00:00— report_created — created