[
https://issues.apache.org/jira/browse/CASSANDRA-7282?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14138519#comment-14138519
]
Jason Brown edited comment on CASSANDRA-7282 at 9/18/14 5:17 AM:
-----------------------------------------------------------------
just an update: running into some weird problems getting trunk/benedict's
branch to run on my servers - I think it might be some settings I have in the
cassandra.in.sh script conflict with 3.0 (i might have had some crazy crap a
priori). will figure it out in the morning when i'm not falling asleep.
was (Author: jasobrown):
just an update: running into some weird problems getting trunk to run on my
servers - I think it might be some settings I have in the cassandra.in.sh
script conflict with 3.0. will figure it out in the morning when i'm not
falling asleep.
> Faster Memtable map
> -------------------
>
> Key: CASSANDRA-7282
> URL: https://issues.apache.org/jira/browse/CASSANDRA-7282
> Project: Cassandra
> Issue Type: Improvement
> Components: Core
> Reporter: Benedict
> Assignee: Benedict
> Labels: performance
> Fix For: 3.0
>
> Attachments: profile.yaml, reads.svg, run1.svg, writes.svg
>
>
> Currently we maintain a ConcurrentSkipLastMap of DecoratedKey -> Partition in
> our memtables. Maintaining this is an O(lg(n)) operation; since the vast
> majority of users use a hash partitioner, it occurs to me we could maintain a
> hybrid ordered list / hash map. The list would impose the normal order on the
> collection, but a hash index would live alongside as part of the same data
> structure, simply mapping into the list and permitting O(1) lookups and
> inserts.
> I've chosen to implement this initial version as a linked-list node per item,
> but we can optimise this in future by storing fatter nodes that permit a
> cache-line's worth of hashes to be checked at once, further reducing the
> constant factor costs for lookups.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
