[
https://issues.apache.org/jira/browse/HBASE-9000?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13814700#comment-13814700
]
Chao Shi commented on HBASE-9000:
---------------------------------
bq. Should we do the same thing in StoreFileScanner?
Yes, I think so.
bq. If so, why not do this in StoreScanner, for example, call next some times
before call reseek...
This is because StoreScanner does not have enough knownlege to judge whether do
a reseek vs. several times of next. As discussed before in this thread, an
attempt to call next to do linear reseek may hit uncached block, whose cost is
huge compared to a logarithmic reseek that touches only cached index blocks.
> 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
>
> Attachments: hbase-9000-benchmark-program.patch,
> hbase-9000-port-fb.patch, hbase-9000.patch
>
>
> 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)
