I just implemented a simple charting to monitor the keyspaces (please have a
look at http://www.codefreun.de/apolloUI, but therefore a Flash-plugin in
your browser is needed). I am continuing now to code the monitoring for the
column families and I am not sure where to place the charts:
- A
never mind, I see it does work for stopping messages. but still can't
simulate multiple IPs on one box.
On Fri, Jun 24, 2011 at 8:47 PM, Yang wrote:
> Thanks Jonathan.
>
> this provides a way to essentially get a copy of the outgoing messages,
> the messages onto the real connections still go th
On 6/24/2011 2:27 PM, Jonathan Ellis wrote:
Might be able to do it with
http://en.wikipedia.org/wiki/Lamport%27s_bakery_algorithm. "It is
remarkable that this algorithm is not built on top of some lower level
"atomic" operation, e.g. compare-and-swap."
This looks like it may work. Jonathan, h
Ok, here it is reworked; consider it a summary of the thread. If I left
out an important point that you think is 100% correct even if you
already mentioned it, then make some noise about it and provide some
evidence so it's captured sufficiently. And, if you're in a debate,
please try and get
Thanks Jonathan.
this provides a way to essentially get a copy of the outgoing messages,
the messages onto the real connections still go through, but I would need a
way
to shut off the real connections too.
shutting off the connections could probably done by mocking the
TCPconnection class,
but a
The MessageSink code is designed for this. Look in MessagingService.sendOneWay.
On Fri, Jun 24, 2011 at 9:58 PM, Yang wrote:
> I'd like to verify the behavior of Cassandra under some edge case message
> loss scenarios.
> it's rather difficult to reproduce such things, cuz you have to setup
> mul
I'd like to verify the behavior of Cassandra under some edge case message
loss scenarios.
it's rather difficult to reproduce such things, cuz you have to setup
multiple servers, and on each box essentially control
the message "gates" to any other nodes in the network. the realistic way
that I can
Hello,
I am trying to understand the way cassandra reads data. I've been reading a
lot and here is what I understand.
Can I get some feedback on the following claims ? Which are right and which
are wrong?
A) Upon opening an SSTTable for read, Cassandra samples one key in 100 to
speed up disk acce
On 6/24/2011 2:27 PM, Jonathan Ellis wrote:
Might be able to do it with
http://en.wikipedia.org/wiki/Lamport%27s_bakery_algorithm. "It is
remarkable that this algorithm is not built on top of some lower level
"atomic" operation, e.g. compare-and-swap."
I've been meaning to get back to reading t
On 6/24/2011 2:09 PM, Jim Newsham wrote:
On 6/24/2011 9:28 AM, Yang wrote:
without a clear description of your pseudo-code, it's difficult to
say whether it will work.
but I think it can work fine as an election/agreement protocol, which
you can use as a lock to some degree, but this requires
Yes, attempting to read a huge supercolumn would do it. I'd delete
the supercolumn and compact. You'll need your large heap to do the compaction.
2011/6/24 박상길 :
> When I set the max heap size below 12GB in this node, the cassandra was down
> by OOM, or nearly down - process is not dead but sen
Might be able to do it with
http://en.wikipedia.org/wiki/Lamport%27s_bakery_algorithm. "It is
remarkable that this algorithm is not built on top of some lower level
"atomic" operation, e.g. compare-and-swap."
On Fri, Jun 24, 2011 at 1:33 PM, AJ wrote:
> Sorry, I know this is long-winded but I ju
On 6/24/2011 9:28 AM, Yang wrote:
without a clear description of your pseudo-code, it's difficult to say
whether it will work.
but I think it can work fine as an election/agreement protocol, which
you can use as a lock to some degree, but this requires
all the potential lock contenders to all
On 6/23/2011 8:55 PM, AJ wrote:
Can any Cassandra contributors/guru's confirm my understanding of
Cassandra's degree of support for the ACID properties?
I provide official references when known. Please let me know if I
missed some good official documentation.
*Atomicity*
All individual writ
by "possible node N", I mean possible clients that will ever try to do the
locking
On Fri, Jun 24, 2011 at 12:28 PM, Yang wrote:
> without a clear description of your pseudo-code, it's difficult to say
> whether it will work.
>
> but I think it can work fine as an election/agreement protocol, w
without a clear description of your pseudo-code, it's difficult to say
whether it will work.
but I think it can work fine as an election/agreement protocol, which you
can use as a lock to some degree, but this requires
all the potential lock contenders to all participate, you can't grab a lock
bef
On Fri, Jun 24, 2011 at 6:08 AM, Joseph Stein wrote:
> cool
> now that 0.8 is out any chance Rainbird is going to be open sourced?
Not anytime soon. We're busy launching a bunch of stuff (some of which
you'll hear about at CassandraSF).
-ryan
> if not then I guess I will be building my own Scal
Sorry, I know this is long-winded but I just want to make sure before I
go through the trouble to implement this since it's not something that
can be reliably tested and requires in-depth knowledge about C*
internals. But, this ultimately deals with concurrency control so
anyone interested in
It was port 7000 that was my issue. I was thinking everything was going off
9160, and hadn't made sure that port was open.
Thanks Sasha and Jonathan.
On Fri, Jun 24, 2011 at 8:42 AM, Jonathan Ellis wrote:
> Did you try netcat to verify that you can get to the internal port on
> machine X from
Did you try netcat to verify that you can get to the internal port on
machine X from machine Y?
On Fri, Jun 24, 2011 at 8:20 AM, David McNelis
wrote:
> Running on Centos.
> We had a massive power failure and our UPS wasn't up to 48 hours without
> power...
> In this situation the IP addresses hav
Correct, this happens when the timestamp of the delete occurs after
the timestamp of the column update.
On Fri, Jun 24, 2011 at 5:40 AM, David Boxenhorn wrote:
> "it can cause index corruption IF the row delete timestamp is higher
> than the column update's."
>
> By "higher" you mean later, i.e.
Looks like the "del" command in CLI does not properly support function
calls. Can you create a ticket?
In the meantime William's suggestion to use assume should work.
On Fri, Jun 24, 2011 at 5:51 AM, Sasha Dolgy wrote:
> I have implemented counters in a limited capacity to record the number
> o
Running on Centos.
We had a massive power failure and our UPS wasn't up to 48 hours without
power...
In this situation the IP addresses have all stayed the same. I can still
connect to the "other" node from cli, so I don't think its an issue where
the iptables settings weren't saved and started
I think you have to do:
assume counters comparator as bytes;
del counters['EU'][0];
will
On Fri, Jun 24, 2011 at 6:51 AM, Sasha Dolgy wrote:
> I have implemented counters in a limited capacity to record the number
> of 'hits' that are received from a given ISO country code. CH for
> example,
cool
now that 0.8 is out any chance Rainbird is going to be open sourced?
if not then I guess I will be building my own Scala campaign, advertising
counter layer over Cassandra also with de-normalized time dimensions =8^)
[which is fine by me (looking forward to it actually) but I would rather
im
Normally, no. What you've done is fine. What is the environment?
On amazon EC2 for example, the instance could have crashed, a new one
is brought online and has a different internal IP ...
in the cassandra/logs/system.log are there any messages on the 2nd
node and how it relates to the seed nod
twitter uses it in production
http://www.slideshare.net/kevinweil/rainbird-realtime-analytics-at-twitter-strata-2011
http://techcrunch.com/2011/02/04/twitter-rainbird/
I have had it implemented a little over a month now, and haven't had
any problems with it ... although, the scale isn't quite twi
I am running 0.8.0 on CentOS. I have a 2 nodes in my cluster, one is a
seed, the other is autobootstrapped.
After having an unexpected shutdown of both of the physical machines I am
trying to restart the cluster. I first started the seed node, it went
through the normal startup process and finis
Are 0.8 counters ready for primetime real-time analytics (I have read the
technical limitations which are not frightening but good to know so to deal
with it in code)
looking for opinions/experience on it let me know. not that they wouldn't
be
I guess what I am really asking is if I am the firs
thanks guys. That clears things up.
On Jun 24, 2011, at 4:53 AM, Maki Watanabe wrote:
> A little addendum
>
> Key := Your data to identify a row
> Token := Index on the ring calculated from Key. The calculation is
> defined in replication strategy.
>
> You can lookup responsible nodes (endpoint
I have implemented counters in a limited capacity to record the number
of 'hits' that are received from a given ISO country code. CH for
example, or GB. Using phpcassa, these counts are incremented ... all
works great, except, due to a programmatic error, it was possible to
send a "null" country
"it can cause index corruption IF the row delete timestamp is higher
than the column update's."
By "higher" you mean later, i.e. some modifications to a row, then delete?
I have not seen this error in our logs, but it could happen. I have a
process where I insert historical data into Cassandra, i
You can get the best of both worlds by repeating the key in a column,
and creating a secondary index on that column.
On Fri, Jun 24, 2011 at 1:16 PM, Sylvain Lebresne wrote:
> On Fri, Jun 24, 2011 at 10:21 AM, karim abbouh wrote:
>> i want get_range_slices() function returns records sorted(orded
On Fri, Jun 24, 2011 at 10:21 AM, karim abbouh wrote:
> i want get_range_slices() function returns records sorted(orded) by the
> key(rowId) used during the insertion.
> is it possible?
You will have to use the OrderPreservingPartitioner. This is no
without inconvenience however.
See for instanc
When I set the max heap size below 12GB in this node, the cassandra was down by
OOM, or nearly down - process is not dead but sending with thrift or gossip
resulted in timeout.
When I increased the max heap to 25GB (the node has 32GB of physical memory),
it did not go to OOM, but still got timeo
On Fri, Jun 24, 2011 at 9:11 AM, Peter Schuller
wrote:
>> Atomicity
>> All individual writes are atomic at the row level. So, a batch mutate for
>> one specific key will apply updates to all the columns for that one specific
>> row atomically. If part of the single-key batch update fails, then a
i want get_range_slices() function returns records sorted(orded) by the
key(rowId) used during the insertion.
is it possible?
De : aaron morton
À : user@cassandra.apache.org
Envoyé le : Jeudi 23 Juin 2011 20h30
Objet : Re: get_range_slices result
Not sure wh
> Atomicity
> All individual writes are atomic at the row level. So, a batch mutate for
> one specific key will apply updates to all the columns for that one specific
> row atomically. If part of the single-key batch update fails, then all of
> the updates will be reverted since they all pertaine
38 matches
Mail list logo
