Scribd Logo
Upload

Welcome to Scribd!

  • Peer Reviewfor Upload

    Uploaded by

    Anuj Pratap Singh
    27 views1 page
    This document outlines a 3 step process for storing data partitions in HDFS: 1) Map the data partitions, 2) Shuffle and sort the partitions, 3) Reduce and store the sorted partitions in HDFS. The example shows 5 data partitions that will go through this process.

    Original Description:

    Original Title

    _86c448dfa47cdab170075f16cd25c650_PeerReviewforUpload (1).pptx

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document outlines a 3 step process for storing data partitions in HDFS: 1) Map the data partitions, 2) Shuffle and sort the partitions, 3) Reduce and store the sorted partitions in HDFS. The example shows 5 data partitions that will go through this process.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pptx, pdf, or txt
    27 views1 page

    Peer Reviewfor Upload

    Uploaded by

    Anuj Pratap Singh
    This document outlines a 3 step process for storing data partitions in HDFS: 1) Map the data partitions, 2) Shuffle and sort the partitions, 3) Reduce and store the sorted partitions in HDFS. The example shows 5 data partitions that will go through this process.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pptx, pdf, or txt
    of 1

    STEP 0 – 1 - MAP 2 – SHUFFLE 3 - REDUCE

    STORE TO and SORT


    HDFS
    Assume 4 data
    partitions.
    ( , __ )
    ( , __ )
    ( , __ )
    ( , __ )
    ( , __ )

    You might also like