Shard key selection in HLD - Scalability & System Analysis

Scalability Analysis - Shard key selection

Growth Table: Shard Key Selection Impact

Users / Data Size	100 Users	10K Users	1M Users	100M Users
Data Distribution	Single shard or few shards, simple key	Multiple shards, risk of uneven load if poor key	Many shards, key must evenly distribute data	Hundreds/thousands shards, key must avoid hotspots
Query Performance	Direct queries, no cross-shard	Some cross-shard queries if key poorly chosen	Cross-shard queries costly, key must minimize them	Cross-shard queries expensive, key critical for locality
Scalability	Vertical scaling enough	Horizontal scaling starts, key affects balance	Horizontal scaling essential, key affects shard size	Massive horizontal scaling, key must support re-sharding
Maintenance	Simple backups	Shard rebalancing rare	Shard rebalancing needed if key causes hotspots	Frequent re-sharding, key must support smooth migration

First Bottleneck: Uneven Data and Load Distribution

When the shard key is poorly chosen, some shards get much more data or traffic than others. This causes hotspots where a few servers are overloaded while others are idle. This imbalance breaks performance and scalability first, even if hardware is sufficient.

Scaling Solutions for Shard Key Challenges

• Choose a high-cardinality key: Use a key with many unique values to spread data evenly.
• Use composite keys: Combine multiple fields to improve distribution.
• Hash-based sharding: Hash the key to randomize distribution and avoid hotspots.
• Range-based sharding with careful ranges: Define ranges that balance load.
• Re-sharding: Migrate data to new shards when imbalance occurs.
• Caching and read replicas: Reduce load on hot shards by caching frequent queries.
• Monitoring: Continuously monitor shard load to detect imbalance early.

Back-of-Envelope Cost Analysis

Assuming 1M users, each making 1 request per second:

• Total requests per second: ~1,000,000 QPS
• Single shard DB handles ~5,000 QPS → Need ~200 shards
• Storage per user: 1MB → Total 1TB data
• Network bandwidth per shard: 5,000 QPS * 1KB/request ≈ 5MB/s (40Mbps)
• Shard key must evenly distribute 1TB and 5,000 QPS per shard

Interview Tip: Structuring Shard Key Scalability Discussion

Start by explaining what a shard key is and why it matters. Then discuss how poor key choice leads to hotspots and bottlenecks. Next, describe how to pick a good key (high cardinality, hashing, composite keys). Finally, mention monitoring and re-sharding as ongoing solutions. Use examples and relate to real data distribution challenges.

Self Check Question

Your database handles 1000 QPS. Traffic grows 10x to 10,000 QPS. What do you do first?

Answer: Identify if the shard key evenly distributes load. If not, implement or improve sharding with a better key or hashing to spread traffic across more shards. Also consider adding read replicas and caching to reduce load.

Key Result

Shard key selection is critical to evenly distribute data and load across shards. Poor keys cause hotspots that break scalability first. Choosing high-cardinality or hashed keys enables smooth horizontal scaling and efficient resource use.

Practice

1. What is the main purpose of selecting a shard key in a distributed database system?

easy

A. To compress data to save storage space

B. To encrypt data for security purposes

C. To backup data automatically

D. To split data across servers for better load distribution and faster access

Solution

1. Step 1: Understand shard key role

   The shard key determines how data is divided across multiple servers or shards.

2. Step 2: Identify main benefit

   Splitting data helps balance load and speeds up data retrieval by parallelizing queries.

3. Final Answer:

   To split data across servers for better load distribution and faster access -> Option D

4. Quick Check:

   Shard key purpose = split data load [OK]

Hint: Shard key splits data to spread load and speed up access [OK]

Common Mistakes:

• Confusing shard key with encryption key
• Thinking shard key compresses data
• Assuming shard key is for backup

2. Which of the following is a good characteristic of a shard key?

easy

A. Has very few unique values

B. Has many unique values and distributes data evenly

C. Is always a timestamp

D. Is a large text field

Solution

1. Step 1: Identify shard key traits

   A good shard key should have many unique values to avoid data concentration.

2. Step 2: Understand distribution importance

   Even distribution prevents hotspots and balances load across shards.

3. Final Answer:

   Has many unique values and distributes data evenly -> Option B

4. Quick Check:

   Good shard key = unique + even distribution [OK]

Hint: Choose shard keys with many unique values and even spread [OK]

Common Mistakes:

• Picking keys with few unique values causing hotspots
• Assuming timestamp is always best shard key
• Using large text fields that slow down indexing

3. Consider a user database sharded by country_code which has only 5 unique values. What is the likely problem with this shard key?

medium

A. Data will be evenly distributed across shards

B. It will encrypt user data automatically

C. Some shards will be overloaded due to uneven data distribution

D. Queries will be faster because of fewer shards

Solution

1. Step 1: Analyze unique values count

   Only 5 unique values means few shards and many users per shard.

2. Step 2: Understand load distribution

   Popular countries will have more users, causing some shards to be overloaded.

3. Final Answer:

   Some shards will be overloaded due to uneven data distribution -> Option C

4. Quick Check:

   Few unique keys = uneven shard load [OK]

Hint: Few unique shard keys cause uneven load and hotspots [OK]

Common Mistakes:

• Assuming fewer shards always improve speed
• Thinking shard key encrypts data
• Ignoring uneven data distribution effects

4. A system uses user_id % 10 as a shard key but notices uneven shard sizes. What is the likely cause?

medium

A. User IDs are not uniformly distributed modulo 10

B. Shard key is too unique

C. Shard key is a string instead of number

D. System is encrypting shard keys

Solution

1. Step 1: Understand modulo shard key

   Modulo operation expects uniform distribution of user IDs.

2. Step 2: Identify distribution problem

   If user IDs cluster in certain ranges, modulo results cluster causing uneven shards.

3. Final Answer:

   User IDs are not uniformly distributed modulo 10 -> Option A

4. Quick Check:

   Non-uniform IDs cause uneven modulo shard keys [OK]

Hint: Modulo shard keys need uniform input distribution [OK]

Common Mistakes:

• Assuming modulo always balances shards
• Confusing shard key type with encryption
• Ignoring data distribution patterns

5. You design a sharded system for an e-commerce app. Users query orders mostly by user_id and order_date. Which shard key choice best supports fast queries and balanced load?

hard

A. Shard by a composite key of user_id and order_date

B. Shard by user_id only

C. Shard by order_date only

D. Shard by a random UUID

Solution

1. Step 1: Match shard key to query patterns

   Users query by both user_id and order_date, so shard key should support both.

2. Step 2: Evaluate shard key options

   Sharding by user_id alone may cause hotspots; order_date alone may cause uneven load by time.

3. Step 3: Use composite key benefits

   Composite key balances load and supports queries filtering by either field efficiently.

4. Final Answer:

   Shard by a composite key of user_id and order_date -> Option A

5. Quick Check:

   Composite shard key matches queries and balances load [OK]

Hint: Composite keys balance load and match query patterns best [OK]

Common Mistakes:

• Choosing single field shard keys ignoring query patterns
• Using random UUID causing inefficient queries
• Ignoring load balancing in shard key choice