MySQL recursive CTEs time out at 500M rows; C# BFS answers in 2.7ms vs NebulaGraph 23.6ms
JeremyCMorgan · x · 2026-10-28
A production war story plus a reproducible benchmark comparing graph workloads in MySQL vs NebulaGraph.
- At 500M rows, MySQL recursive CTEs timed out on every 6-hop query; single-relationship lookups took 15 minutes on a $15-20k/month AWS VM
- Moving to graph DBs (ArangoDB → Neo4j → NebulaGraph) cut queries to seconds; benchmark: CBFS 2.7ms, NebulaGraph 23.6ms
- Key insight: the real boundary is point lookups vs wide neighborhoods, not SQL vs graph
- All code and raw results are open on GitHub
More from Infra
- SpaceX eyed as largest VR200 buyer in 2027: 20K racks, ~$300B total — bookwormengr · 2026-10-28
- Token demand on OpenRouter grew 27x to 165T weekly, open models now serve 72% — FinanceYF5 · 2026-10-28
- AI's unusual bet: buying compute for years, selling intelligence by the token — vaibhavbetter · 2026-10-28
- OpenAI's Will Depue says compute locks in US primacy as 'end of human history' nears — willdepue · 2026-10-28
- Malaysia has overtaken Singapore in data center capacity, planned buildout 10x — bytebot · 2026-10-28
- Why Cloudflare Is the Best Platform to Build AI Agent Operating Systems — ritakozlov · 2026-10-28