[
https://issues.apache.org/jira/browse/HBASE-11811?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14108464#comment-14108464
]
Lars Hofhansl commented on HBASE-11811:
---------------------------------------
Yeah, PE or YCSB is the next step. I expect with the current patch scanning
would be slower as we would build up the index every time we switch to a new
block. Might need a flag to updateCurrentBlock to indicate whether we want to
load the index or so.
I think the ondemand build of the index would be best (probably need to bring
back the current seek code again in that case).
I suppose I could make a separate patch just removing code duplication between
ReaderV2 and V3.
> 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: 11811-wip-v2.txt, 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)
