cassandra-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From David Boxenhorn <>
Subject Re: Tree Search in Cassandra
Date Tue, 08 Jun 2010 08:28:05 GMT
As I said above, I was wondering if I could come up with a robust algorithm,
e.g. creating the new super columns and then attaching them at the end,
which will not FUBAR my index if it fails.

On Tue, Jun 8, 2010 at 10:53 AM, Tatu Saloranta <>wrote:

> On Tue, Jun 8, 2010 at 12:07 AM, David Boxenhorn <>
> wrote:
> > I am not worried about getting the occasional wrong result - if I were, I
> > couldn't use Cassandra. I am only worried about breaking the index as a
> > whole. If concurrent changes to the tree happen to modify the same
> record, I
> > don't mind if one of them "wins" as long as the result is a working tree.
> Right: I would expect it not to be just an occasional missing or extra
> update, but rather corruption of the whole thing. The whole point of
> b-tree (and alike) structures is to bucket up set of things, splitting
> up and merging buckets. Seemingly minor flaws during that processing
> can FUBAR the structure itself.
> Or maybe I am completely misunderstanding how you were thinking of
> implementing this.
> -+ Tatu +-

View raw message