[
https://issues.apache.org/jira/browse/CASSANDRA-193?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=12722860#action_12722860
]
Stu Hood commented on CASSANDRA-193:
------------------------------------
So after a little bit of discussion, we decided to drop the Treap idea, and go
with a B+Tree instead. The Treap would have been slightly faster for
invalidations because of the priority-optimization, but it would be much less
memory efficient because of excess inner nodes. Also, the invalidation count
can just as easily be represented as a counter on each leaf node as it could
have been by the height of the leaf in the Treap.
> Proactive repair
> ----------------
>
> Key: CASSANDRA-193
> URL: https://issues.apache.org/jira/browse/CASSANDRA-193
> Project: Cassandra
> Issue Type: New Feature
> Reporter: Jonathan Ellis
> Assignee: Stu Hood
> Fix For: 0.5
>
>
> Currently cassandra supports "read repair," i.e., lazy repair when a read is
> done. This is better than nothing but is not sufficient for some cases (e.g.
> catastrophic node failure where you need to rebuild all of a node's data on a
> new machine).
> Dynamo uses merkle trees here. This is harder for Cassandra given the CF
> data model but I suppose we could just hash the serialized CF value.
--
This message is automatically generated by JIRA.
-
You can reply to this email to add a comment to the issue online.
