hbase-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Lars Hofhansl (JIRA)" <j...@apache.org>
Subject [jira] [Commented] (HBASE-9440) Pass blocks of KVs from HFile scanner to the StoreFileScanner and up
Date Fri, 13 Sep 2013 05:11:52 GMT

    [ https://issues.apache.org/jira/browse/HBASE-9440?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13766247#comment-13766247
] 

Lars Hofhansl commented on HBASE-9440:
--------------------------------------

If you're curious: 8 byte keys, 4 byte column name, 2 byte column family name.

The HFile I used for testing was 5.61gb.

Scanning this from disk took ~40s, from the OS buffer cache: 12s, and block cache (as stated
above): 1.9s.
(i.e. 140mb/s from disk, 467mb/s from OS cache, and 2.95gb/s from the block cache)

                
> 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

Mime
View raw message