[
https://issues.apache.org/jira/browse/HBASE-9440?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13766223#comment-13766223
]
Lars Hofhansl edited comment on HBASE-9440 at 9/13/13 4:28 AM:
---------------------------------------------------------------
Tested HFileReaderV2.ScannerV2 directly. It can scan 45m rows (1 column with a
100 byte value, everything in the blockcache) in 1.9s. So that would the
theoretical maximum until we change the HFile format again.
was (Author: lhofhansl):
Tested HFileReaderV2.ScannerV2 directly. It can scan 45m rows (1 column
with a 10 byte value, everything in the blockcache) in 1.9s. So that would the
theoretical maximum until we change the HFile format again.
> Pass blocks of KVs from HFile scanner to the StoreFileScanner and up
> --------------------------------------------------------------------
>
> Key: HBASE-9440
> URL: https://issues.apache.org/jira/browse/HBASE-9440
> Project: HBase
> Issue Type: Bug
> Reporter: Lars Hofhansl
>
> Currently we read KVs from an HFileScanner one-by-one and pass them up the
> scanner/heap tree. Many time the ranges of KVs retrieved from
> StoreFileScanner (by StoreScanners) and HFileScanner (by StoreFileScanner)
> will be non-overlapping. If chunks of KVs do not overlap we can sort entire
> chunks just by comparing the start/end key of the chunk. Only if chunks are
> overlapping do we need to sort KV by KV as we do now.
> I have no patch, but I wanted to float this idea.
--
This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators
For more information on JIRA, see: http://www.atlassian.com/software/jira
