Database Sharding and Partitioning Strategies

1. What is a primary advantage of consistent hashing in sharding?

Eliminates the need for backup shards

Reduces data movement when adding or removing shards

Guarantees perfectly balanced load

Simplifies cross-shard joins

2. Which scenario most benefits from sharding?

Small databases with few concurrent users

Very large datasets requiring horizontal scalability

Read-only analytical workloads

Single-server environments

3. True or False: A shard key can be changed after data is distributed.

True

False

Submit

5. What is the main trade-off of vertical partitioning?

Reduced query performance for single-row lookups

Increased disk usage

Difficulty in joins across partitions

Loss of data redundancy

Submit

7. Which sharding strategy is most resilient to hotspot issues?

Range-based sharding

Hash-based sharding with consistent hashing

Directory-based sharding

Time-based sharding

8. True or False: Horizontal partitioning can be applied to a single database server.

True

False

Submit

10. Cross-shard queries present which challenge?

Increased network latency and coordination overhead

Loss of data integrity

Automatic query failure

Reduced encryption security

11. What is the primary difference between horizontal and vertical partitioning?

Horizontal divides rows; vertical divides columns

Horizontal divides columns; vertical divides rows

Horizontal is for backups; vertical is for performance

Horizontal uses keys; vertical uses indexes

Submit

13. True or False: Vertical partitioning always improves query performance.

True

False

14. Which partitioning strategy is best for queries that filter by date range?

Hash partitioning

Range partitioning

List partitioning

Directory-based partitioning

Submit

16. What is a hot shard problem?

A shard that overheats physically

Uneven data distribution causing one shard to receive disproportionate load

A shard with corrupted data

A shard that fails frequently

Submit

18. Sharding introduces which major consistency challenge?

Increased disk space usage

Distributed transactions across multiple shards

Slower write operations

Difficulty in indexing

19. Which factor is most critical when selecting a shard key?

Data type of the column

Even distribution and query patterns

Alphabetical order of values

Column width in bytes

DataSys+ Database Sharding and Partitioning Strategies Quiz

1. What is a primary advantage of consistent hashing in sharding?

2.

What first name or nickname would you like us to use?

2. Which scenario most benefits from sharding?

3. True or False: A shard key can be changed after data is distributed.

4. In list-based partitioning, data is divided based on ____.

5. What is the main trade-off of vertical partitioning?

6. Resharding is necessary when ____.

7. Which sharding strategy is most resilient to hotspot issues?

8. True or False: Horizontal partitioning can be applied to a single database server.

9. In a sharded environment, a ____ is a separate database instance containing a subset of data.

10. Cross-shard queries present which challenge?

11. What is the primary difference between horizontal and vertical partitioning?

12. Directory-based sharding maintains a ____ that maps shard keys to shard locations.

13. True or False: Vertical partitioning always improves query performance.

14. Which partitioning strategy is best for queries that filter by date range?

15. Hash-based sharding uses a ____ function to determine shard placement.

16. What is a hot shard problem?

17. In range-based sharding, data is distributed based on ____.

18. Sharding introduces which major consistency challenge?

19. Which factor is most critical when selecting a shard key?