[
https://issues.apache.org/jira/browse/HBASE-16213?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15376833#comment-15376833
]
Anoop Sam John commented on HBASE-16213:
----------------------------------------
Thanks.
So when we have per row size of say 256 bytes, we will have a 1 KB overhead of
storing these offsets (considering 64 KB block size)
So in places like calc bucket cache bucket sizes, user will have to consider
this meta data overhead also.
> A new HFileBlock structure for fast random get
> ----------------------------------------------
>
> Key: HBASE-16213
> URL: https://issues.apache.org/jira/browse/HBASE-16213
> Project: HBase
> Issue Type: New Feature
> Reporter: binlijin
> Attachments: HBASE-16213-master_v1.patch, HBASE-16213.patch,
> HBASE-16213_v2.patch
>
>
> HFileBlock store cells sequential, current when to get a row from the block,
> it scan from the first cell until the row's cell.
> The new structure store every row's start offset with data, so it can find
> the exact row with binarySearch.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
