{"id":1106013,"date":"2024-11-25T09:00:00","date_gmt":"2024-11-25T17:00:00","guid":{"rendered":"https:\/\/www.microsoft.com\/en-us\/research\/?p=1106013"},"modified":"2024-11-25T08:23:08","modified_gmt":"2024-11-25T16:23:08","slug":"lazygraphrag-setting-a-new-standard-for-quality-and-cost","status":"publish","type":"post","link":"https:\/\/www.microsoft.com\/en-us\/research\/blog\/lazygraphrag-setting-a-new-standard-for-quality-and-cost\/","title":{"rendered":"LazyGraphRAG: Setting a new standard for quality and cost"},"content":{"rendered":"\n
\"A<\/figure>\n\n\n\n

Affordable GraphRAG for every use case<\/h2>\n\n\n\n

The GraphRAG project (opens in new tab)<\/span><\/a> aims to expand the class of questions that AI systems can answer over private datasets by leveraging the implicit relationships within unstructured text. <\/p>\n\n\n\n

A key advantage of GraphRAG over conventional vector RAG (or \u201csemantic search\u201d) is its ability to answer global<\/em> queries<\/em> that address the entire dataset, such as \u201cwhat are the main themes in the data?\u201d, or \u201cwhat are the most important implications for X?\u201d. Conversely, vector RAG excels for local<\/em> queries<\/em> where the answer resembles the query and can be found within specific text regions, as is typically the case for \u201cwho\u201d, \u201cwhat\u201d, \u201cwhen\u201d, and \u201cwhere\u201d questions. <\/p>\n\n\n\n

In recent blog posts, we have shared two new query mechanisms that exploit the rich, summary-based data index created by GraphRAG to improve local search performance<\/a> and global search costs<\/a>, respectively. <\/p>\n\n\n\n

In this blog post, we introduce a radically different approach to graph-enabled RAG that requires no prior summarization of the source data, avoiding the up-front indexing costs that may be prohibitive for some users and use cases. We call this approach \u201cLazyGraphRAG\u201d. <\/p>\n\n\n\n

A key advantage of LazyGraphRAG is its inherent scalability in terms of both cost and quality. Across a range of competing methods (standard vector RAG, RAPTOR (opens in new tab)<\/span><\/a>, and GraphRAG local (opens in new tab)<\/span><\/a>, global (opens in new tab)<\/span><\/a>, and DRIFT (opens in new tab)<\/span><\/a> search mechanisms), LazyGraphRAG shows strong performance across the cost-quality spectrum as follows: <\/p>\n\n\n\n