Are you closing Scanners? If not, they are occupying slots until they time out.
St.Ack
On Thu, Apr 22, 2010 at 8:10 PM, steven zhuang
<steven.zhuang.1...@gmail.com> wrote:
> hi,
> sorry I start another thread here. This mail is actually answer
> to a previous thread "multiple scanners on same table will cause problem?
> Scan results change among different tries.".
> the mail system kept saying that I am spamming, now it seems that
> it's right! :)
>
> here is my reply to people in that thread:
>
> I don't know if there is a limit on reads to a single row/region in
> HBase, but if there is, I might have exceeded that limit. :(
> in my case, there are hundreds of rows, with dozens of kilos of cells
> in a row(a 256 MB region may contain 10- rows). for each row, I started a
> thread on each CF, there are 8 of them, so there might be dozens of scanners
> on the same region.
> and, to Tim, I could not see your attached mail, my test code is
> pasted below, it just iterate on the rows and column families, output all
> the cells.
>
> private void doScan() throws Exception {
> if (null == CopyOfTestTTT234.table) {
> return;
> }
> Scan s = new Scan();
> s.setStartRow("aaa".getBytes());
> s.setStopRow("ccc".getBytes());
> s.setCaching(CopyOfTestTTT234.ROWCACHING); //it's 1 here.
> ResultScanner scanner = CopyOfTestTTT234.table.getScanner(s);
> while (true) {
> Result row = scanner.next();
> if(null==row) break;
> String rowKey = new String(row.getRow());
> NavigableMap<byte[], NavigableMap<byte[], byte[]>> fm = row
> .getNoVersionMap();
> while (fm.size() > 0) {
> Entry<byte[], NavigableMap<byte[], byte[]>> ee = fm
> .pollFirstEntry();
> String fName = new String(ee.getKey());
> NavigableMap<byte[], byte[]> ff = ee.getValue();
> while (ff.size() > 0) {
> Entry<byte[], byte[]> cell = ff.pollFirstEntry();
> String key = new String(cell.getKey());
> String val = new String(cell.getValue());
> System.out.println(Thread.currentThread().hashCode() + "\t"
> + rowKey + "\t" + fName + "\t" + key + "\t" + val);
> }
> }
> }
> }
>
