Hi,
Just a quick question on seed nodes and auto bootstrap.
Am I correct in that a seed node won't be able to AutoBootstrap? And if so,
will a seed node newly added to an existing cluster then not take long time
before it actually starts getting any work to it? I mean, if it doesn't start
with
Hi all,
We're starting to prototype Cassandra for use in a production system and
became concerned about data corruption after reading the excellent article:
http://blog.evanweaver.com/articles/2009/07/06/up-and-running-with-cassandra/
where Evan Weaver writes:
"Cassandra is an alpha product and
what's the mean of opp? And How can i make the "start" and "finish" useful and
make sense?
2010-06-09
9527
发件人： Ben Browning
发送时间： 2010-06-02 21:08:57
收件人： user
抄送：
主题： Re: Range search on keys not working?
They exist because when using OPP they are useful and make sense.
On Wed,
But I think use SSD can boost read performance, this is the main problem now
for us to use Cassandra.
On Tue, Jun 8, 2010 at 10:16 PM, Jonathan Ellis wrote:
> cassandra is designed to do less random i/o than b-tree based systems
> like tokyo cabinet. ssds are not as useful for most workloads.
>
of course. compaction is always O(N) with the size of the data
On Mon, Jun 7, 2010 at 9:51 AM, Jeremy Davis
wrote:
> Reads, ok.. What about Compactions? Is the cost of compacting going to be
> ever increasing with the number of columns?
>
>
>
> On Sat, Jun 5, 2010 at 7:30 AM, Jonathan Ellis wro
On Mon, Jun 7, 2010 at 9:04 AM, Utku Can Topçu wrote:
> Hey All,
>
> First of all I'll start with some questions on the default behavior of
> get_range_slices method defined in the thrift API.
>
> Given a keyrange with start-key "kstart" and end-key "kend", assuming
> kstart * Is it true that I'll
Sounds like you had some bad hardware take down your index files.
(Cassandra fsyncs them after writing them and before renaming them to
being live, so if it's missing pieces then it's always been hardware
at fault that I have seen.
You could try rebuilding your index files from the data files, but
Java transports buffer internally. there is no TBufferedTransport the
way there is in C#.
(moving to user@)
On Tue, Jun 8, 2010 at 10:31 AM, Subrata Roy wrote:
> We are using Cassandra 0.6.2 with hector/thrift client, and our
> application performance is really slow. We are not sure that it is
Sounds like you ran into
https://issues.apache.org/jira/browse/CASSANDRA-1169. The only
workaround until that is fixed is to re-run repair.
On Tue, Jun 8, 2010 at 7:17 AM, Ian Soboroff wrote:
> And three days later, AE stages are still running full-bore. So I conclude
> this is not a very good
I can't divulge this particular test data, as it was borrowed from a
dataset which is not public.
I will see if I can reproduce the scenario, however, using other data
suitable for a bug report.
On Tue, Jun 8, 2010 at 2:18 PM, Jonathan Ellis wrote:
> that does sound like a bug. can you give us t
that does sound like a bug. can you give us the data to insert that
allows reproducing this?
On Tue, Jun 8, 2010 at 10:20 AM, Jonathan Shook wrote:
> Possible bug...
>
> Using a slice range with the empty sentinel values, and a count of 1
> sometimes yields 2 ColumnOrSuperColumns, sometimes 1.
>
Possible bug...
Using a slice range with the empty sentinel values, and a count of 1
sometimes yields 2 ColumnOrSuperColumns, sometimes 1.
The inconsistency had lead me to believe that the count was not
working, hence the additional confusion.
There was a particular key which returns exactly 2
Co
I'm curious, did this help at all?
On Sat, May 29, 2010 at 3:03 PM, Jonathan Ellis wrote:
> You could try setting the compaction thread to a lower priority. You
> could add a thread priority to NamedThreadPool, and pass that up from
> CompactionExecutor constructor. According to
> http://www.ja
yes, if you're going from 1 to 2 then
1. nodetool drain & stop original node
2. copy everything from *your keyspaces* in data/ directories (but not
system keyspace!) to new node
3. start both nodes with replicationfactor=2 and autobootstrap=false
[the default]
will be faster.
On Tue, Jun 8, 2010
I was misreading the result with the original slice range.
I should have been expecting exactly 2 ColumnOrSuperColumns, which is
what I got. I was erroneously expecting only 1.
Thanks!
Jonathan
2010/6/8 Ted Zlatanov :
> On Mon, 7 Jun 2010 17:20:56 -0500 Jonathan Shook wrote:
>
> JS> The point i
No, there will be deletes and inserts in the middle. But I can assume that
the index will only grow. There will be few deletes.
On Tue, Jun 8, 2010 at 7:04 PM, Tatu Saloranta wrote:
> On Tue, Jun 8, 2010 at 1:28 AM, David Boxenhorn wrote:
> > As I said above, I was wondering if I could come up
On Tue, Jun 8, 2010 at 1:28 AM, David Boxenhorn wrote:
> 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.
>
Is this append-only? That is, never delete
Hello,
I've had a server crash, and after rebooting I cannot start the Cassandra
instance, it's a one-node cluster. I'm running cassandra 0.6.1 on Debian Linux
and jre 1.6.0_12.
Is my data lost, should I recreate the DB?
The error message is:
==
On Mon, 7 Jun 2010 17:20:56 -0500 Jonathan Shook wrote:
JS> The point is to get the "last" super-column.
...
JS> Is the Perl Thrift client problematic, or is there something else that
JS> I am missing?
Try Net::Cassandra::Easy; if it does what you want, look at the debug
output or trace the cod
And three days later, AE stages are still running full-bore. So I conclude
this is not a very good approach.
I wonder what will happen when I lose a disk (which is essentially the same
as what I did -- rm the data directory). What happens if I lose a disk
while the AE stages are running? Since
cassandra is designed to do less random i/o than b-tree based systems
like tokyo cabinet. ssds are not as useful for most workloads.
On Mon, Jun 7, 2010 at 8:37 AM, Héctor Izquierdo wrote:
> Hi everyone.
>
> I wanted to know if anybody has had any experience with cassandra on flash
> storage. At
Hi.
I have a cluster with only 1 node with a lot of datas (500 Go) .
I want add a new node with the same datas (with a ReplicationFactor 2)
The method normal is :
stop node.
add a node.
change replication factor to 2.
start nodes
use nodetool repair
But , I didn't know if this other method
On 08/06/10 03:17, Shuai Yuan wrote:
Would you please tell the performance you measured? Although I don't
have any experience relating to flash-drive, I'm very interested in
switching to SSD.
I don't have any benchmark around, but I can tell that those io-drives
are incredibly fast, not to m
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
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
Greetings,
I am also exploring erlang and cassandra via thrift..
but when inserting i've encountered this error.
(t...@ubuntu)11> thrift_client:call(C,'insert',[
"Keyspace1","1",#columnPath{column_family="Standard1", column="email"},
"t...@example.com",1,1 ]).
=ERROR REPORT 8-Jun-2010::1
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.
O
27 matches
Mail list logo
