[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"branding":3,"analytics":7,"article-a-leaner-graph-rag-that-keeps-queries-in-the-loop":10,"sections":34},{"siteName":4,"siteTagline":5,"publisherName":4,"contactEmail":6},"The Revision","Tech news, decoded.","editor@therevision.news",{"gaMeasurementId":8,"adsenseClientId":9},"G-ZW2MV82GYR","ca-pub-8533917693782264",{"article":11},{"id":12,"slug":13,"title":14,"dek":15,"body_md":16,"tags_json":17,"published_at":18,"created_at":19,"updated_at":20,"status":21,"review_note":22,"review_notes":23,"image_url":22,"persona_id":22,"persona_name":22,"section":24,"tags":25,"sources":29,"feedback":33,"feedback_at":22,"cost_usd":33,"total_tokens":33},2766,"a-leaner-graph-rag-that-keeps-queries-in-the-loop","A Leaner Graph RAG That Keeps Queries in the Loop","A new spreading-activation method matches the accuracy of heavier knowledge-graph retrieval systems while running entirely inside the database.","A research team has proposed a knowledge-graph retrieval method that stays query-aware at every step — without the memory overhead most competing systems require.\n\nMost graph-based retrieval-augmented generation systems use the question only to pick starting nodes, then wander the graph on structural cues alone, blind to what was actually asked. The dominant query-aware alternative, QAFD-RAG, fixes that with a flow-diffusion solver, but the approach demands loading the entire graph into Python memory and runs an iterative solver with an unpredictable step count — awkward to integrate with a live database. The new method replaces that machinery with a single semantic gate: at each traversal step, a cosine similarity score between a candidate node's description and the original question controls how far activation spreads. The entire retrieval pipeline — seed selection, propagation, top-K ranking, context assembly — runs as one Cypher query in a single round-trip to Neo4j.\n\nThe engineering tradeoff matters beyond benchmark scores. Keeping the graph inside the database rather than hoisting it into application memory changes the operational profile of a production system: less RAM, fewer moving parts, and a fixed iteration count that makes latency predictable. On MuSiQue, the method lands within one exact-match point of QAFD-RAG (32.80 vs. 33.50) while beating the structural baseline HippoRAG by 5.3 EM and 3.4 F1; an ablation with the semantic gate disabled shows it accounts for 3.6 to 7.4 F1 points of gain and a 1.5x to 4.9x latency reduction.\n\nThe approach does not universally dominate — HippoRAG and QAFD-RAG hold an edge on 2WikiMultiHopQA thanks to their phrase-node designs — so teams working on that benchmark should treat this as one option among several, not a drop-in replacement.","[\"ai\",\"knowledge-graphs\",\"retrieval-augmented-generation\",\"research\"]","2026-06-30T04:00:00.000Z","2026-06-30T12:21:16.212Z","2026-06-30T12:21:19.190Z","published",null,[],"ai",[24,26,27,28],"knowledge-graphs","retrieval-augmented-generation","research",[30],{"name":31,"url":32},"arXiv cs.AI","https:\u002F\u002Farxiv.org\u002Fabs\u002F2606.30133",0,{"sections":35},[36,40,45,50,55,60,65,70,75,80,85,89,94,99],{"name":37,"slug":24,"count":38,"latest_published_at":39},"AI",2590,"2026-07-16T04:00:00.000Z",{"name":41,"slug":42,"count":43,"latest_published_at":44},"Security","security",294,"2026-07-15T19:59:48.000Z",{"name":46,"slug":47,"count":48,"latest_published_at":49},"Deals","deals",179,"2026-06-29T20:02:07.000Z",{"name":51,"slug":52,"count":53,"latest_published_at":54},"Policy","policy",158,"2026-07-16T00:02:48.000Z",{"name":56,"slug":57,"count":58,"latest_published_at":59},"Hardware","hardware",122,"2026-07-14T19:46:26.000Z",{"name":61,"slug":62,"count":63,"latest_published_at":64},"Consumer Tech","consumer-tech",93,"2026-07-13T13:20:48.000Z",{"name":66,"slug":67,"count":68,"latest_published_at":69},"Software","software",70,"2026-07-13T19:52:25.000Z",{"name":71,"slug":72,"count":73,"latest_published_at":74},"Science","science",66,"2026-07-10T10:29:37.000Z",{"name":76,"slug":77,"count":78,"latest_published_at":79},"Dev Tools","dev-tools",59,"2026-07-07T04:00:00.000Z",{"name":81,"slug":82,"count":83,"latest_published_at":84},"Gaming","gaming",41,"2026-07-09T04:00:00.000Z",{"name":86,"slug":87,"count":83,"latest_published_at":88},"Startups","startups","2026-06-29T20:55:50.000Z",{"name":90,"slug":91,"count":92,"latest_published_at":93},"General","general",29,"2026-07-10T22:28:58.000Z",{"name":95,"slug":96,"count":97,"latest_published_at":98},"Reviews","reviews",20,"2026-06-24T12:00:01.000Z",{"name":100,"slug":101,"count":102,"latest_published_at":103},"How-To","how-to",6,"2026-06-16T09:00:00.000Z"]