[
https://issues.apache.org/jira/browse/HBASE-9440?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13767047#comment-13767047
]
Lars Hofhansl commented on HBASE-9440:
--------------------------------------
OK. Redid the tall table test (1 col). Disk takes ~40s (just like HFile), block
cache takes 24s.
Not sure how I got the slow numbers before. Sorry.
So when data is on disk, we're pretty close to what we can read from HFiles.
When data is cached it's 24s vs. 1.9s for the all table and 6s vs 1.2s for the
wide table. So a bit less impressive.
Note that all this was just a single region, compacted to a single HFile.
> 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
