@InterfaceAudience.Private public abstract class NonLazyKeyValueScanner extends Object implements KeyValueScanner
NO_NEXT_INDEXED_KEY
Constructor and Description |
---|
NonLazyKeyValueScanner() |
Modifier and Type | Method and Description |
---|---|
static boolean |
doRealSeek(KeyValueScanner scanner,
Cell kv,
boolean forward) |
void |
enforceSeek()
Does the real seek operation in case it was skipped by
seekToRowCol(KeyValue, boolean) (TODO: Whats this?).
|
org.apache.hadoop.fs.Path |
getFilePath() |
Cell |
getNextIndexedKey() |
boolean |
isFileScanner() |
boolean |
realSeekDone()
We optimize our store scanners by checking the most recent store file
first, so we sometimes pretend we have done a seek but delay it until the
store scanner bubbles up to the top of the key-value heap.
|
boolean |
requestSeek(Cell kv,
boolean forward,
boolean useBloom)
Similar to
KeyValueScanner.seek(org.apache.hadoop.hbase.Cell) (or KeyValueScanner.reseek(org.apache.hadoop.hbase.Cell) if forward is true) but only
does a seek operation after checking that it is really necessary for the
row/column combination specified by the kv parameter. |
void |
shipped()
Called after a batch of rows scanned and set to be returned to client.
|
boolean |
shouldUseScanner(Scan scan,
HStore store,
long oldestUnexpiredTS)
Allows to filter out scanners (both StoreFile and memstore) that we don't
want to use based on criteria such as Bloom filters and timestamp ranges.
|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
backwardSeek, close, getScannerOrder, next, peek, reseek, seek, seekToLastRow, seekToPreviousRow
public NonLazyKeyValueScanner()
public boolean requestSeek(Cell kv, boolean forward, boolean useBloom) throws IOException
KeyValueScanner
KeyValueScanner.seek(org.apache.hadoop.hbase.Cell)
(or KeyValueScanner.reseek(org.apache.hadoop.hbase.Cell)
if forward is true) but only
does a seek operation after checking that it is really necessary for the
row/column combination specified by the kv parameter. This function was
added to avoid unnecessary disk seeks by checking row-column Bloom filters
before a seek on multi-column get/scan queries, and to optimize by looking
up more recent files first.requestSeek
in interface KeyValueScanner
forward
- do a forward-only "reseek" instead of a random-access seekuseBloom
- whether to enable multi-column Bloom filter optimizationIOException
public boolean realSeekDone()
KeyValueScanner
realSeekDone
in interface KeyValueScanner
public void enforceSeek() throws IOException
KeyValueScanner
KeyValueScanner.realSeekDone()
first.enforceSeek
in interface KeyValueScanner
IOException
public static boolean doRealSeek(KeyValueScanner scanner, Cell kv, boolean forward) throws IOException
IOException
public boolean shouldUseScanner(Scan scan, HStore store, long oldestUnexpiredTS)
KeyValueScanner
shouldUseScanner
in interface KeyValueScanner
scan
- the scan that we are selecting scanners forstore
- the store we are performing the scan on.oldestUnexpiredTS
- the oldest timestamp we are interested in for
this query, based on TTLpublic boolean isFileScanner()
isFileScanner
in interface KeyValueScanner
public org.apache.hadoop.fs.Path getFilePath()
getFilePath
in interface KeyValueScanner
KeyValueScanner.isFileScanner()
public Cell getNextIndexedKey()
getNextIndexedKey
in interface KeyValueScanner
public void shipped() throws IOException
Shipper
shipped
in interface Shipper
IOException
Copyright © 2007–2019 The Apache Software Foundation. All rights reserved.