Why copy data in sorted order when bulk loading?
Databases keep data in B-tree structures. Inserting in key order writes to neighbouring pages, which improves cache use and avoids page splits. Stripe reported roughly a tenfold gain in write throughput from sorting by the most common index attributes before inserting.
Answered in
Moving Live Data Between Shards With Zero Downtime: The Six-Step ProtocolRegister, bulk copy, replicate the tail, verify, flip traffic behind a version gate, clean up. How online shard migrations work without losing a write.
Read the full analysisOther questions this article answers
More system design & architecture questions
- What is the architectural difference between an API Gateway and a Reverse Proxy?
- When should an architecture use Layer 4 instead of Layer 7 load balancing?
- How do edge ingress layers prevent backend cascading thundering herds?
- What algorithm is best for sticky sessions without breaking even distribution?
- How can a CDN improve performance for dynamic requests?
- What is the hardest part of operating behind a CDN?
- How can a CDN help with traffic surges or DDoS attacks?
- What is the difference between a Push CDN and a Pull CDN?
Every answer on Crashtech is written by the editor of the article it comes from — never auto-summarised. Browse all answers or the System Design & Architecture beat.