wordcount求共同好友代码实现

发表于 | 更新于 | 分类于 | 评论数： | 阅读次数： 
1
2
3
4
5
6
7
8
9
10
package com.Practice.SameFriend;

import org.apache.hadoop.conf.Configuration;
import org.apache.hadoop.fs.FileSystem;
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;
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
import org.apache.hadoop.mapreduce.lib.input.FileInputFormat;
import org.apache.hadoop.mapreduce.lib.jobcontrol.ControlledJob;
import org.apache.hadoop.mapreduce.lib.jobcontrol.JobControl;
import org.apache.hadoop.mapreduce.lib.output.FileOutputFormat;

import java.io.IOException;
import java.util.Arrays;

/**
 * 求共同好友合并版
 * 主要思路： 第一步：求出每一个好友所对应的所有用户
 *           第二步：将第一步中所有用户进行排序，两两组合，最后求出两用户间的共同好友
 */
public class SameFriendMerge1 {

    public static void main(String[] args) throws IOException, InterruptedException {
        Configuration conf = new Configuration();
        FileSystem fs = FileSystem.get(conf);

        //第一个job信息
        Job job = Job.getInstance(conf);
        job.setJar("wordcountJar/wordcount.jar");

        job.setMapperClass(SFMerge1Mapper1.class);
        job.setReducerClass(SFMerge1Reducer1.class);

        job.setOutputKeyClass(Text.class);
        job.setOutputValueClass(Text.class);

        Path inputPath = new Path("input/sameFriend");
        Path outputPath = new Path("output/sameFriend");

        if(fs.isDirectory(outputPath)){
            fs.delete(outputPath,true);
        }

        FileInputFormat.setInputPaths(job,inputPath);
        FileOutputFormat.setOutputPath(job,outputPath);

        //第二个job信息
       Job job1 = Job.getInstance(conf);
       job1.setJar("wordcountJar/wordcount.jar");

       job1.setMapperClass(SFMerge1Mapper2.class);
       job1.setReducerClass(SFMerge1Reducer2.class);

       job1.setOutputKeyClass(Text.class);
       job1.setOutputValueClass(Text.class);

       Path inputPath1 = new Path("output/sameFriend");
       Path outputPath1 = new Path("output/sameFriend1");

       if(fs.isDirectory(outputPath1)){
           fs.delete(outputPath1,true);
       }

       FileInputFormat.setInputPaths(job1,inputPath1);
       FileOutputFormat.setOutputPath(job1,outputPath1);

        ControlledJob ctlJob1 = new ControlledJob(job.getConfiguration());
        ControlledJob ctlJob2 = new ControlledJob(job.getConfiguration());

        ctlJob1.setJob(job);
        ctlJob2.setJob(job1);

        ctlJob2.addDependingJob(ctlJob1);

        JobControl jobControl = new JobControl("SameFriends");
        jobControl.addJob(ctlJob1);
        jobControl.addJob(ctlJob2);

        Thread jobThread = new Thread(jobControl);
        jobThread.start();

        // 每隔一段时间来判断一下该jc线程的任务是否执行完成
        while (!jobControl.allFinished()){
            Thread.sleep(500);
        }

        jobControl.stop();





    }

    public static class SFMerge1Mapper1 extends Mapper<LongWritable,Text,Text,Text>{
        private Text outKey = new Text();
        private Text outValue = new Text();
        @Override
        protected void map(LongWritable key, Text value, Context context) throws IOException, InterruptedException {
            String[] split = value.toString().split(":");
            outValue.set(split[0]);
            String[] friends = split[1].split(",");
            for (String str :
                    friends) {
                outKey.set(str);
                context.write(outKey,outValue);
            }
        }
    }

    /**
     * 第一次reducer输出结果：
         A	F,I,O,K,G,D,C,H,B
         B	E,J,F,A
         C	B,E,K,A,H,G,F
         D	H,C,G,F,E,A,K,L
         E	A,B,L,G,M,F,D,H
         F	C,M,L,A,D,G
         G	M
         H	O
         I	O,C
         J	O
         K	O,B
         L	D,E
         M	E,F
         O	A,H,I,J,F
     */
    public static class SFMerge1Reducer1 extends Reducer<Text,Text,Text,Text>{
        private Text outValue = new Text();
        @Override
        protected void reduce(Text key, Iterable<Text> values, Context context) throws IOException, InterruptedException {
            StringBuilder sb = new StringBuilder();
            for (Text str :
                    values) {
                if( sb.length()!= 0 ){
                    sb.append(",");
                }
                sb.append(str);
            }
            outValue.set(sb.toString());
            context.write(key,outValue);
        }
    }

    public static class SFMerge1Mapper2 extends Mapper<LongWritable,Text,Text,Text>{
        private Text outValue = new Text();
        private Text outKey = new Text();
        @Override
        protected void map(LongWritable key, Text value, Context context) throws IOException, InterruptedException {
            String[] splits = value.toString().split("\t");
            String[] strings = splits[1].split(",");
            outValue.set(splits[0]);
            Arrays.sort(strings);
            for (int i = 0; i < strings.length - 1; i++) {
                for (int j = i+1; j < strings.length; j++) {
                    outKey.set(strings[i]+"-"+strings[j]);
                    context.write(outKey,outValue);
                }
            }
        }
    }

    /**
     * 第二次reducer输出结果：
         A-B	E,C
         A-C	D,F
         A-D	E,F
         A-E	B,C,D
         A-F	C,E,O,D,B
         A-G	E,F,C,D
         A-H	C,D,E,O
         A-I	O
         A-J	O,B
         A-K	C,D
         A-L	F,D,E
         A-M	F,E
         B-C	A
         B-D	A,E
         B-E	C
         B-F	C,A,E
         B-G	E,C,A
         B-H	E,C,A
         B-I	A
         B-K	A,C
         B-L	E
         B-M	E
         B-O	A,K
         C-D	A,F
         C-E	D
         C-F	A,D
         C-G	A,D,F
         C-H	D,A
         C-I	A
         C-K	A,D
         C-L	D,F
         C-M	F
         C-O	I,A
         D-E	L
         D-F	A,E
         D-G	E,A,F
         D-H	A,E
         D-I	A
         D-K	A
         D-L	E,F
         D-M	F,E
         D-O	A
         E-F	D,M,C,B
         E-G	C,D
         E-H	C,D
         E-J	B
         E-K	C,D
         E-L	D
         F-G	D,C,A,E
         F-H	A,D,O,E,C
         F-I	O,A
         F-J	B,O
         F-K	D,C,A
         F-L	E,D
         F-M	E
         F-O	A
         G-H	D,C,E,A
         G-I	A
         G-K	D,A,C
         G-L	D,F,E
         G-M	E,F
         G-O	A
         H-I	O,A
         H-J	O
         H-K	A,C,D
         H-L	D,E
         H-M	E
         H-O	A
         I-J	O
         I-K	A
         I-O	A
         K-L	D
         K-O	A
         L-M	E,F

     */
    public static class SFMerge1Reducer2 extends Reducer<Text,Text,Text,Text>{
        private Text outValue = new Text();
        @Override
        protected void reduce(Text key, Iterable<Text> values, Context context) throws IOException, InterruptedException {
            StringBuilder sb = new StringBuilder();
            for (Text str :
                    values) {
                if(sb.length()!= 0){
                    sb.append(",");
                }
                sb.append(str);
                outValue.set(sb.toString());
            }
            context.write(key,outValue);
        }
    }
}
0%