[
https://issues.apache.org/jira/browse/HBASE-1938?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13071842#comment-13071842
]
nkeywal commented on HBASE-1938:
--------------------------------
bq. Any chance of our calling a 'next' without doing a 'seek' first (or a
reseek)? Am worried we'd trip on a null theNext.
I compared with the previous version, the new implementation behaves as the
previous one and returns a nice "null".
> Make in-memory table scanning faster
> ------------------------------------
>
> Key: HBASE-1938
> URL: https://issues.apache.org/jira/browse/HBASE-1938
> Project: HBase
> Issue Type: Improvement
> Components: performance
> Reporter: stack
> Assignee: nkeywal
> Priority: Blocker
> Fix For: 0.92.0
>
> Attachments: 20110726_1938_KeyValueSkipListSet.patch,
> 20110726_1938_MemStore.patch, 20110726_1938_MemStoreScanPerformance.java,
> MemStoreScanPerformance.java, MemStoreScanPerformance.java,
> caching-keylength-in-kv.patch, test.patch
>
>
> This issue is about profiling hbase to see if I can make hbase scans run
> faster when all is up in memory. Talking to some users, they are seeing
> about 1/4 million rows a second. It should be able to go faster than this
> (Scanning an array of objects, they can do about 4-5x this).
--
This message is automatically generated by JIRA.
For more information on JIRA, see: http://www.atlassian.com/software/jira
