The reason why counters work is that addition is commutative, i.e.
x + y = y + x
but deletes are not commutative, i.e.
x + delete ≠ delete + x
so the result depends on the order in which the messages arrive.
2011/9/21 Radim Kolar
> Dne 21.9.2011 12:07, aaron morton napsal(a):
>
> see techn
Initial state: 3 nodes, RF=3, version = 0.7.8, some queries are with
CL=QUORUM
1. Add node with with correct token for 4 nodes, repair
2. Move first node to balance 4 nodes, repair
3. Move second node
===> Start getting timeouts, Hector warning: WARNING - Error:
me.prettyprint.hector.api.exceptio
How can I tell what's causing dropped messages?
Is it just too much activity? I'm not getting any other, more specific
messages, just these:
WARN [ScheduledTasks:1] 2011-08-15 11:33:26,136 MessagingService.java (line
504) Dropped 1534 MUTATION messages in the last 5000ms
WARN [ScheduledTasks:1] 2
This is part of a much bigger problem, one which has many parts, among them:
1. Cassandra is complex. Getting a gestalt understanding of it makes me
think I understand how Alzheimer's patients must feel.
2. There is no official documentation. Perhaps everything is out there
somewhere, who knows?
3
I think that Yang Yang's comment on
https://issues.apache.org/jira/browse/CASSANDRA-2495
is correct. TTL could be used to expire the history. The TTL value could
either be a configurable parameter, or part of the counter API.
On Mon, Jul 25, 2011 at 9:48 PM, Aaron Turner wrote:
> On Mon, Jul 2
Why do you need another CF? Is there something wrong with repeating the key
as a column and indexing it?
On Fri, Jul 22, 2011 at 7:40 PM, Patrick Julien wrote:
> Exactly. In any case, I just answered my own question. If I need
> range, I can just make another column family where the column nam
o cancel. That's not acceptable. I simply don't know what to do
> now.
>
>
>
> On 7/20/2011 8:47 AM, David Boxenhorn wrote:
>
> I have this problem too, and I don't understand why.
>
> I can repair my nodes very quickly by looping though all my data (
I have this problem too, and I don't understand why.
I can repair my nodes very quickly by looping though all my data (when you
read your data it does read-repair), but nodetool repair takes forever. I
understand that nodetool repair builds merkle trees, etc. etc., so it's a
different algorithm, b
It would be nice if this were fixed before I move up to 0.8...
On Mon, Jul 18, 2011 at 3:19 PM, Boris Yen wrote:
> If it would not cause the dev team to much trouble, I think the cassandra
> should maintain the backward compatability regarding the generation of the
> default index_name, otherwis
Ah, that's it. I'm on 0.7
On Mon, Jul 18, 2011 at 1:27 PM, Boris Yen wrote:
> which version of cassandra do you use? What I mentioned here only happens
> on 0.8.1.
>
>
> On Mon, Jul 18, 2011 at 4:44 PM, David Boxenhorn wrote:
>
>> I have lots of indexes on col
I have lots of indexes on columns with the same name. Why don't I have this
problem?
For example:
Keyspace: City:
Replication Strategy: org.apache.cassandra.locator.SimpleStrategy
Replication Factor: 3
Column Families:
ColumnFamily: AttractionCheckins
Columns sorted by: org.apac
imestamp-per-column gets large quickly.
>
> On Wed, Jul 13, 2011 at 7:31 AM, David Boxenhorn
> wrote:
> > Is that the actual reason?
> >
> > This seems like a big inefficiency to me. For those of us who don't worry
> > about this extreme edge case (that proba
e developers use hash
>>> instead of timestamp. If hash value comes from other node is not a match, a
>>> read repair would perform. so that correct data can be returned.
>>>
>>>
>>> On Wed, Jul 13, 2011 at 5:08 PM, David Boxenhorn wrote:
>>>
>&g
match, a
> read repair would perform. so that correct data can be returned.
>
>
> On Wed, Jul 13, 2011 at 5:08 PM, David Boxenhorn wrote:
>
>> If you have to pieces of data that are different but have the same
>> timestamp, how can you resolve consistency?
>>
>> Thi
amp does not guarantee data consistency,
> but hash does.
>
> Boris
>
>
> On Wed, Jul 13, 2011 at 4:27 PM, David Boxenhorn wrote:
>
>> I just saw this
>>
>> http://wiki.apache.org/cassandra/DigestQueries
>>
>> and I was wondering why it returns a ha
I just saw this
http://wiki.apache.org/cassandra/DigestQueries
and I was wondering why it returns a hash of the data. Wouldn't it be better
and easier to return the timestamp? You don't really care what the data is,
you only care whether it is more or less recent than another piece of data.
Ah, I get it. Your normal access pattern should be one row at a time.
On Sun, Jul 3, 2011 at 11:41 AM, David Boxenhorn wrote:
>>> What do you think ?
>>
>> I think you should strongly consider denormalizing so that you can
>> read ranges from a single row instea
>> What do you think ?
>
> I think you should strongly consider denormalizing so that you can
> read ranges from a single row instead.
Why do you recommend denormalizing instead of secondary indexes?
Does drop work in a similar way?
When I drop a CF and add it back with a different schema, it seems to work.
But I notice that in between the drop and adding it back, when the CLI
tells me the CF doesn't exist, the old data is still there.
I've been assuming that this works, but just wanted to m
"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
I think very high uptime, and very low data loss is achievable in
Cassandra, but, for new users there are TONS of gotchas. You really
have to know what you're doing, and I doubt that many people acquire
that knowledge without making a lot of mistakes.
I see above that most people are talking about
box http://spyced.blogspot.com/2010/01/linux-performance-basics.html
>
> Hope that helps.
>
> -
> Aaron Morton
> Freelance Cassandra Developer
> @aaronmorton
> http://www.thelastpickle.com
>
> On 7 Jun 2011, at 00:30, David Boxenhorn wrote:
>
>>
writes causes the three nodes
to decide to compact at the same time. These bursts are followed by
periods of relative quiet, so there should be time for the other two
nodes to compact one at a time.
On Mon, Jun 6, 2011 at 3:27 PM, David Boxenhorn wrote:
>
> Version 0.7.3.
>
> Yes, I am t
Jonathan, are Donal Zang's results (10x slowdown) typical?
On Mon, Jun 6, 2011 at 3:14 PM, Jonathan Ellis wrote:
> On Mon, Jun 6, 2011 at 6:28 AM, Donal Zang wrote:
> > Another thing I noticed is : if you first do insertion, and then build
> the
> > secondary index use "update column family ...
Is there really a 10x difference between indexed CFs and non-indexed CFs?
On Mon, Jun 6, 2011 at 11:05 AM, Donal Zang wrote:
> On 06/06/2011 05:38, Jonathan Ellis wrote:
>
>> Index updates require read-before-write (to find out what the prior
>> version was, if any, and update the index accordin
Is there some deep architectural reason why compaction can't be
replication-aware?
What I mean is, if one node is doing compaction, its replicas
shouldn't be doing compaction at the same time. Or, at least a quorum
of nodes should be available at all times.
For example, if RF=3, and one node is d
In order to fully implement the functionality of super columns using
compound columns I need to be able to select multiple column ranges - this
would be functionally equivalent to selecting multiple super columns (and
more!).
I would like to request the following CQL syntax:
SELECT [FIRST N] [REV
t; (column=boobar:42:24, value=v4, timestamp=1305621115813000)
> => (column=boobar:42:42, value=v5, timestamp=1305621125563000)
> => (column=foo:42:24, value=v2, timestamp=1305621096473000)
> => (column=foo:24:24, value=v1, timestamp=1305621085548000)
> => (column=foobar:42:24, valu
anJose']='51';
> Value inserted.
>
>
>
>
>
> On Mon, May 16, 2011 at 2:34 PM, Aaron Morton wrote:
>
>> What do you mean by composite column names?
>>
>> Do the data type functions supported by get and set help? Or the assume
>> statement?
>>
>> Aaron
>> On 17/05/2011, at 3:21 AM, David Boxenhorn wrote:
>>
>> > Is there a way to view composite column names in the CLI?
>> >
>> > Is there a way to input them (i.e. in the set command)?
>> >
>>
>
>
Is there a way to view composite column names in the CLI?
Is there a way to input them (i.e. in the set command)?
> Aaron Morton
> Freelance Cassandra Developer
> @aaronmorton
> http://www.thelastpickle.com
>
> On 14 May 2011, at 00:15, David Boxenhorn wrote:
>
> Actually, I want a way to propagate *any* changes from development to
> staging to production, but schema changes are t
chema changes are you making? can you manage them as a CLI
> script under source control ?
>
>
> You may also be interested in CASSANDRA-2221.
>
> Cheers
> Aaron
> -
> Aaron Morton
> Freelance Cassandra Developer
> @aaronmorton
> http://www.thela
My use case is like this: I have a development cluster, a staging cluster
and a production cluster. When I finish a set of migrations (i.e. changes)
on the development cluster, I want to apply them to the staging cluster, and
eventually the production cluster. I don't want to do it by hand, because
Terje
>
> On Mon, May 9, 2011 at 5:58 PM, David Boxenhorn wrote:
>
>> "I'm also not too much in favor of triggering major compactions, because
>> it mostly have a nasty effect (create one huge sstable)."
>>
>> If that is the case, why can't majo
"I'm also not too much in favor of triggering major compactions, because it
mostly have a nasty effect (create one huge sstable)."
If that is the case, why can't major compactions create many,
non-overlapping SSTables?
In general, it seems to me that non-overlapping SSTables have all the
advantag
I think this is a question specifically for Patricio Echagüe, though I
welcome answers from anyone else who can contribute...
We are considering using Magnolia as a CMS. Magnolia uses Jackrabbit for its
data storage. Jackrabbit is a JCR implementation.
Questions:
1. Can we plug Cassandra into JC
What is the format of ?
On Thu, May 5, 2011 at 6:14 PM, Eric Evans wrote:
> On Thu, 2011-05-05 at 17:44 +0300, David Boxenhorn wrote:
> > Is there a spec for compound columns?
> >
> > I want to know the exact format of compound columns so I can adhere to
> > i
t;.getBytes()><0>
> * end = <3><"foo".getBytes()><1>
> * then he will be sure to get *all* the columns whose first component is
> "foo".
> * If for a component, the 'end-of-component' is != 0, there should not be
> any
> *
Is there a spec for compound columns?
I want to know the exact format of compound columns so I can adhere to it.
For example, what is the separator - or is some other format used (e.g.
length:value or type:length:value)?
I'm looking at Magnolia at the moment (as in, this second). At first glance,
it looks like I should be able to use Cassandra as the database:
http://documentation.magnolia-cms.com/technical-guide/content-storage-and-structure.html#Persistent_storage
If it can use a filesystem as its database, it
Does anyone know of a content management system that can be easily
customized to use Cassandra as its database?
(Even better, if it can use Cassandra without customization!)
If I have a database that partitions naturally into non-overlapping
datasets, in which there are no references between datasets, where each
dataset is quite large (i.e. large enough to merit its own cluster from the
point of view of quantity of data), should I set up one cluster per database
or one
On Mon, May 2, 2011 at 7:52 PM, Tyler Hobbs wrote:
> On Mon, May 2, 2011 at 5:05 AM, David Boxenhorn wrote:
>
>> Wouldn't it be the case that the once-used rows in your batch process
>> would quickly be traded out of the cache, and replaced by frequently-used
>> r
Is this still true?
*Note: The greater-than and less-than operators (> and <) result in key
ranges that are inclusive of the terms. There is no supported notion of
“strictly” greater-than or less-than; these operators are merely supported
as aliases to >= and <=.
*
I think that making > and < ali
Wouldn't it be the case that the once-used rows in your batch process would
quickly be traded out of the cache, and replaced by frequently-used rows?
This would be the case even if your batch process goes on for a long time,
since caching is done on a row-by-row basis. In effect, it would mean that
If you had one big cache, wouldn't it be the case that it's mostly populated
with frequently accessed rows, and less populated with rarely accessed rows?
In fact, wouldn't one big cache dynamically and automatically give you
exactly what you want? If you try to partition the same amount of memory
you should have
> anyway).
>
> Shimi
>
>
> On Sun, May 1, 2011 at 2:03 PM, David Boxenhorn wrote:
>
>> I'm having problems administering my cluster because I have too many CFs
>> (~40).
>>
>> I'm thinking of combining them all into one big CF. I w
I'm having problems administering my cluster because I have too many CFs
(~40).
I'm thinking of combining them all into one big CF. I would prefix the
current CF name to the keys, repeat the CF name in a column, and index the
column (so I can loop over all rows, which I have to do sometimes, for s
How about a more general (and encrypted!) solution: Add a password
decryption class to the YAML. If it is not defined, that means the passwords
are not encrypted, if it is defined, use it to decrypt the passwords.
That way, you need to steal both the YAML and the decryption class if you
want to st
Thanks, Jonathan. I think I understand now.
To sum up: Everything would work, but if your only equality is on "type"
(all the rest inequalities), it could be very inefficient.
Is that right?
On Thu, Apr 14, 2011 at 7:22 PM, Jonathan Ellis wrote:
> On Thu, Apr 14, 2011 at 6
ow how you want to read things back and need to deal with lots-o-data
> I would start testing with custom indexes. Then compare to the built in
> ones, it should be reasonably simple add them for a test.
>
> <http://www.mail-archive.com/user@cassandra.apache.org/msg12136.html>Hope
he linked article.
>
> Or you can make your own secondary indexes using row keys as the index
> values.
>
> If you have billions of rows, how many do you need to read back at once?
>
> Hope that helps
> Aaron
>
> On 14 Apr 2011, at 04:23, David Boxenhorn wrote:
>
Is it possible in 0.7.x to have indexes on heterogeneous rows, which have
different sets of columns?
For example, let's say you have three types of objects (1, 2, 3) which each
had three members. If your rows had the following pattern
type=1 a=? b=? c=?
type=2 d=? e=? f=?
type=3 g=? h=? i=?
coul
How do you write to two versions of Cassandra from the same client? Two
versions of Hector?
On Mon, Mar 14, 2011 at 6:46 PM, Robert Coli wrote:
> On Mon, Mar 14, 2011 at 8:39 AM, Jedd Rashbrooke
> wrote:
> > But more importantly for us it would mean we'd have just the
> > one major outage, ra
I you do it, I'd recommend BigDecimal. It's an exact type, and usually what
you want.
On Mon, Mar 14, 2011 at 3:40 PM, Jonathan Ellis wrote:
> We'd be happy to commit a patch contributing a DoubleType.
>
> On Sun, Mar 13, 2011 at 7:36 PM, Paul Teasdale
> wrote:
> > I am quite new to Cassandra a
If RF=2 and CL= QUORUM, you're getting no benefit from replication. When a
node is in GC it stops everything. Set RF=3, so when one node is busy the
cluster will still work.
On Tue, Mar 8, 2011 at 11:46 AM, ruslan usifov wrote:
>
>
> 2011/3/8 Chris Goffinet
>
>> How large are your SSTables on di
at I didn't backup the data files before I upgraded.
>
> Shimi
>
> On Tue, Feb 22, 2011 at 2:24 PM, David Boxenhorn wrote:
>
>> Shimi,
>>
>> I am getting the same error that you report here. What did you do to solve
>> it?
>>
>> David
>>
&
Shimi,
I am getting the same error that you report here. What did you do to solve
it?
David
On Thu, Feb 10, 2011 at 2:54 PM, shimi wrote:
> I upgraded the version on all the nodes but I still gets the Exceptions.
> I run cleanup on one of the nodes but I don't think there is any cleanup
> goin
odes and a lot of small CFs
(small relative to the total amount of data).
On Mon, Feb 21, 2011 at 9:58 PM, Aaron Morton wrote:
> Sounds a bit like this idea
> http://www.mail-archive.com/dev@cassandra.apache.org/msg01799.html
>
> Aaron
>
> On 22/02/2011, at 1:28 AM, David Boxen
Cassandra is both distributed and replicated. We have Replication Factor but
no Distribution Factor!
Distribution Factor would define over how many nodes a CF should be
distributed.
Say you want to support millions of multi-tenant users in clusters with
thousands of nodes, where you don't know th
rdered data from a TimeUUID comparator type;
>> try doing that with one regular column family and secondary indexes (you
>> could obviously sort on the client side, but that is tedious and not logical
>> for older data).
>>
>> On Thu, Feb 10, 2011 at 12:32 AM, David Boxe
8:14 PM, Mike Malone wrote:
> On Tue, Feb 8, 2011 at 2:03 AM, David Boxenhorn wrote:
>
>> Shaun, I agree with you, but marking them as deprecated is not good enough
>> for me. I can't easily stop using supercolumns. I need an upgrade path.
>>
>
> David,
>
>
I hope you don't consider this a hijack of the thread...
What I'd like to know is the following:
The GC removes TTL rows some time after they expire, at its convenience. But
will they stop being returned as soon as they expire? (This is the expected
behavior...)
On Tue, Feb 8, 2011 at 5:11 PM, K
aps putting a bit
> of effort into migration tools... or even a "virtual" layer supporting
> arbitrary hierarchical data), then you can drop them in a few years (when
> you get to 1.0, say), without people feeling betrayed.
>
> -- Shaun
>
> On Feb 6, 2011, at 3:48 AM, David
Why not synchronize on the client side? Make sure that the process that
allocates user ids runs on only a single machine, in a synchronized method,
and uses QUORUM for its reads and writes to Cassandra?
On Sun, Feb 6, 2011 at 11:02 PM, Aaron Morton wrote:
> If you mix mysql and Cassandra you risk
ctional, as features are added to regular
column families and not supported for supercolumn families.
On Fri, Feb 4, 2011 at 10:58 AM, Sylvain Lebresne wrote:
> On Fri, Feb 4, 2011 at 12:35 AM, Mike Malone wrote:
>
>> On Thu, Feb 3, 2011 at 6:44 AM, Sylvain Lebresne wrote:
&g
rcolumn families in the
first place, now I'm pretty much stuck (too late to go back - we're
launching in March).
On Thu, Feb 3, 2011 at 4:44 PM, Sylvain Lebresne wrote:
> On Thu, Feb 3, 2011 at 3:00 PM, David Boxenhorn wrote:
>
>> The advantage would be to enable secondary
families. (I don't
see any of the three problems you brought up as overcoming this problem,
except, perhaps, for special cases.)
On Thu, Feb 3, 2011 at 3:32 PM, Sylvain Lebresne wrote:
> On Thu, Feb 3, 2011 at 1:33 PM, David Boxenhorn wrote:
>
>> Thanks Sylvain!
>>
>&
Thanks Sylvain!
Can I vote for internally implementing supercolumn families as regular
column families? (With a smooth upgrade process that doesn't require
shutting down a live cluster.)
What if supercolumn families were supported as regular column families + an
index (on what used to be supercol
Is there any advantage to using supercolumns
(columnFamilyName[superColumnName[columnName[val]]]) instead of regular
columns with concatenated keys
(columnFamilyName[superColumnName@columnName[val]])?
When I designed my data model, I used supercolumns wherever I needed two
levels of key depth - j
You should bring this up in the Hector user group. It sounds like in the
case of a tie, a random winner should be chosen, instead of taking the first
one.
On Tue, Feb 1, 2011 at 5:50 PM, Oleg Proudnikov wrote:
> Thanks for the insight, Jonathan!
>
> As it turns out using single threaded clients w
Cassandra is not a good solution for data mining type problems, since it
doesn't have ad-hoc queries. Cassandra is designed to maximize throughput,
which is not usually a problem for data mining.
On Thu, Jan 20, 2011 at 2:07 PM, Surender Singh wrote:
> Hi All
>
> I want to use Apache Cassandra to
es for supporting the fine
> grained control of the resources consumed by a sever, tenant, and CF.
>
> Thanks,
>
> Indika
>
> On Thu, Jan 20, 2011 at 3:20 PM, David Boxenhorn wrote:
>
>> As far as I can tell, if Cassandra supports three levels of configuration
>> (serve
users belongs to this tenant (org.)). For that purpose, I thought of
> using the user credentials in the AuthenticationRequest. s there any better
> solution?
>
> I would like to have a MT support at the Cassandra level which is optional
> and configurable.
>
> Thanks,
>
>
Yet another reason to move up to 0.7...
Thanks.
On Wed, Jan 19, 2011 at 5:27 PM, Daniel Lundin wrote:
> in 0.7 nodetool has a `version` command.
>
> On Wed, Jan 19, 2011 at 4:09 PM, David Boxenhorn
> wrote:
> > Is there any way to use nodetool (or anything else) to
Is there any way to use nodetool (or anything else) to get the Cassandra
version number of a deployed cluster?
Yes, the way I see it - and it becomes even more necessary for a
multi-tenant configuration - there should be completely separate
configurations for applications and for servers.
- Application configuration is based on data and usage characteristics of
your application.
- Server configuration is b
+1
On Wed, Jan 19, 2011 at 10:35 AM, Stu Hood wrote:
> Opened https://issues.apache.org/jira/browse/CASSANDRA-2006 with the
> solution we had suggested on the MultiTenant wiki page.
>
>
> On Tue, Jan 18, 2011 at 11:56 PM, David Boxenhorn wrote:
>
>> I think tunin
I'm not sure that "you'd still want to retain the ability to individually
control how flushing happens on a per-cf basis in order to cater to
different workloads that benefit from different flushing behavior". It seems
to me like a good system-wide algorithm that works dynamically, and takes
into a
I think tuning of Cassandra is overly complex, and even with a single tenant
you can run into problems with too many CFs.
Right now there is a one-to-one mapping between memtables and SSTables.
Instead of that, would it be possible to have one giant memtable for each
Cassandra instance, with parti
Thanks.
On Tue, Jan 18, 2011 at 3:55 PM, Sylvain Lebresne wrote:
> On Tue, Jan 18, 2011 at 2:41 PM, David Boxenhorn
> wrote:
> > Thanks, Aaron, but I'm not 100% clear.
> >
> > My situation is this: My use case spins off rows (not columns) that I no
> > lo
col is avail for GC after
> tombstone 1, and the second after tombstone 2.
>
> Hope that helps
> Aaron
>
> On 18/01/2011, at 9:37 PM, David Boxenhorn wrote:
>
> Thanks. In other words, before I delete something, I should check to see
> whether it exists as a live row i
Thanks. In other words, before I delete something, I should check to see
whether it exists as a live row in the first place.
On Tue, Jan 18, 2011 at 9:24 AM, Ryan King wrote:
> On Sun, Jan 16, 2011 at 6:53 AM, David Boxenhorn
> wrote:
> > If I delete a row, and later on delete it a
I think you should just tell everybody that if you want to use QUORUM you
need RF >= 3 for it to be meaningful.
No one would use QUORUM with RF < 3 except in error.
On Mon, Jan 17, 2011 at 6:08 PM, Jonathan Ellis wrote:
> On Mon, Jan 17, 2011 at 9:55 AM, Samuel Benz
> wrote:
> > We have a clus
If I delete a row, and later on delete it again, before GCGraceSeconds has
elapsed, does the tombstone live longer?
In other words, if I have the following scenario:
GCGraceSeconds = 10 days
On day 1 I delete a row
On day 5 I delete the row again
Will the tombstone be removed on day 10 or day 15
"It is unlikely that both racing threads will have exactly the same
microsecond timestamp at the moment of creating a new user - so if data you
read
have exactly the same timestamp you used to write data - this is your data."
I think this would have to be combined with CL=QUORUM for both write and
What's wrong with topposting?
This email is non-plain and topposted...
On Wed, Jan 12, 2011 at 4:32 PM, zGreenfelder wrote:
> >
> > On 12 January 2011 05:28, Oleg Tsvinev wrote:
> > > Whatever I do, it happens :(
> >On Wed, Jan 12, 2011 at 1:53 AM, Arijit Mukherjee
> wrote:
> >
> > I think thi
I think that if SSTs are partitioned within the node using RP, so that each
partition is small and can be compacted independently of all other
partitions, you can implement an algorithm that will spread out the work of
compaction over time so that it never takes a node out of commission, as it
does
I know that there's a limit, and I just assumed that the CLI set it to 100,
until I saw more than 100 results.
On Wed, Jan 5, 2011 at 6:56 PM, Peter Schuller
wrote:
> > The CLI sometimes gets only 100 results (even though there are more) -
> and
> > sometimes gets all the results, even when there
t;> >> finish transferring the data, then restart them with themselves *in*
>> their
>> >> own seeds list. After doing that the node would join the ring.
>> >> This is either my misunderstanding or a bug, but the only place I found
>> it
>> >>
The CLI sometimes gets only 100 results (even though there are more) - and
sometimes gets all the results, even when there are more than 100!
What is going on here? Is there some logic that says if there are too many
results return 100, even though "too many" can be more than 100?
ring.
> This is either my misunderstanding or a bug, but the only place I found it
> documented stated that the new node should not be in its own seeds list.
> Version 0.6.6.
>
> On Wed, Jan 5, 2011 at 10:35 AM, David Boxenhorn wrote:
>
>> My nodes all have themselves in their list of s
My nodes all have themselves in their list of seeds - always did - and
everything works. (You may ask why I did this. I don't know, I must have
copied it from an example somewhere.)
On Wed, Jan 5, 2011 at 9:42 AM, Ran Tavory wrote:
> I was able to make the node join the ring but I'm confused.
>
Shimi, I am using Hector to do exactly what you want to do, with no
problems.
(In fact, the question didn't even occur to me...)
On Sun, Dec 12, 2010 at 9:03 PM, Ran Tavory wrote:
> This should be the case, yes, semantics isn't affected by the
> connection and state isn't kept. What might happe
>> On 10 Dec, 2010,at 07:02 AM, Sébastien Druon wrote:
>>
>> I mean if I have secondary indexes. Apparently they are calculated in the
>> background...
>>
>> On 9 December 2010 18:33, David Boxenhorn wrote:
>>
>>> What do you mean by indexing?
&g
's not that big of an advantage for OPP.
>
> If you can make primary indexes useful, you might as well -- no reason to
> throw that away.
>
> The main thing that the secondary index support does is relieve you from
> having to write all of the indexing code and CFs by hand.
What do you mean by indexing?
On Thu, Dec 9, 2010 at 7:30 PM, Sébastien Druon wrote:
> Thanks a lot for the answer
>
> What about the indexing when adding a new element? Is it incremental?
>
> Thanks again
>
>
> On 9 December 2010 14:38, David Boxenhorn wrote:
>
>
If that is what you want, use CL=ONE
On Thu, Dec 9, 2010 at 6:43 PM, Timo Nentwig wrote:
>
> On Dec 9, 2010, at 17:39, David Boxenhorn wrote:
>
> > In other words, if you want to use QUORUM, you need to set RF>=3.
> >
> > (I know because I had exactly the same probl
In other words, if you want to use QUORUM, you need to set RF>=3.
(I know because I had exactly the same problem.)
On Thu, Dec 9, 2010 at 6:05 PM, Sylvain Lebresne wrote:
> I'ts 2 out of the number of replicas, not the number of nodes. At RF=2, you
> have
> 2 replicas. And since quorum is also
1 - 100 of 216 matches
Mail list logo
