[jira] [Commented] (HBASE-9000) Linear reseek in Memstore

["Chao Shi (JIRA)" <ji...@apache.org>]

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

Chao Shi commented on HBASE-9000:
---------------------------------

I don't think tailSet is efficient, considering a scenario that a filter is present and keep returning SEEK_NEXT_COL. A call to tailSet does not make use of the current position and require relocate to there over the skip list. In most cases, where maxVersions of a table is set to a small value, it can alternatively skip at most maxVersions keys.

> Linear reseek in Memstore
> -------------------------
>
>                 Key: HBASE-9000
>                 URL: https://issues.apache.org/jira/browse/HBASE-9000
>             Project: HBase
>          Issue Type: Improvement
>    Affects Versions: 0.89-fb
>            Reporter: Shane Hogan
>            Priority: Minor
>             Fix For: 0.89-fb
>
>
> This is to address the linear reseek in MemStoreScanner. Currently reseek iterates over the kvset and the snapshot linearly by just calling next repeatedly. The new solution is to do this linear seek up to a configurable maximum amount of times then if the seek is not yet complete fall back to logarithmic seek.



--
This message was sent by Atlassian JIRA
(v6.1#6144)