Sharding and partitioning in DBMS Theory - Interactive Code Practice

Practice - 5 Tasks

1fill in blank

easy

Complete the sentence to define sharding.

DBMS Theory

Sharding is a method of [1] a database into smaller, faster, and more manageable parts.

Drag options to blanks, or click blank then click option'

Abacking up

Bmerging

Csplitting

Dindexing

Attempts:

3 left

💡 Hint

Common Mistakes

Confusing sharding with merging databases.

Thinking sharding is about backups.

Sharding means splitting a large database into smaller parts called shards to improve performance and manageability.

2fill in blank

medium

Complete the sentence to explain partitioning.

DBMS Theory

Partitioning divides a database table into [1] parts based on certain criteria.

Drag options to blanks, or click blank then click option'

Aunrelated

Brandom

Cphysical

Dlogical

Attempts:

3 left

💡 Hint

Common Mistakes

Assuming partitioning is random.

Confusing physical storage with logical division.

Partitioning splits a table into logical parts, such as by date or region, to organize data efficiently.

3fill in blank

hard

Fix the error in the statement about sharding.

DBMS Theory

Sharding stores all data on a single server to improve speed by [1].

Drag options to blanks, or click blank then click option'

Acompression

Bdistribution

Creplication

Dcentralization

Attempts:

3 left

💡 Hint

Common Mistakes

Thinking sharding means centralizing data.

Confusing sharding with replication.

Sharding distributes data across multiple servers, not stores it all on one server.

4fill in blank

hard

Fill both blanks to complete the sharding example.

DBMS Theory

A common sharding method is to divide data by [1] and store each shard on a separate [2].

Drag options to blanks, or click blank then click option'

Adate

Bregion

Cserver

Dindex

Attempts:

3 left

💡 Hint

Common Mistakes

Using 'date' instead of 'region' for sharding in this example.

Confusing storage location with indexing.

Data is often sharded by region and stored on different servers to improve access and management.

5fill in blank

hard

Fill all three blanks to describe sharding benefits.

DBMS Theory

Sharding improves [1] by [2] data across servers and reduces [3] on each server.

Drag options to blanks, or click blank then click option'

Aperformance

Bdistributing

Cload

Dbackup

Attempts:

3 left

💡 Hint

Common Mistakes

Choosing 'backup' instead of 'load'.

Confusing performance with backup.

Sharding improves performance by distributing data and reducing load on each server.

Practice

1. What is the main difference between sharding and partitioning in databases?

easy

A. Sharding divides data within one database; partitioning spreads data across multiple servers.

B. Partitioning divides data within one database; sharding spreads data across multiple servers.

C. Both sharding and partitioning mean the same and are used interchangeably.

D. Partitioning is used only for backups, while sharding is for data security.

Solution

1. Step 1: Understand partitioning

   Partitioning splits data inside a single database into smaller parts for easier management and faster queries.

2. Step 2: Understand sharding

   Sharding spreads data across multiple servers or machines to handle very large datasets and improve performance.

3. Final Answer:

   Partitioning divides data within one database; sharding spreads data across multiple servers. -> Option B

4. Quick Check:

   Partitioning = single database, Sharding = multiple servers [OK]

Hint: Partitioning = one DB; Sharding = many servers [OK]

Common Mistakes:

• Confusing sharding with partitioning
• Thinking both are the same
• Assuming partitioning involves multiple servers

2. Which of the following is a correct way to describe horizontal partitioning in a database?

easy

A. Splitting a table into multiple tables with the same columns but different rows.

B. Splitting a table into multiple tables with different columns but same rows.

C. Combining multiple tables into one large table.

D. Backing up the entire database to a separate server.

Solution

1. Step 1: Define horizontal partitioning

   Horizontal partitioning means dividing a table by rows, so each partition has the same columns but different sets of rows.

2. Step 2: Check options

   Splitting a table into multiple tables with the same columns but different rows. matches this definition exactly, while others describe different concepts or unrelated actions.

3. Final Answer:

   Splitting a table into multiple tables with the same columns but different rows. -> Option A

4. Quick Check:

   Horizontal partitioning = split rows [OK]

Hint: Horizontal partitioning splits rows, not columns [OK]

Common Mistakes:

• Mixing horizontal with vertical partitioning
• Thinking partitioning means backup
• Confusing rows with columns

3. Consider a database sharded by user ID across three servers: Server 1 stores users with IDs ending in 0-3, Server 2 stores 4-6, and Server 3 stores 7-9. If a query requests data for user ID 27, which server will handle the request?

medium

A. Server 3

B. Server 2

C. Server 1

D. All servers

Solution

1. Step 1: Identify the shard key and ranges

   The sharding is based on the last digit of user ID: 0-3 on Server 1, 4-6 on Server 2, 7-9 on Server 3.

2. Step 2: Find the last digit of user ID 27

   The last digit of 27 is 7, which falls in the 7-9 range assigned to Server 3.

3. Final Answer:

   Server 3 -> Option A

4. Quick Check:

   User ID 27 ends with 7, so Server 3 [OK]

Hint: Check last digit of ID to find server [OK]

Common Mistakes:

• Ignoring the last digit and guessing server
• Choosing all servers instead of one
• Mixing up the shard ranges

4. A database administrator tries to shard a database but notices that some shards have much more data than others, causing slow queries. What is the most likely problem?

medium

A. The backup process is running during queries.

B. The database is not partitioned vertically.

C. The database server hardware is outdated.

D. The shard key is not chosen properly, causing uneven data distribution.

Solution

1. Step 1: Understand shard key role

   The shard key determines how data is split across shards. A poor choice can cause uneven data distribution.

2. Step 2: Analyze the problem

   Uneven shard sizes causing slow queries usually mean the shard key is not distributing data evenly.

3. Final Answer:

   The shard key is not chosen properly, causing uneven data distribution. -> Option D

4. Quick Check:

   Uneven shards = bad shard key choice [OK]

Hint: Uneven shards? Check shard key choice [OK]

Common Mistakes:

• Blaming hardware without checking shard key
• Confusing sharding with partitioning issues
• Ignoring data distribution patterns

5. You have a large customer database that is partitioned by region within a single server. To improve performance and handle growth, you want to shard the data across multiple servers. Which approach best combines partitioning and sharding?

hard

A. Use only partitioning by region on one server; sharding is unnecessary.

B. Partition the database by customer type across servers, and shard data by region within each server.

C. Shard the database by region across servers, and within each server, partition data by customer type.

D. Backup the database regularly instead of sharding or partitioning.

Solution

1. Step 1: Understand combining sharding and partitioning

   Sharding splits data across servers; partitioning splits data inside each server for better management.

2. Step 2: Analyze the best approach

   Sharding by region spreads data geographically, and partitioning by customer type inside each shard improves query speed and organization.

3. Final Answer:

   Shard the database by region across servers, and within each server, partition data by customer type. -> Option C

4. Quick Check:

   Shard by region, partition by type inside servers [OK]

Hint: Shard first, then partition inside shards [OK]

Common Mistakes:

• Mixing up shard and partition levels
• Ignoring partitioning after sharding
• Thinking backup replaces sharding