tag: sharding
articles: 8 · beats: 1
latest: November 17, 2026
---
Sharding
8 Crashtech articles on Sharding, filed under System Design & Architecture, published in November 2026. Every piece is full-text HTML with sources, structured data and an authored FAQ.
All 8 sit in the System Design & Architecture beat. System Design & Architecture
Database Performance is a Trade-Off Ledger: The Hidden Costs of Indexing, Caching, and Sharding
Why every database optimization creates a new liability: the hidden write costs of B-tree indexes, caching stale reads, and sharding operational taxes.
The Scaling Ladder: How Nextdoor Evolved PostgreSQL Through Pooling, Replication, and Sharding
How Nextdoor scaled PostgreSQL from a single server to a multi-tiered architecture: PgBouncer connection pooling, read replicas, and horizontal sharding.
Database Sharding: What It Actually Costs When You Split the Database
Sharding scales a database past one machine's limits, but it changes joins, transactions, and query patterns. Here's what each strategy trades away.

Database Sharding Guide: Horizontal Partitioning, Shard Keys, and Cross-Shard Joins
Why databases resist horizontal scaling: deep dive into database sharding, range vs hash vs directory strategies, cross-shard joins, and resharding.
The Database Scaling Ladder: What to Try First and What Each Rung Costs
Indexes, bigger box, pooling, replicas, caching, vertical split, then sharding. Climb in order, because each rung buys time and adds a new failure mode.
Geosharding: Splitting a Location Search With S2 Cells, Load Containers and Ordered Updates
Why one global index fails for nearby-people search, how S2 cells and the Hilbert curve give contiguous shards, and how to keep moving users consistent.
Scaling MySQL Without Leaving MySQL: A Proxy Layer for Pooling, Routing and Safety
Replica reads, replication lag and cache priming, sharding without app rewrites, query guards and automatic failover, as a MySQL scaling layer provides them.
Moving Live Data Between Shards With Zero Downtime: The Six-Step Protocol
Register, bulk copy, replicate the tail, verify, flip traffic behind a version gate, clean up. How online shard migrations work without losing a write.
Questions we answer about Sharding
- Why is sharding necessary when you could just scale up the database server?
- What's the difference between range-based and hash-based sharding?
- Why do joins get harder after sharding?
- What is a cross-shard transaction, and why is it a real engineering problem?
- How do you pick a good shard key?
- What is the core distinction between database replication and database sharding?
- What are the trade-offs between range-based sharding and hash-based sharding?
- Why are cross-shard joins considered an anti-pattern in sharded architectures?
- What should an engineering team attempt before introducing database sharding?
- What should I try first when my database is slow?
Covered alongside
Frequently asked questions
What does Crashtech publish about Sharding?
8 articles tagged Sharding, the most recent published November 17, 2026. All 8 sit in the System Design & Architecture beat. Each carries numbered sources, an authored FAQ and full structured data.
What questions about Sharding does Crashtech answer directly?
10 questions have a dedicated answer page under this tag, including “Why is sharding necessary when you could just scale up the database server?”. Each answer is authored prose from the article it belongs to, not a generated summary.
Can AI assistants read Crashtech's Sharding coverage?
Yes. Crashtech serves full static HTML to every crawler, allows all major AI user agents in robots.txt, and publishes an llms.txt manifest plus a full-text corpus, so assistants can retrieve and cite these articles directly.