Hash partitioning cuts Neo4j parallel import from 250.6s to 186.5s on 3.2M rows
JeremyCMorgan · x · 2026-11-03
A hands-on engineering writeup on speeding up parallel Neo4j imports: instead of fighting deadlocks and retries, the author used hash-based partitioning and conflict-free scheduling, cutting a 3.2M-row import from 250.6s to 186.5s. One relationship type jumped from 10.9k to 69k writes/sec. Full details in the linked post.
More from Infra
- Your $99 Apple developer account hides 1PB CloudKit, 25hrs CI/mo and an on-device LLM — vincent_koc · 2026-11-03
- Marvell inks record-breaking $115B AI deal — LinkedInNews · 2026-11-03
- Hugging Face Kernels primer: load optimized CUDA kernels from the Hub in one line — ariG23498 · 2026-11-03
- ai& x AMD host one-day Tokyo hackathon with ¥10.2M in credits, 750K JPY tokens per winner — DavidBennett__ · 2026-11-03
- Musk mocks compute-satellite heat dissipation skeptics: 'They'll never get a job at SpaceX' — elonmusk · 2026-11-03
- tinygrad's exabox drops to $5M: 256x MI300X, 669 PFLOPS, delivery Q3 2027 — andrew_n_carr · 2026-11-03