Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 9218621
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 18, 20262026-06-18T02:54:22+00:00 2026-06-18T02:54:22+00:00

According to the Hadoop – The Definitive Guide The logical records that FileInputFormats define

  • 0

According to the Hadoop - The Definitive Guide

The logical records that FileInputFormats define do not usually fit neatly into HDFS blocks. For example, a TextInputFormat’s logical records are lines, which will cross HDFS boundaries more often than not. This has no bearing on the functioning of your program—lines are not missed or broken, for example—but it’s worth knowing about, as it does mean that data-local maps (that is, maps that are running on the same host as their input data) will perform some remote reads. The slight overhead this causes is not normally significant.

Suppose a record line is split across two blocks (b1 and b2). The mapper processing the first block (b1) will notice that the last line doesn’t have a EOL separator and fetches the remaining of the line from the next block of data (b2).

How does the mapper processing the second block (b2) determine that the first record is incomplete and should process starting from the second record in the block (b2)?

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-18T02:54:24+00:00Added an answer on June 18, 2026 at 2:54 am

    Interesting question, I spent some time looking at the code for the details and here are my thoughts. The splits are handled by the client by InputFormat.getSplits, so a look at FileInputFormat gives the following info:

    • For each input file, get the file length, the block size and calculate the split size as max(minSize, min(maxSize, blockSize)) where maxSize corresponds to mapred.max.split.size and minSize is mapred.min.split.size.
    • Divide the file into different FileSplits based on the split size calculated above. What’s important here is that each FileSplit is initialized with a start parameter corresponding to the offset in the input file. There is still no handling of the lines at that point. The relevant part of the code looks like this:

      while (((double) bytesRemaining)/splitSize > SPLIT_SLOP) {
        int blkIndex = getBlockIndex(blkLocations, length-bytesRemaining);
        splits.add(new FileSplit(path, length-bytesRemaining, splitSize, 
                                 blkLocations[blkIndex].getHosts()));
        bytesRemaining -= splitSize;
      }
      

    After that, if you look at the LineRecordReader which is defined by the TextInputFormat, that’s where the lines are handled:

    • When you initialize your LineRecordReader it tries to instantiate a LineReader which is an abstraction to be able to read lines over FSDataInputStream. There are 2 cases:
    • If there is a CompressionCodec defined, then this codec is responsible for handling boundaries. Probably not relevant to your question.
    • If there is no codec however, that’s where things are interesting: if the start of your InputSplit is different than 0, then you backtrack 1 character and then skip the first line you encounter identified by \n or \r\n (Windows) ! The backtrack is important because in case your line boundaries are the same as split boundaries, this ensures you do not skip the valid line. Here is the relevant code:

      if (codec != null) {
         in = new LineReader(codec.createInputStream(fileIn), job);
         end = Long.MAX_VALUE;
      } else {
         if (start != 0) {
           skipFirstLine = true;
           --start;
           fileIn.seek(start);
         }
         in = new LineReader(fileIn, job);
      }
      if (skipFirstLine) {  // skip first line and re-establish "start".
        start += in.readLine(new Text(), 0,
                          (int)Math.min((long)Integer.MAX_VALUE, end - start));
      }
      this.pos = start;
      

    So since the splits are calculated in the client, the mappers don’t need to run in sequence, every mapper already knows if it neds to discard the first line or not.

    So basically if you have 2 lines of each 100Mb in the same file, and to simplify let’s say the split size is 64Mb. Then when the input splits are calculated, we will have the following scenario:

    • Split 1 containing the path and the hosts to this block. Initialized at start 200-200=0Mb, length 64Mb.
    • Split 2 initialized at start 200-200+64=64Mb, length 64Mb.
    • Split 3 initialized at start 200-200+128=128Mb, length 64Mb.
    • Split 4 initialized at start 200-200+192=192Mb, length 8Mb.
    • Mapper A will process split 1, start is 0 so don’t skip first line, and read a full line which goes beyond the 64Mb limit so needs remote read.
    • Mapper B will process split 2, start is != 0 so skip the first line after 64Mb-1byte, which corresponds to the end of line 1 at 100Mb which is still in split 2, we have 28Mb of the line in split 2, so remote read the remaining 72Mb.
    • Mapper C will process split 3, start is != 0 so skip the first line after 128Mb-1byte, which corresponds to the end of line 2 at 200Mb, which is end of file so don’t do anything.
    • Mapper D is the same as mapper C except it looks for a newline after 192Mb-1byte.
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

According to Hadoop: The Definitive Guide, Second Edition A. Datanodes are responsible for verifying
According MSDN, FxCop is an application that analyzes managed code assemblies (code that targets
According to Hibernate documentation : After observing that arrays cannot be lazy , you
According to the Ruby on Rails Guide: Caching , caching is disabled by default
I'm writing a Hadoop application but it seems that I have misinterpreted how exactly
According to msdn it should be in windbase.h but it is not available instead
I just imported the hadoop projects to eclipse according to the information given in
I'm very new with hadoop stream and have some difficulties with the partitioning. According
According to the official user guide line, sgelsd is used to solve the least
According to http://developer.android.com/guide/practices/ui_guidelines/icon_design_status_bar.html - Status bar icons should be white without any color. Many

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.