• MapReduce作业


    1.编写map函数,reduce函数

    (1)创建mapper.py文件

    cd /home/hadoop/wc 

    gedit mapper.p

    (2)mapper函数

    #!/usr/bin/env python
    import sys
    for i in stdin:
        i = i.strip()
        words = i.split()
        for word in words:
        print '%s	%s' % (word,1)

    (3)reducer.py文件创建

    cd /home/hadoop/wc

    gedit reducer.py

    (4)reducer函数
    #!/usr/bin/env python
    from operator import itemgetter
    import sys
    
    current_word = None
    current_count = 0
    word = None
    
    for i in stdin:
        i = i.strip()
        word, count = i.split('	',1)
        try:
        count = int(count)
        except ValueError:
        continue
    
        if current_word == word:
        current_count += count 
        else:
        if current_word:
            print '%s	%s' % (current_word, current_count)
        current_count = count
        current_word = word
    
    if current_word == word:
        print '%s	%s' % (current_word, current_count)



    2.将其权限作出相应修改
    chmod a+x /home/hadoop/mapper.py
    echo "foo foo quux labs foo bar quux" | /home/hadoop/wc/mapper.py
    echo "foo foo quux labs foo bar quux" | /home/hadoop/wc/mapper.py | sort -k1,1 | /home/hadoop/wc/reducer.p


    3.本机上测试运行代码

    放到HDFS上运行

    下载并上传文件到hdfs上

    cd  /home/hadoop/wc
    wget http://www.gutenberg.org/files/5000/5000-8.txt
    wget http://www.gutenberg.org/cache/epub/20417/pg20417.txt

    cd /usr/hadoop/wc
    hdfs dfs -put /home/hadoop/hadoop/gutenberg/*.txt /user/hadoop/input
     



     
     
  • 相关阅读:
    【洛谷 1546】最短网络
    [Algorithms]Greedy
    [Operating System]Thread Pool
    微积分——外微分形式的微积分
    Codeforce Round #548(Div2)
    Codeforce Round #544(Div3)
    Codeforce Round #545(Div2) (BCD题解)
    桶排序桶的前缀和/差分
    Codeforce Round #545(Div2)
    Codeforce Round #531(Div3)
  • 原文地址:https://www.cnblogs.com/YY0302/p/9019315.html
Copyright © 2020-2023  润新知