[
https://issues.apache.org/jira/browse/CASSANDRA-799?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=12834449#action_12834449
]
Stu Hood commented on CASSANDRA-799:
------------------------------------
Using getSortedKeys followed by writeSortedContents is n*log(n) rather than
n... I know that isn't the bottleneck, but we might as well do this right.
> 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: 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.
