You are viewing a plain text version of this content. The canonical link for it is here.
Posted to issues@hbase.apache.org by "Edward Bortnikov (JIRA)" <ji...@apache.org> on 2016/12/27 09:52:58 UTC
[jira] [Commented] (HBASE-17339) Scan-Memory-First Optimization for
Get Operation
[ https://issues.apache.org/jira/browse/HBASE-17339?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15780064#comment-15780064 ]
Edward Bortnikov commented on HBASE-17339:
------------------------------------------
Use cases in which this optimization might (and will) be useful:
- Pub-Sub on top of HBase storage.
- Shared counters on top of HBase storage.
- E-commerce - editing and checking out a purchase cart.
In these cases, the churn is high but the working set is small - can fit in memory.
> Scan-Memory-First Optimization for Get Operation
> ------------------------------------------------
>
> Key: HBASE-17339
> URL: https://issues.apache.org/jira/browse/HBASE-17339
> Project: HBase
> Issue Type: Improvement
> Reporter: Eshcar Hillel
> Attachments: HBASE-17339-V01.patch
>
>
> The current implementation of a get operation (to retrieve values for a specific key) scans through all relevant stores of the region; for each store both memory components (memstores segments) and disk components (hfiles) are scanned in parallel.
> We suggest to apply an optimization that speculatively scans memory-only components first and only if the result is incomplete scans both memory and disk.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)