Hello,
I have a question about Cassandra's consistency in the case of failure
conditions. Am I correct in assuming that in the event of a node failure
with write consistency ALL (assuming the failure happened after the
coordinator started the write), a subsequent read with ONE could return
st
number of cycles required to answer you is,
yet, not scientifically determined in our implementation, but I feel it's
sufficient in most deployments right now, and the knob we have to turn if
not is -Dcassandra.ring_delay_ms.
On Tue, Sep 30, 2014 at 10:50 AM, William Katsak wrote:
Hello,
Hello,
Forgive me if I have missed anything in the obvious locations, but I am trying
to find out if anyone has done an analysis of the gossip protocol as
implemented in Cassandra? In particular, I am interested in the the theoretical
propagation time (to all nodes) of a change. For example, if
a new facility?
Again, my codebase is on top of Cassandra 1.1.6. I would very much
appreciate any insight anyone could give me.
Thanks very much,
Bill Katsak
On 04/08/2013 12:10 PM, William Katsak wrote:
Hello,
I am sorry to bother the list with this question, but I was wondering,
assuming I have
Hello,
I am sorry to bother the list with this question, but I was wondering,
assuming I have many saved (small) mutations (of the type that hinted
handoff uses), is there any easy way to put these all together and bulk
transmit (stream) them to a destination node?
My codebase is based on Ca
Hello,
I am working on some experimental modifications to Cassandra and I was
wondering if someone can help me with an easy answer to this:
Say I have a column family in the system keyspace where I am keeping
some bookkeeping data (couple hundred thousand columns) at times.
I don't want to
Hello,
I am working on some modifications of Cassandra in an academic setting
(research code, not for a class), and have a question regarding bulk
streaming of data across the network (e.g. between nodes).
Assume that I have some known set of key/column family combos that are
known good/curr
Hello,
I have a question that may seem strange. Assume that I have some *known* set of
rows in a (potentially very) large data set that I know are out of consistency
across the replicas. I can obviously bring these back into consistency by
issuing standard reads (with read repair probability se
CQL layer on the server adds the timestamp. I am less familiar with the
CQL code, maybe something screwy is going on there. 1.1.6 is out, do you see
the same behavior there?
-Jeremiah
On Oct 24, 2012, at 3:57 PM, William Katsak wrote:
Here is what I am seeing on each replica node. This is
ntained in the RowMutation.
On Wed, Oct 24, 2012 at 2:57 PM, William Katsak wrote:
Hello,
I sent this message a few days ago, but it seems to have gotten lost (I
don't see it on the archive), so I am trying again.
-
I am using Cassandra for some academic-type work that involves som
Hello,
I sent this message a few days ago, but it seems to have gotten lost (I
don't see it on the archive), so I am trying again.
-
I am using Cassandra for some academic-type work that involves some
hacking of replica placement, etc. and I am observing a strange behavior
(well, strang
11 matches
Mail list logo