如何重新排列wordcount hadoop输出结果并按值排序

时间:2015-02-28 18:35:02

标签: java hadoop mapreduce

我使用下面的代码获取输出结果,如(Key,Value)

Apple 12
Bee 345 
Cat 123

我想要的是降序按值排序(345)并将它们放在键之前(值,键)

345 Bee
123 Cat
12 Apple

我发现有一些叫做“二级排序”的东西不会撒谎,但我迷失了 - 我试图改变...... context.write(key, result);但是失败了。我是Hadoop的新手,不知道如何才能开始解决这个问题。任何建议将不胜感激。我需要更改哪个功能?或者我需要修改哪个班级?

这里是我的班级:

package org.apache.hadoop.examples;

import java.io.IOException;
import java.util.StringTokenizer;

import org.apache.hadoop.conf.Configuration;
import org.apache.hadoop.fs.Path;
import org.apache.hadoop.io.IntWritable;
import org.apache.hadoop.io.Text;
import org.apache.hadoop.mapreduce.Job;
import org.apache.hadoop.mapreduce.Mapper;
import org.apache.hadoop.mapreduce.Reducer;
import org.apache.hadoop.mapreduce.lib.input.FileInputFormat;
import org.apache.hadoop.mapreduce.lib.output.FileOutputFormat;
import org.apache.hadoop.util.GenericOptionsParser;

public class WordCount {

  public static class TokenizerMapper 
       extends Mapper<Object, Text, Text, IntWritable>{

    private final static IntWritable one = new IntWritable(1);
    private Text word = new Text();

    public void map(Object key, Text value, Context context
                    ) throws IOException, InterruptedException {
      StringTokenizer itr = new StringTokenizer(value.toString());
      while (itr.hasMoreTokens()) {
        word.set(itr.nextToken());
        context.write(word, one);
      }
    }
  }

  public static class IntSumReducer 
       extends Reducer<Text,IntWritable,Text,IntWritable> {
    private IntWritable result = new IntWritable();

    public void reduce(Text key, Iterable<IntWritable> values, 
                       Context context
                       ) throws IOException, InterruptedException {
      int sum = 0;
      for (IntWritable val : values) {
        sum += val.get();
      }
      result.set(sum);
      context.write(key, result);
    }
  }

  public static void main(String[] args) throws Exception {
    Configuration conf = new Configuration();
    String[] otherArgs = new GenericOptionsParser(conf, args).getRemainingArgs();
    if (otherArgs.length < 2) {
      System.err.println("Usage: wordcount <in> [<in>...] <out>");
      System.exit(2);
    }
    Job job = new Job(conf, "word count");
    job.setJarByClass(WordCount.class);
    job.setMapperClass(TokenizerMapper.class);
    job.setCombinerClass(IntSumReducer.class);
    job.setReducerClass(IntSumReducer.class);
    job.setOutputKeyClass(Text.class);
    job.setOutputValueClass(IntWritable.class);
    for (int i = 0; i < otherArgs.length - 1; ++i) {
      FileInputFormat.addInputPath(job, new Path(otherArgs[i]));
    }
    FileOutputFormat.setOutputPath(job,
      new Path(otherArgs[otherArgs.length - 1]));
    System.exit(job.waitForCompletion(true) ? 0 : 1);
  }
}

1 个答案:

答案 0 :(得分:2)

您已经能够正确计算字数。

您将需要第二个仅映射作业来执行降序排序和交换键值的第二个要求

  1. 使用DecreasingComparator作为排序比较器
  2. 使用InverseMapper交换键和值
  3. 使用Identity Reducer,即Reducer.class - 在Identity Reducer的情况下,不会发生聚合(因为每个值都是为密钥单独输出的)
  4. 将reduce任务数设置为1或使用TotalOderPartitioner