GraphRAG's hub-node trap: same two-hop Cypher costs 71 DB hits normally, 60,013 on a hub
JeremyCMorgan · x · 2026-10-28
Jeremy Morgan highlights a problem every GraphRAG layer on a real identity graph hits: hop limits bound path length, not fan-out. The same two-hop Cypher query costs 71 DB hits from a normal seed but 60,013 from a hub node. He shares runnable fixes — degree gating and traversal budgets.
More from coding & agent
- Parallel launches Decisions API: web-grounded yes/no answers with confidence scores at $0.001/request — heyshrutimishra · 2026-10-28
- Investor Gavin Baker: Grok Bot is the most impactful AI product at his firm, with 17 bots built — elonmusk · 2026-10-28
- Wes Roth's Blood Bench: AI builds and coaches competing fantasy football teams end to end — Wes Roth · 2026-10-28
- Claude reads my social feeds nightly and shows highlights on an Apple TV dashboard — florianvo · 2026-10-28
- Developer slams Apple: each iOS simulator stores its own Siri model, wasting 25.5 GiB — Dimillian · 2026-10-28
- Show HN: RSI-Gear, a Lego-like composable framework for recursive self-improvement — ethan1998 · 2026-10-28