View Javadoc

1   /**
2    * Licensed to the Apache Software Foundation (ASF) under one
3    * or more contributor license agreements.  See the NOTICE file
4    * distributed with this work for additional information
5    * regarding copyright ownership.  The ASF licenses this file
6    * to you under the Apache License, Version 2.0 (the
7    * "License"); you may not use this file except in compliance
8    * with the License.  You may obtain a copy of the License at
9    *
10   *     http://www.apache.org/licenses/LICENSE-2.0
11   *
12   * Unless required by applicable law or agreed to in writing, software
13   * distributed under the License is distributed on an "AS IS" BASIS,
14   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
15   * See the License for the specific language governing permissions and
16   * limitations under the License.
17   */
18  package org.apache.hadoop.hbase.mapreduce;
19  
20  import java.io.File;
21  import java.io.IOException;
22  import java.util.Iterator;
23  import java.util.Map;
24  import java.util.NavigableMap;
25  
26  import org.apache.commons.logging.Log;
27  import org.apache.commons.logging.LogFactory;
28  import org.apache.hadoop.conf.Configuration;
29  import org.apache.hadoop.fs.FileUtil;
30  import org.apache.hadoop.fs.Path;
31  import org.apache.hadoop.hbase.*;
32  import org.apache.hadoop.hbase.client.HTable;
33  import org.apache.hadoop.hbase.client.Put;
34  import org.apache.hadoop.hbase.client.Result;
35  import org.apache.hadoop.hbase.client.ResultScanner;
36  import org.apache.hadoop.hbase.client.Scan;
37  import org.apache.hadoop.hbase.io.ImmutableBytesWritable;
38  import org.apache.hadoop.hbase.testclassification.LargeTests;
39  import org.apache.hadoop.hbase.util.Bytes;
40  import org.apache.hadoop.mapreduce.Job;
41  import org.apache.hadoop.mapreduce.lib.output.FileOutputFormat;
42  import org.junit.AfterClass;
43  import org.junit.BeforeClass;
44  import org.junit.Test;
45  import org.junit.experimental.categories.Category;
46  
47  import static org.junit.Assert.fail;
48  import static org.junit.Assert.assertTrue;
49  
50  /**
51   * Test Map/Reduce job over HBase tables. The map/reduce process we're testing
52   * on our tables is simple - take every row in the table, reverse the value of
53   * a particular cell, and write it back to the table.
54   */
55  @Category(LargeTests.class)
56  public class TestMultithreadedTableMapper {
57    private static final Log LOG = LogFactory.getLog(TestMultithreadedTableMapper.class);
58    private static final HBaseTestingUtility UTIL =
59        new HBaseTestingUtility();
60    static final byte[] MULTI_REGION_TABLE_NAME = Bytes.toBytes("mrtest");
61    static final byte[] INPUT_FAMILY = Bytes.toBytes("contents");
62    static final byte[] OUTPUT_FAMILY = Bytes.toBytes("text");
63    static final int    NUMBER_OF_THREADS = 10;
64  
65    @BeforeClass
66    public static void beforeClass() throws Exception {
67      UTIL.startMiniCluster();
68      HTable table = UTIL.createTable(MULTI_REGION_TABLE_NAME, new byte[][] {INPUT_FAMILY, OUTPUT_FAMILY});
69      UTIL.createMultiRegions(table, INPUT_FAMILY);
70      UTIL.loadTable(table, INPUT_FAMILY, false);
71      UTIL.startMiniMapReduceCluster();
72    }
73  
74    @AfterClass
75    public static void afterClass() throws Exception {
76      UTIL.shutdownMiniMapReduceCluster();
77      UTIL.shutdownMiniCluster();
78    }
79  
80    /**
81     * Pass the given key and processed record reduce
82     */
83    public static class ProcessContentsMapper
84    extends TableMapper<ImmutableBytesWritable, Put> {
85  
86      /**
87       * Pass the key, and reversed value to reduce
88       *
89       * @param key
90       * @param value
91       * @param context
92       * @throws IOException
93       */
94      public void map(ImmutableBytesWritable key, Result value,
95          Context context)
96              throws IOException, InterruptedException {
97        if (value.size() != 1) {
98          throw new IOException("There should only be one input column");
99        }
100       Map<byte[], NavigableMap<byte[], NavigableMap<Long, byte[]>>>
101       cf = value.getMap();
102       if(!cf.containsKey(INPUT_FAMILY)) {
103         throw new IOException("Wrong input columns. Missing: '" +
104             Bytes.toString(INPUT_FAMILY) + "'.");
105       }
106       // Get the original value and reverse it
107       String originalValue = Bytes.toString(value.getValue(INPUT_FAMILY, null));
108       StringBuilder newValue = new StringBuilder(originalValue);
109       newValue.reverse();
110       // Now set the value to be collected
111       Put outval = new Put(key.get());
112       outval.add(OUTPUT_FAMILY, null, Bytes.toBytes(newValue.toString()));
113       context.write(key, outval);
114     }
115   }
116 
117   /**
118    * Test multithreadedTableMappper map/reduce against a multi-region table
119    * @throws IOException
120    * @throws ClassNotFoundException
121    * @throws InterruptedException
122    */
123   @Test
124   public void testMultithreadedTableMapper()
125       throws IOException, InterruptedException, ClassNotFoundException {
126     runTestOnTable(new HTable(new Configuration(UTIL.getConfiguration()),
127         MULTI_REGION_TABLE_NAME));
128   }
129 
130   private void runTestOnTable(HTable table)
131       throws IOException, InterruptedException, ClassNotFoundException {
132     Job job = null;
133     try {
134       LOG.info("Before map/reduce startup");
135       job = new Job(table.getConfiguration(), "process column contents");
136       job.setNumReduceTasks(1);
137       Scan scan = new Scan();
138       scan.addFamily(INPUT_FAMILY);
139       TableMapReduceUtil.initTableMapperJob(
140           Bytes.toString(table.getTableName()), scan,
141           MultithreadedTableMapper.class, ImmutableBytesWritable.class,
142           Put.class, job);
143       MultithreadedTableMapper.setMapperClass(job, ProcessContentsMapper.class);
144       MultithreadedTableMapper.setNumberOfThreads(job, NUMBER_OF_THREADS);
145       TableMapReduceUtil.initTableReducerJob(
146           Bytes.toString(table.getTableName()),
147           IdentityTableReducer.class, job);
148       FileOutputFormat.setOutputPath(job, new Path("test"));
149       LOG.info("Started " + Bytes.toString(table.getTableName()));
150       assertTrue(job.waitForCompletion(true));
151       LOG.info("After map/reduce completion");
152       // verify map-reduce results
153       verify(Bytes.toString(table.getTableName()));
154     } finally {
155       table.close();
156       if (job != null) {
157         FileUtil.fullyDelete(
158             new File(job.getConfiguration().get("hadoop.tmp.dir")));
159       }
160     }
161   }
162 
163   private void verify(String tableName) throws IOException {
164     HTable table = new HTable(new Configuration(UTIL.getConfiguration()), tableName);
165     boolean verified = false;
166     long pause = UTIL.getConfiguration().getLong("hbase.client.pause", 5 * 1000);
167     int numRetries = UTIL.getConfiguration().getInt(HConstants.HBASE_CLIENT_RETRIES_NUMBER, 5);
168     for (int i = 0; i < numRetries; i++) {
169       try {
170         LOG.info("Verification attempt #" + i);
171         verifyAttempt(table);
172         verified = true;
173         break;
174       } catch (NullPointerException e) {
175         // If here, a cell was empty.  Presume its because updates came in
176         // after the scanner had been opened.  Wait a while and retry.
177         LOG.debug("Verification attempt failed: " + e.getMessage());
178       }
179       try {
180         Thread.sleep(pause);
181       } catch (InterruptedException e) {
182         // continue
183       }
184     }
185     assertTrue(verified);
186     table.close();
187   }
188 
189   /**
190    * Looks at every value of the mapreduce output and verifies that indeed
191    * the values have been reversed.
192    *
193    * @param table Table to scan.
194    * @throws IOException
195    * @throws NullPointerException if we failed to find a cell value
196    */
197   private void verifyAttempt(final HTable table)
198       throws IOException, NullPointerException {
199     Scan scan = new Scan();
200     scan.addFamily(INPUT_FAMILY);
201     scan.addFamily(OUTPUT_FAMILY);
202     ResultScanner scanner = table.getScanner(scan);
203     try {
204       Iterator<Result> itr = scanner.iterator();
205       assertTrue(itr.hasNext());
206       while(itr.hasNext()) {
207         Result r = itr.next();
208         if (LOG.isDebugEnabled()) {
209           if (r.size() > 2 ) {
210             throw new IOException("Too many results, expected 2 got " +
211                 r.size());
212           }
213         }
214         byte[] firstValue = null;
215         byte[] secondValue = null;
216         int count = 0;
217         for(Cell kv : r.listCells()) {
218           if (count == 0) {
219             firstValue = CellUtil.cloneValue(kv);
220           }else if (count == 1) {
221             secondValue = CellUtil.cloneValue(kv);
222           }else if (count == 2) {
223             break;
224           }
225           count++;
226         }
227         String first = "";
228         if (firstValue == null) {
229           throw new NullPointerException(Bytes.toString(r.getRow()) +
230               ": first value is null");
231         }
232         first = Bytes.toString(firstValue);
233         String second = "";
234         if (secondValue == null) {
235           throw new NullPointerException(Bytes.toString(r.getRow()) +
236               ": second value is null");
237         }
238         byte[] secondReversed = new byte[secondValue.length];
239         for (int i = 0, j = secondValue.length - 1; j >= 0; j--, i++) {
240           secondReversed[i] = secondValue[j];
241         }
242         second = Bytes.toString(secondReversed);
243         if (first.compareTo(second) != 0) {
244           if (LOG.isDebugEnabled()) {
245             LOG.debug("second key is not the reverse of first. row=" +
246                 Bytes.toStringBinary(r.getRow()) + ", first value=" + first +
247                 ", second value=" + second);
248           }
249           fail();
250         }
251       }
252     } finally {
253       scanner.close();
254     }
255   }
256 
257 }
258