hbase-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Liang Xie (JIRA)" <j...@apache.org>
Subject [jira] [Commented] (HBASE-9679) Binary search in HFile block
Date Fri, 28 Mar 2014 02:59:16 GMT

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

Liang Xie commented on HBASE-9679:

when i filed this issue long long time ago, my thought was that we could impl an adaptive
index algo which is similar with Cassandra's, that means if we detect a hotspot kv inside
a HFile block in lots of read requests, then we could build a index upon this kv, the most
code be modified should the HFileIndex class.  But there's is a little risk to just do it
only in 0.94 branch:)  since we have PrefixTree already in later branch.

> Binary search in HFile block
> ----------------------------
>                 Key: HBASE-9679
>                 URL: https://issues.apache.org/jira/browse/HBASE-9679
>             Project: HBase
>          Issue Type: Improvement
>          Components: HFile
>    Affects Versions: 0.95.2, 0.94.12
>            Reporter: Liang Xie
>            Assignee: Liang Xie
>            Priority: Minor
> It's not a top priority issue, seems to me.
> Right now hbase do a linear scan to search a key within a hfile block on interst, in
special case, e.g. 100% read scenario or high read/write ratio scanario, it's useful to do
a binary search improvement to reduce the CPU cost and response time,  i think the biggest
benefit should be the cpu:)

This message was sent by Atlassian JIRA

View raw message