[
https://issues.apache.org/jira/browse/HBASE-9440?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13762058#comment-13762058
]
Lars Hofhansl commented on HBASE-9440:
--------------------------------------
I have not thought about this yet. Ideally all the next(...) methods on the
scanners (at least StoreScanner and StoreFileScanner) would have a version that
return a sorted KeyValue[]. HFileScanner is a bit weird in that you have to
call next() and then call getKeyValue to get the current KV, but if
StoreFileScanner could just call this repeatedly and pass a block up, that
would be good enough.
Next: Test HFileScanner.next followed by getKeyValue() directly, to see what
the expected maximum throughput should be.
> 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
