Hi:All
in the code of SSTableReader.java
private static final ReferenceQueue finalizerQueue = new
ReferenceQueue()
{{
Runnable runnable = new Runnable()
{
public void run()
{
while (true)
{
SSTableDelet
The only reason to put parts of the same app in different keyspaces is
if you want to adjust the replicationfactor or strategy (since those
are per-KS).
On Fri, Jun 4, 2010 at 11:12 AM, Philip Stanhope wrote:
> This is a data modeling question, not operational like my previous ones today.
>
> I h
You don't. You maintain CFs with denormalized views of the data you
want, instead.
Eric wrote a good explanation with sample code at
http://www.rackspacecloud.com/blog/2010/05/12/cassandra-by-example/
On Fri, Jun 4, 2010 at 3:24 PM, Lev Stesin wrote:
> Hi,
>
> I am not sure how to implement mul
reading 1 column, is faster than reading lots of columns. this
shouldn't be surprising.
On Fri, Jun 4, 2010 at 3:52 PM, Arya Goudarzi wrote:
> Hi Fellows,
>
> I have the following design for a system which holds basically key->value
> pairs (aka Columns) for each user (SuperColumn Key) in differ
looks like you changed your partitioner
On Fri, Jun 4, 2010 at 11:31 PM, Ma Xiao wrote:
> Cassdra can't start it's service with following error, what's wrong with it?
>
> ERROR 14:28:22,631 Exception encountered during startup.
> java.lang.StringIndexOutOfBoundsException: String index out of ran
Ah, right. Unfortunately the old google groups for Cassandra are
deleted, hence the broken links.
On Tue, Jun 1, 2010 at 4:06 AM, gabriele renzi wrote:
> On Mon, May 31, 2010 at 8:50 PM, Jonathan Ellis wrote:
>> Doesn't ring a bell. Maybe if you included the link to which you refer?
>
> I gues
#16 is very simple: it allows you to make very large rows. That is all.
Other things being equal, doing reads from really big rows will be
slower (since the row index will take longer to read) and this patch
does not change this.
On Fri, Jun 4, 2010 at 5:47 PM, Jeremy Davis
wrote:
>
> https://i
Ahh, I think this is the key section I missed:
"you can still have imbalances if your Tokens do not divide up the
range evenly, so you should specify InitialToken to your first nodes
as i * (2**127 / N) for i = 1 .. N."
I'm going to reset my cluster with initial tokens like that. Thanks!
-Mike
I'm seeing lots of ParNew messages which is affected performance,
along the lines of:
INFO 17:54:18,567 GC for ParNew: 1522 ms, 69437384 reclaimed leaving 979692384
used; max is 4424663040
INFO 17:54:22,567 GC for ParNew: 1989 ms, 69323576 reclaimed leaving 981439840
used; max is 4424663040
INF
> INFO 17:54:18,567 GC for ParNew: 1522 ms, 69437384 reclaimed leaving
> 979692384
> used; max is 4424663040
> INFO 17:54:22,567 GC for ParNew: 1989 ms, 69323576 reclaimed leaving
> 981439840
> used; max is 4424663040
> INFO 17:54:26,187 GC for ParNew: 1337 ms, 69447160 reclaimed leaving
> 98
> Eric wrote a good explanation with sample code at
> http://www.rackspacecloud.com/blog/2010/05/12/cassandra-by-example/
Regarding the schema description and analogy problem mentioned in the
article; I found that reading the BigTable paper helped a lot for me.
It seemed very useful to me to think
It sounds like you are getting a handle on it, but maybe in a round-about way.
Here are some ways I like of conceptualizing Cassandra. Maybe they can
shorten your walk.
Either the grid analogy or the maps-of-maps analogy can apply, as they
both map conceptually to the way that we use a column fami
Sorry for the extra post. This version has confusing parts removed and
better formatting.
It sounds like you are getting a handle on it, but maybe in a round-about way.
Here are some ways I like of conceptualizing Cassandra. Maybe they can help.
Either the grid analogy or the maps-of-maps analogy
13 matches
Mail list logo
