Hadoop中单表链接


import java.io.IOException;

import org.apache.hadoop.fs.Path;
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 java.util.Iterator;
import java.util.StringTokenizer;

class Map extends Mapper<Object, Text, Text, Text>{
    public void map(Object key, Text value, Context context)
            throws IOException, InterruptedException{
            
            StringTokenizer str = new StringTokenizer(value.toString());
            String flag = new String();
            String childName = new String();
            String parentName = new String();
            String[] values = new String[2];
            
            int i = 0;
            while( str.hasMoreTokens() ){
                 values[i] = str.nextToken();
                 i++;
            }
            if ( values[0].compareTo("child") != 0){
                childName = values[0];
                parentName = values[1];
            
                flag = "1";
                context.write(new Text(parentName), new Text(flag+" "+childName));
                flag="2";
                context.write(new Text(childName), new Text(flag+" "+parentName));
        }
    }
}

    
class Reduce extends Reducer<Text, Text, Text, Text>{
    private static int time = 0;
    public void reduce(Text key, Iterable<Text> values,Context context)
        throws IOException, InterruptedException{
        if (time == 0){
            context.write(new Text("grandchild"), new Text("grandparent"));
            time++;
        }
        Iterator<Text> ite = values.iterator();
        int grandchildNum = 0;
        int grandparentNum = 0;
        String[] grandchild = new String[10];
        String[] grandparent = new String[10];
        while (ite.hasNext()){
            String  str = ite.next().toString();
            if (str.charAt(0) == '2'){

                grandparent[grandparentNum] = str.substring(2);
                grandparentNum++;
            }
            else{
                grandchild[grandchildNum] = str.substring(2);
                grandchildNum++;
            }
        }
            if(grandchildNum != 0 && grandparentNum != 0){
                 for (int m = 0; m < grandchildNum; m++) {
                        for (int n = 0; n < grandparentNum; n++) {
                            context.write(new Text(grandchild[m]), new Text(grandparent[n]));
                        }
                 }
            }
    }
}
    
public class STjoin{
    public static void main(String[] args) throws Exception{
        Job job = new Job();
        job.setJarByClass(STjoin.class);
        job.setMapperClass(Map.class);
        job.setReducerClass(Reducer.class);
        
        FileInputFormat.addInputPath(job, new Path(args[0]));
        FileOutputFormat.setOutputPath(job, new Path(args[1]));
        
        job.setOutputKeyClass(Text.class);
        job.setOutputValueClass(Text.class);
        
        System.exit(job.waitForCompletion(true)?0:1);
        
    }
}



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

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值