Scribd Logo
Carica

Benvenuto in Scribd!

  • Copy TM

    Caricato da

    Praveen Kumar
    17 visualizzazioni1 pagina
    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.

    Descrizione originale:

    sdfe

    Titolo originale

    COPY_TM

    Copyright

    © © All Rights Reserved

    Formati disponibili

    PPTX, PDF, TXT o leggi online da Scribd

    Hai trovato utile questo documento?

    Questo contenuto è inappropriato?

    Segnala questo documento
    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
    Scarica in formato PPTX, PDF, TXT o leggi online su Scribd
    Segnala contenuti inappropriati
    17 visualizzazioni1 pagina

    Copy TM

    Caricato da

    Praveen Kumar
    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
    Scarica in formato PPTX, PDF, TXT o leggi online su Scribd
    Segnala contenuti inappropriati
    di 1

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

    STORE TO and SORT


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

    Potrebbero piacerti anche