倒排索引的分布式实现(MapReduce程序)

package aturbo.index.inverted;


import java.io.IOException;
import java.util.HashSet;


import org.apache.commons.lang3.StringUtils;
import org.apache.hadoop.conf.Configuration;
import org.apache.hadoop.fs.Path;
import org.apache.hadoop.io.LongWritable;
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.input.FileSplit;
import org.apache.hadoop.mapreduce.lib.output.FileOutputFormat;
import org.apache.hadoop.util.GenericOptionsParser;


public class InvertedIndex {


	public static class Map extends Mapper<LongWritable, Text, Text, Text>{
		private Text documentId;
		private Text word = new Text();
		
		@Override
		protected void setup(Context context){
			String filename = ((FileSplit)context.getInputSplit()).getPath().getName();
			documentId = new Text(filename);
		}
		
		@Override
		protected void map(LongWritable key,Text value,Context context)throws IOException,InterruptedException{
			for(String token:StringUtils.split(value.toString())){
				word.set(token);
				context.write(word, documentId);
			}
		}
	}
	
	public static class Reduce extends Reducer<Text, Text, Text, Text>{
		
		private Text docIds = new Text();
		public void reduce(Text key,Iterable<Text> values,Context context)throws IOException,InterruptedException{
			HashSet<Text> uniqueDocIds = new HashSet<Text>();
			for(Text docId:values){
				uniqueDocIds.add(docId);
			}
			docIds.set(new Text(StringUtils.join(uniqueDocIds, ",")));
			context.write(key, docIds);
		}
	}
	
	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:InvertedIndex<in><out>");
			System.exit(2);
		}
		
		Job job = new Job(conf,"inverted index");
		job.setJarByClass(InvertedIndex.class);
		job.setMapperClass(Map.class);
		job.setCombinerClass(Reduce.class);
		job.setReducerClass(Reduce.class);
		job.setOutputKeyClass(Text.class);
		job.setOutputValueClass(Text.class);
		FileInputFormat.addInputPath(job, new Path(otherArgs[0]));
		FileOutputFormat.setOutputPath(job, new Path(otherArgs[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、付费专栏及课程。

余额充值