← Back to article

Equation 24 · Naive, Graph, and Agentic: A Systems Comparison of RAG Architectures

What does this equation mean?

CindexC_{\text{index}}

Read the formula alongside the article passage below. Each part has a deeper page with its role in the equation, the supporting passage and nearby citations.

the writing. Read the equation part by part below; each part has a contextual explanation and a link to its mathematical background.

Read it piece by piece

CindexC_{\text{index}}

Symbol C_index

the writing.

Understand this part →

subscript

subscript

The lower label selects a particular version, component, or indexed member of the quantity. For example, x₀ and xₜ can be values at different positions.

Understand this part →

How to interpret it

Read this expression with the definitions, units, and assumptions supplied by the article.

What the article says around this equation

CindexC_{\text{index}} is also the family’s most visible weakness, and the project’s own subsequent work treats it as one worth solving rather than downplaying, which is worth reading as a vendor’s own admission of the problem’s severity. Microsoft’s follow-up post introducing LazyGraphRAG reports — as a vendor claim about the vendor’s own systems, not an independently audited benchmark — that the original approach’s indexing cost was steep enough to motivate a redesign, and states that LazyGraphRAG’s indexing cost is on par with plain vector-based RAG and roughly one part in a thousand of full GraphRAG’s, while its global-search query cost is reported as roughly seven hundred times lower than the…
Read the full surrounding passage
CindexC_{\text{index}} is also the family’s most visible weakness, and the project’s own subsequent work treats it as one worth solving rather than downplaying, which is worth reading as a vendor’s own admission of the problem’s severity. Microsoft’s follow-up post introducing LazyGraphRAG reports — as a vendor claim about the vendor’s own systems, not an independently audited benchmark — that the original approach’s indexing cost was steep enough to motivate a redesign, and states that LazyGraphRAG’s indexing cost is on par with plain vector-based RAG and roughly one part in a thousand of full GraphRAG’s, while its global-search query cost is reported as roughly seven hundred times lower than the original for comparable answer quality, or about four percent of the original’s query cost at a stated evaluation budget [ 6 ] . Read alongside the amortised-cost model above, this is a description of the same CindexC_{\text{index}} term being pushed down by engineering rather than by amortisation, which is a different lever entirely and one the other four families do not have available in the same form, since none of them pays a comparable fixed cost to begin with.

Read the equation in its article →

Sources cited in the surrounding passage

These citations give research context. Read each source to check which claims it supports.

Return to Naive, Graph, and Agentic: A Systems Comparison of RAG Architectures

Browse the mathematical compendium →