[
https://issues.apache.org/jira/browse/HBASE-11811?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14107912#comment-14107912
]
Lars Hofhansl commented on HBASE-11811:
---------------------------------------
When I do larger KV (values of 90 bytes) the old code path takes 19.5s (there
are fewer keys to compare compared to the value size). With the patch it takes
8.3s.
> Use binary search for seeking into a block
> ------------------------------------------
>
> Key: HBASE-11811
> URL: https://issues.apache.org/jira/browse/HBASE-11811
> Project: HBase
> Issue Type: Brainstorming
> Reporter: Lars Hofhansl
> Attachments: block_index-v2.txt
>
>
> Currently upon every seek (including Gets) we need to linearly look through
> the block from the beginning until we find the Cell we are looking for.
> It should be possible to build a simple cache of offsets of Cells for each
> block as it is loaded and then use binary search to find the Cell in question.
--
This message was sent by Atlassian JIRA
(v6.2#6252)
