Sharding is a horizontal scaling technique that partitions data across multiple independent database instances (shards), enabling systems to handle vastly more data and traffic than any single machine could manage. Each shard contains a subset of the total data: with 1 billion transactions across 10 shards, each shard handles 100 million transactions.
Queries route to the appropriate shard based on the shard key. Processing parallelizes across shards. Ten shards can theoretically handle ten times the throughput of a single machine. The challenges are significant. Cross-shard queries require coordinating multiple databases and aggregating results.
Transactions spanning shards need distributed coordination protocols that add complexity and latency. Data distribution must remain balanced; if one shard receives disproportionate traffic, it becomes a bottleneck regardless of other shards' capacity. Choosing the shard key is critical and often irreversible without expensive data migration.
Blockchain sharding applies these concepts to distributed ledgers. Ethereum's roadmap includes danksharding where the network splits into parallel processing lanes, each handling a subset of transactions. This would greatly increase throughput from thousands to potentially millions of transactions per second.
Implementing blockchain sharding is particularly complex because shards must coordinate on cross-shard transactions while maintaining security guarantees. Despite complexity, sharding is one of the most proven scaling techniques in distributed systems. Google, Facebook, and major databases all rely on it.