hbase-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Vladimir Rodionov (JIRA)" <j...@apache.org>
Subject [jira] [Commented] (HBASE-11811) Use binary search for seeking into a block
Date Fri, 26 Jun 2015 18:18:04 GMT

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

Vladimir Rodionov commented on HBASE-11811:
-------------------------------------------

I think most performance benefits we will see in skip scans (scans with filters), especially
with very  frequent skips, when most of the data are in a block cache. I [~lhofhansl] does
not mind I would reassign this ticket to myself to port patch to the current master and to
run additional tests.

> 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, 11811-wip-v4.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.3.4#6332)

Mime
View raw message