MapReduce编程之Partitioner


Partitioner决定MapTask输出的数据交由哪个ReduceTask处

理默认实现:分发的key的hash值对ReduceTask个数取模


案例实现

/**
 * 
 * MapReduce编程之Partitioner
 *          Partitioner决定MapTask输出的数据交由哪个ReduceTask处理
 *          默认实现:分发的key的hash值对ReduceTask个数取模
 *
 * 数据:cat partitioner
 *        xiaomi 200
 *        huawei 100
 *        iphone8 50
 *        xiaomi 200
 *        huawei 100
 *        iphone8 50
 *        xiaomi 200
 *        huawei 100
 *        iphone8 50
 *        xiaomi 200
 *        huawei 100
 *        iphone8 50
 *        nokia 20
 */
public class PartitionerApp {

    /**
     * Map:读取输入的文件
     */
    public static class MyMapper extends Mapper<LongWritable,Text,Text,LongWritable>{
        LongWritable one = new LongWritable(1);

        @Override
        protected void map(LongWritable key, Text value, Context context) throws IOException, InterruptedException {
            //接收到的每一行数据
            String line = value.toString();

            //按照指定分隔符进行拆分
            String[] words = line.split(" ");

            //通过上下文把map的处理结果输出
            context.write(new Text(words[0]),new LongWritable(Long.parseLong(words[1])));
        }
    }
    /**
     * Reduce: 归并操作
     */
    public static class MyReducer extends Reducer<Text,LongWritable,Text,LongWritable>{
        @Override
        protected void reduce(Text key, Iterable<LongWritable> values, Context context) throws IOException, InterruptedException {

            long sum = 0;
            for (LongWritable value:values) {
                //求key出现的次数总和
                sum += value.get();
            }

            //最终统计结果的输出
            context.write(key,new LongWritable(sum));
        }
    }

    public static class MyPartitioner extends Partitioner<Text,LongWritable> {
        public int getPartition(Text key, LongWritable value, int numPartitions) {
            if (key.toString().equals("xiaomi")){
                return 0;
            }

            if (key.toString().equals("huawei")){
                return 1;
            }

            if (key.toString().equals("iphone7")){
                return 2;
            }
            return 3;
        }
    }

    /**
     * 定义Driver:封装了MapReduce作业的所有信息
     * @param args
     */
    public static void main(String[] args) throws Exception {

        //创建Configuration
        Configuration configuration = new Configuration();

        //准备清理已存在的输出目录
        Path outputPath = new Path(args[1]);
        FileSystem fileSystem = FileSystem.get(configuration);
        if (fileSystem.exists(outputPath)){
            fileSystem.delete(outputPath,true);
            System.out.println("output file exists, but is has deleted");
        }

        //创建Job
        Job job = Job.getInstance(configuration, "wordcount");

        //设置job的处理类
        job.setJarByClass(PartitionerApp.class);

        //设置作业处理的输入路径
        FileInputFormat.setInputPaths(job,new Path(args[0]));

        //设置map相关参数
        job.setMapperClass(MyMapper.class);
        job.setMapOutputKeyClass(Text.class);
        job.setMapOutputValueClass(LongWritable.class);

        //设置reduce相关参数
        job.setReducerClass(MyReducer.class);
        job.setOutputKeyClass(Text.class);
        job.setOutputValueClass(LongWritable.class);

        //通过job设置combiner处理类,其实逻辑上和我们的reduce一模一样
//        job.setCombinerClass(WordCountApp.MyReducer.class);

        //设置job的partitioner
        job.setPartitionerClass(MyPartitioner.class);
        //设置4个reduce,每个分区一个
        job.setNumReduceTasks(4);

        //设置作业处理的输出路径
        FileOutputFormat.setOutputPath(job,new Path(args[1]));

        System.exit(job.waitForCompletion(true) ? 0 : 1);
    }

}




  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值