hadoop wordcount 分步按照value降序排序

面向有wordcount输出结果的,经过默认排序的

由于wordcount自带的是按照字母表顺序排序的,所以我们第一步就是要把自带排序给替换成按照value降序排序的

@DecreasingComparator.java

public class DecreasingComparator extends Text.Comparator {
   
    @SuppressWarnings("rawtypes")
    public int compare(WritableComparable a, WritableComparable b){
   
        return -super.compare(a, b);
    }
    public int compare(byte[] b1, int s1, int l1, byte[] b2, int s2, int l2) {
   
        return -super.compare(b1, s1, l1, b2, s2, l2);
    }
}

来源@木子木泗 链接

@Submite.java

import java.io.IOException;
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.lib.input.FileInputFormat;
  • 2
    点赞
  • 3
    收藏
    觉得还不错? 一键收藏
  • 1
    评论
Hadoop WordCount是一个经典的MapReduce程,用于对文本数据进行词频统计。实现方法如下: 1. Map阶段:将文本数据按照指定的分隔符进行切分,将每个单词作为Key,将频率作为Value传递给Reduce阶段。 2. Reduce阶段:将Map阶段传递过来的Key-Value对进行合并,统计每个单词在文本中出现的次数,输出最终的词频统计结果。 以下是Hadoop WordCount的Java代码示例: ```java 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(); Job job = Job.getInstance(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); FileInputFormat.addInputPath(job, new Path(args[0])); FileOutputFormat.setOutputPath(job, new Path(args[1])); System.exit(job.waitForCompletion(true) ? 0 : 1); } } ``` 以上代码中,TokenizerMapper类实现了Map阶段的逻辑,IntSumReducer类实现了Reduce阶段的逻辑,main函数用于配置和提交MapReduce作业。
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值