hbase-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Chao Shi (JIRA)" <j...@apache.org>
Subject [jira] [Updated] (HBASE-9000) Linear reseek in Memstore
Date Tue, 29 Oct 2013 06:31:32 GMT

     [ https://issues.apache.org/jira/browse/HBASE-9000?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]

Chao Shi updated HBASE-9000:
----------------------------

    Attachment: hbase-9000-benchmark-program.patch

Attach a benchmark program.

$ bin/hbase org.apache.hadoop.hbase.regionserver.MemStoreReseekBenchmark
Configuration:
rows: 100000
columns per row: 10
versions: 3
size of row-key: 8
size of qualifier: 8
size of value: 8
Populating data...
Testing...
Next: 0.071 us
ReseekToNextRow: 5.92 us
ReseekToNextColumn: 3.735 us

You can see here that next is much cheaper than reseek. 

> 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
>
>
> 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)

Mime
View raw message