GraphRAG without a knowledge graph
When someone says “We beat GraphRAG without a knowledge graph” I’m all ears. CogBase posted last week a benchmark showing their chunk-and-retrieve pipeline nearly matched graph-based RAG systems on GraphRAG-Bench.
Let’s be precise about what they actually show. They do extract entity-relation triples in their best-performing config. They just don’t resolve, deduplicate, or traverse them, the graph structure is discarded after extraction. That’s a build decision, not evidence that graph structure adds no value.
More importantly, look at what the GraphRAG-Bench tests. Fact retrieval, summarization, and bounded multi-hop reasoning over novels and a medical corpus. Clean, scoped, well-behaved corpora. That’s exactly the workload where a capable LLM with good vector retrieval closes the gap on its own.
A knowledge graph earns its cost at a different problem boundary. Among other things, the cross-document entity identity that no single chunk can resolve. Reasoning about relationship chains that never co-occur in context. Tracking what changed, bitemporal reasoning over evolving document corpora. Knowing what’s absent, not just what’s present.
CogBase has not tested any of this and so, the honest reading of this result is that for shallow QA over a single well-scoped corpus, flat retrieval is competitive. That’s common wisdom, it’s not a refutation of graph structure. It’s a benchmark that doesn’t stress the properties graphs are built for.