[
https://issues.apache.org/jira/browse/CASSANDRA-799?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Stu Hood updated CASSANDRA-799:
-------------------------------
Attachment: 799-example.diff
This is what I had in mind, although I managed to break a testcase.
Honestly, I want to get your fix in so we can branch 0.6... I'm not really
concerned about which solution we go with.
> memtable sort is the bottleneck for range query performance
> -----------------------------------------------------------
>
> Key: CASSANDRA-799
> URL: https://issues.apache.org/jira/browse/CASSANDRA-799
> Project: Cassandra
> Issue Type: Improvement
> Components: Core
> Reporter: Jonathan Ellis
> Assignee: Jonathan Ellis
> Priority: Minor
> Fix For: 0.6
>
> Attachments:
> 0001-refactor-IFlushable-contract-to-push-differences-b-t-M.txt,
> 0002-use-a-sorted-map-for-memtable-contents-to-make-range-q.txt,
> 0003-refactor-to-make-memtablesPendingFlush-a-member-variab.txt,
> 799-example.diff, 799-unbounded-flushwriter.txt, 799.txt
>
>
> The obvious remedy is to use a sorted map. Unfortunately, keeping the map
> sorted constantly w/ TreeMap was about 30% slower than HashMap + sort back
> when we were doing manual locking. Let's see what the overhead is for
> ConcurrentSkiplistMap vs NBHM.
--
This message is automatically generated by JIRA.
-
You can reply to this email to add a comment to the issue online.
