Input splits and data locality in Hadoop - Practice Problems & Coding Challenges

Challenge - 5 Problems

🧠 Conceptual

intermediate

Understanding Input Splits in Hadoop

In Hadoop MapReduce, what is the primary purpose of input splits?

A To store the output data after processing

B To compress data before sending it to reducers

C To divide the input data into manageable chunks for parallel processing

D To replicate data across nodes for fault tolerance

💡 Hint

Think about how Hadoop processes large datasets efficiently.

Input splits break the input data into smaller pieces so that each mapper can process a chunk independently, enabling parallelism.

🧠 Conceptual

intermediate

Data Locality Importance

Why is data locality important in Hadoop's processing model?

A It ensures data is encrypted during processing

B It reduces network traffic by processing data on the node where it is stored

C It balances the load evenly across all nodes regardless of data location

D It compresses data to save storage space

💡 Hint

Consider how moving computation close to data affects performance.

Data locality reduces the need to transfer large data over the network, improving speed and efficiency.

❓ data_output

advanced

Input Split Sizes Calculation

Given a 640 MB file stored in HDFS with a block size of 128 MB, how many input splits will Hadoop create by default?

A 5

B 4

C 6

D 8

💡 Hint

Divide the total file size by the block size.

640 MB / 128 MB = 5 splits, each corresponding to one block.

❓ Predict Output

advanced

Effect of Custom InputFormat on Splits

Consider this Hadoop MapReduce job snippet using a custom InputFormat that combines small files into larger splits:

job.setInputFormatClass(CombineFileInputFormat.class);

If the input directory contains 10 files of 10 MB each and the block size is 128 MB, how many input splits will be created?

A 5

B 10

C 0

D 1

💡 Hint

CombineFileInputFormat merges small files into splits up to block size.

Since total size is 100 MB, less than 128 MB block size, CombineFileInputFormat creates one split.

🚀 Application

expert

Optimizing Data Locality in a Hadoop Cluster

You have a Hadoop cluster with 5 nodes. A large dataset is stored unevenly: 80% on node 1, and the rest spread across nodes 2-5. You want to maximize data locality for a MapReduce job. Which strategy will best improve data locality?

A Distribute the dataset evenly across all nodes before running the job

B Run all mappers only on node 1 to process the majority of data

C Increase the number of reducers to balance the load

D Compress the dataset to reduce its size

💡 Hint

Think about how data distribution affects task assignment.

Evenly distributing data allows mappers to run on multiple nodes close to their data, improving locality and parallelism.

Practice

1. What is the main purpose of input splits in Hadoop?

easy

A. To compress data files for storage efficiency

B. To backup data to multiple locations

C. To encrypt data for security

D. To divide large data into smaller chunks for parallel processing

Solution

1. Step 1: Understand input splits concept

   Input splits break large data into smaller parts so multiple tasks can process them at the same time.

2. Step 2: Compare options with input splits purpose

   Only dividing data for parallel processing matches the input splits function.

3. Final Answer:

   To divide large data into smaller chunks for parallel processing -> Option D

4. Quick Check:

   Input splits = divide data for parallel tasks [OK]

Hint: Input splits break data for parallel work [OK]

Common Mistakes:

• Confusing input splits with data compression
• Thinking input splits encrypt data
• Mixing input splits with backup processes

2. Which of the following is the correct way to describe data locality in Hadoop?

easy

A. Running tasks close to where data is stored to reduce network traffic

B. Running tasks on nodes far from the data to balance load

C. Copying data to all nodes before processing

D. Encrypting data before processing

Solution

1. Step 1: Define data locality

   Data locality means running processing tasks near the data location to save time and network resources.

2. Step 2: Match definition with options

   Only Running tasks close to where data is stored to reduce network traffic describes running tasks close to data to reduce network traffic.

3. Final Answer:

   Running tasks close to where data is stored to reduce network traffic -> Option A

4. Quick Check:

   Data locality = run tasks near data [OK]

Hint: Data locality means processing near data location [OK]

Common Mistakes:

• Thinking data locality means copying data everywhere
• Confusing data locality with encryption
• Believing tasks run far from data for load balancing

3. Consider a Hadoop job processing a 128 MB file with a default block size of 64 MB. How many input splits will Hadoop create by default?

medium

A. 2

B. 128

C. 64

D. 1

Solution

1. Step 1: Understand block size and file size relation

   The file is 128 MB and block size is 64 MB, so the file fits into two blocks.

2. Step 2: Determine number of input splits

   By default, Hadoop creates one input split per block, so 2 splits for 2 blocks.

3. Final Answer:

   2 -> Option A

4. Quick Check:

   File size / block size = input splits [OK]

Hint: Input splits = file size ÷ block size [OK]

Common Mistakes:

• Assuming one split regardless of file size
• Confusing block size with split size
• Choosing number equal to file size in MB

4. A Hadoop job is running slower than expected. The developer suspects data locality is not being used. Which of the following could fix this issue?

medium

A. Increase the number of input splits to one per byte

B. Configure the job to prefer running tasks on nodes where data blocks reside

C. Disable input splits to process the whole file at once

D. Compress the input data before processing

Solution

1. Step 1: Identify cause of slow job

   Slow job may be due to tasks running far from data, causing network delays.

2. Step 2: Choose fix to improve data locality

   Configuring the job to run tasks on nodes holding data blocks improves data locality and speed.

3. Final Answer:

   Configure the job to prefer running tasks on nodes where data blocks reside -> Option B

4. Quick Check:

   Improve data locality by running tasks near data [OK]

Hint: Run tasks on nodes with data blocks to speed up [OK]

Common Mistakes:

• Increasing splits too much causes overhead
• Disabling splits reduces parallelism
• Compressing data doesn't fix locality

5. You have a Hadoop cluster with 4 nodes. A 256 MB file is stored with a block size of 64 MB. If one node fails, how does Hadoop maintain data locality and processing efficiency?

hard

A. It processes all data on a single node ignoring data locality

B. It stops the job until the failed node is fixed

C. It reassigns input splits to nodes holding replica blocks to keep tasks near data

D. It deletes the missing blocks and continues with remaining data

Solution

1. Step 1: Understand Hadoop replication and fault tolerance

   Hadoop stores multiple copies (replicas) of each block on different nodes to handle failures.

2. Step 2: How Hadoop maintains data locality after node failure

   When a node fails, Hadoop schedules tasks on nodes that have replica blocks to keep data locality and efficiency.

3. Final Answer:

   It reassigns input splits to nodes holding replica blocks to keep tasks near data -> Option C

4. Quick Check:

   Replica blocks keep data local despite node failure [OK]

Hint: Hadoop uses replicas to keep data local if node fails [OK]

Common Mistakes:

• Thinking job stops on node failure
• Assuming data is processed on one node only
• Believing missing blocks are deleted immediately