Re: question about bootstrapping sequence

I'm wondering how the Cassandra protocol brings a newly bootstrapped node "up to speed". for ease of illustration, let's say we just have one key, K, and the value is continually updated: 1,2 ,3 ,4 originally we have 1 node, A, now node B joins, and needs to bootstrap and get its newly assig

Re: question about bootstrapping sequence

quot;. but now the state of C and A, B are different. On Tue, Jul 28, 2015 at 12:40 PM, Robert Coli wrote: > On Tue, Jul 28, 2015 at 1:31 AM, Yang wrote: > >> I'm wondering how the Cassandra protocol brings a newly bootstrapped node >> "up to speed". >> &

Re: question about bootstrapping sequence

thanks. hmmm somehow I had the impression that untill B's streamingIn finished it does not adverise itself to other servers for receiving fresh replications. looks I'm wrong here, ler me check the code.. On Jul 28, 2015 2:07 PM, "Robert Coli" wrote: > On Tue, Jul 28

linearizable consistency / Paxos ?

from that article is , what is the fundamental difference between the standard replication protocol and Paxos that prevents us from implementing a 2-pc on top of the standard protocol? Thanks! yang

Re: linearizable consistency / Paxos ?

by Paxos but fails before being able > to commit (after the accept phase in the diagram), then any subsequent > operation on this partition key will commit this stalled operation before > starting its own. > > > > On Mon, Aug 3, 2015 at 4:30 AM, Yang wrote: > >> this link

Re: linearizable consistency / Paxos ?

ou can look into the source code here: > https://github.com/apache/cassandra/blob/trunk/src/java/org/apache/cassandra/service/StorageProxy.java#L202 > > The Javadoc is also interesting to read because it explains briefly the > semantics > > > > On Mon, Aug 3, 2015 at 11:32

incremental backup and Priam?

code pretty much does the same thing as the original addSSTable() incremental backup . so the Priam backup code operates outside of Cassandra write path? any insight into why this approach was chosen instead of using the incremental backup provided by Cassandra? thanks Yang

Re: incremental backup and Priam?

built in incremental backups off node. (AFAIK) > > Cheers > > - > Aaron Morton > Freelance Developer > @aaronmorton > http://www.thelastpickle.com > > On 15/08/2012, at 8:16 AM, Yang wrote: > > in the initial incremental backup implementation, >

replace dead node? " token -1 "

uot; thing, but assigns the original token T to the new node. if so, would the duplicate token (same token but different ip) cause problems? Thanks Yang

Re: replace dead node? " token -1 "

ken ownership is passed to the new node. > > Cheers > > - > Aaron Morton > Freelance Developer > @aaronmorton > http://www.thelastpickle.com > > On 15/08/2012, at 11:07 AM, Yang wrote: > > previously when a node dies, I remember the documents describes tha

Re: replace dead node? " token -1 "

1. I'm doing more tests to confirm this behavior Thanks Yang On Tue, Aug 14, 2012 at 10:17 PM, Jim Cistaro wrote: > We use priam to replace nodes using replace_token. We do see some > issues (currently on 1.0.9, as well as earlier versions) with replace_token. > >

Re: replace dead node? " token -1 "

lready, so it's another issue? Thanks Yang On Tue, Aug 14, 2012 at 11:03 PM, Yang wrote: > Jim: > > thanks a lot for the info. > > when you say "old nodes sometimes hanging around as "unreachable nodes" > when describing cluster", you mean after the

Re: replace dead node? " token -1 "

ame in terms of partitioning the data range. Thanks Yang On Wed, Aug 15, 2012 at 1:39 AM, Yang wrote: > ok, I see, the cassandra.replace_token setting essentially executes the > manual removeToken step. so the dead node should be removed. > > is this the "old node hanging

Re: replace dead node? " token -1 "

1 approach. If you don't have the > need for token consistency, then it might be more attractive for you. We > don't use it, so I cannot say if that approach has any issues, etc. > > Jim > > From: Yang > Reply-To: > Date: Wed, 15 Aug 2012 02:00:55 -0700 >

nodetool output through REST API?

ot; , for example through some REST API or python API, so that I avoid the possible changes in formatting of the output? I checked pycassa, it doesn't seem to have an API for the JMX services Thanks Yang

JMX(RMI) dynamic port allocation problem still exists?

yself? Thanks Yang

Re: JMX(RMI) dynamic port allocation problem still exists?

ot;Hiller, Dean" wrote: > In cassandra-env.sh, search on JMX_PORT and it is set to 7199 (ie. Fixed) > so that solves your issue, correct? > > Dean > > From: Yang mailto:tedd...@gmail.com>> > Reply-To: "user@cassandra.apache.org<mailto:user@cassandra

Re: JMX(RMI) dynamic port allocation problem still exists?

l.iac.com/owa/redir.aspx?C=PLVE6taKpU--Dxw69WVEOtdUcArCWM8IUH6LBjdXcM7STlqwkARq8mA8Nva_mtGaSKmmva4pWxE.&URL=http%3a%2f%2fwww.datastax.com%2fdocs%2f1.1%2finstall%2finstall_ami> Yang On Mon, Aug 27, 2012 at 9:03 PM, Nick Bailey wrote: > The problem still exists. There was a discussion a

Re: how is this possible ---- token range sum > 100% ?

/CASSANDRA-3412 > [2] > https://github.com/apache/cassandra/blob/trunk/src/java/org/apache/cassandra/service/StorageServiceMBean.java#L342 > > On Wed, Aug 29, 2012 at 7:02 PM, Yang wrote: > > I have 16 nodes, each of them should have only 6.25%, but now they all > show >

Re: JMX(RMI) dynamic port allocation problem still exists?

nice, thanks guys! On Tue, Aug 28, 2012 at 11:58 PM, Senthilvel Rangaswamy < senthil...@gmail.com> wrote: > We use Jolokia. Its pretty awesome. > > > On Tue, Aug 28, 2012 at 11:44 PM, Peter Schuller < > peter.schul...@infidyne.com> wrote: > >> I can recommend Jolokia highly for providing an HTTP/

a simple solution to replace dead node

he drawback is that you can do automatic launching of the new host. but that limitation is due to nventor/Puppet. Just want to share with the community here, cuz many people probably run Puppet+nventory, so this simple solution might work well Thanks Yang

keyspace not propagated to a new node?

does not see the KS. do I have to do something? I thought the bootstrap process would get the KS'es??? also I tried the -Dcassandra.replace_token, same issue thanks Yang

Re: keyspace not propagated to a new node?

this is 1.1.2 unfortunately the logs does not show anything except for the initial startup sequences. on the siblings, somehow the /var/log/cassandra/system.log were wrongly deleted, so I can't see their responses either I'll try resetlocalschema next time thanks! yang On Tue, Sep 4,

Re: why do I have to use internal IP for EC2 nodes?

ton > Freelance Developer > @aaronmorton > http://www.thelastpickle.com > > On 5/09/2012, at 7:37 AM, Yang wrote: > > > http://www.datastax.com/docs/1.1/initialize/cluster_init > > > > > > says: > > > > " Note In the - seeds list property

replace_token code?

emove 80 forcefully from gossip. instead, a few seconds later, it believed that .80 became live again. I don't have much understanding of the Gossip protocol, but roughly know that it's probability-based, looks we need an "assertive"/"NOW" membership control message

Re: replace_token code?

Thanks Jim, looks I'll have to read into the code to understand what is happening under the hood yang On Mon, Sep 10, 2012 at 9:45 AM, Jim Cistaro wrote: > We have seen various issues from these replaced nodes hanging around. > For clusters where a lot of nodes have been repla

Re: replace_token code?

replied in blue, Thanks Yang I thought the very first log line already acquired ownership , instead of later in the sequence? WARN [main] 2012-09-10 08:00:21,855 TokenMetadata.java (line 160) Token 166594924822352415786406422619018814804 changing ownership from / 10.72.201.80 to

Lock on Cassandra ---- using bakery algo

algorithm that provides no fairness, as the MAX() is replaced by a random choice pardon my beginner python usage :) thanks Yang

guarantee of write-read order?

lines; but the fourth line does not see both write results. Thanks Yang

LOCAL_QUORUM vs EACH_QUORUM

use case? within the current code, is there a way to achieve that? if not, creating a new policy does not seem too difficult either. Thanks Yang

random thought: rewrite Cassandra using Scala ?

thought: would there be any value to rewrite the code in Scala? thanks Yang

rainbird question (why is the 1minute buffer needed?)

. are there some points I'm missing? Thanks Yang

Re: rainbird question (why is the 1minute buffer needed?)

data nodes. the extra module I am proposing simply translates a single insert into multi-insert, and then cassandra takes over from there Thanks Yang On Sun, May 22, 2011 at 3:47 AM, aaron morton wrote: >  The implementation of distributed counters is  more complicated than your > example,

batch dump of data from cassandra?

tilize the file cache coherency as I read down the file. Thanks Yang

Re: batch dump of data from cassandra?

Thanks Jonathan. On Sun, May 22, 2011 at 9:56 PM, Jonathan Ellis wrote: > I'd modify SSTableExport.serializeRow (the sstable2json class) to > output to whatever system you are targeting. > > On Sun, May 22, 2011 at 11:19 PM, Yang wrote: >> let's say periodically (d

Re: batch dump of data from cassandra?

thanks Sri I am trying to make sure that Brisk underneath does a simple scraping of the rows, instead of doing foreach key ( keys ) { lookup (key) }.. after that, I can feel comfortable using Brisk for the import/export jobs yang On Mon, May 23, 2011 at 8:50 AM, SriSatish Ambati wrote

Re: rainbird question (why is the 1minute buffer needed?)

(), which are still in-memory operations, and thus would not be so bad ? Yang On Mon, May 23, 2011 at 11:54 AM, Ryan King wrote: > On Sun, May 22, 2011 at 11:00 AM, Yang wrote: >> Thanks, >> >> I did read through that pdf doc, and went through the counters code in >> 0.

issue/minor bug with counters ?

if you have only counter columns in your keyspace, and do a lot of updates on a few keys, the getLiveSize() of memtable actually returns the total amount of traffic that has gone into the Memtable, not the real size, so you end up producing very small SStables, with only a few KBytes. (I have alrea

Re: issue/minor bug with counters ?

" is how > throughput is defined, so this is working as expected. > > On Tue, May 24, 2011 at 11:15 AM, Yang wrote: >> if you have only counter columns in your keyspace, and do a lot of >> updates on a few keys, >> the getLiveSize() of memtable actually returns the

expiring + counter column?

is this combination feature available , or on track ? thanks Yang

Re: expiring + counter column?

same logic can be carried over into expiring column, since they are essentially automatically inserted deletes. that way #2103 could be "solved" I'm attaching an example below, you can refer to them if needed. Thanks a lot Yang example: for simplicity we assume there is only on

Re: expiring + counter column?

errata: "so c(123) means a counter column of ttl=1," > "so c(123) means a counter column of ttl=123," On Sun, May 29, 2011 at 12:24 AM, Yang wrote: > sorry to beat on the dead horse. > > I looked at the link referred from #2103 : > https://issues.apache

Re: expiring + counter column?

sorry in the notation, instead of "ttl" I mean "timestamp" On Sun, May 29, 2011 at 12:24 AM, Yang wrote: > sorry to beat on the dead horse. > > I looked at the link referred from #2103 : > https://issues.apache.org/jira/browse/CASSANDRA-2101 > I agree w

Re: expiring + counter column?

plicate only the **sum** that I own, not individual delta that I just received. actually I'm not quite understanding why this approach was chosen, since it makes each write into read---write (when getReplicateOnWrite() ) , which can be slow. I'm still trying to understand that Thanks Yang

clarification of the consistency guarantees of Counters

ned in the JIRA, and later do reconciliation on the history. because messages losses are less common than success, maybe this is not as bad a route as we thought?? Thanks Yang

Re: clarification of the consistency guarantees of Counters

thanks, got it I looked at the code more closely, the response handler between the coordinator and itself as leader, and between leader and replicas, are shared, so the coordinator can indeed wait for the count replication to finish for ALL yang On Mon, May 30, 2011 at 6:51 PM, Jeremy Hanna

one idea on counters: simpler protocol due to FIFO

me fast write/update as regular columns, without a read-write pattern, and essentially do "fire and forget", while the tally-up is left over to background work. we also avoid the extra "leader" network hop required by current implementation. Thanks Yang

Re: clarification of the consistency guarantees of Counters

to reconcile, that's what I mean. but anyway it's not relevant now since CL can be > ONE but I'd really appreciate if you could give some review to my newer post on FIFO, I think that could be an interesting approach yang On Tue, May 31, 2011 at 12:59 AM, Sylvain Lebresn

Re: clarification of the consistency guarantees of Counters

never mind , I see that if leader/owner dies, the other replicas can simply use whoever has the highest count of the leader bucket, though not the authoritative number On Tue, May 31, 2011 at 1:21 AM, Yang wrote: > thanks Sylvain, I agree with what you said for the first few paragra

Re: one idea on counters: simpler protocol due to FIFO

ath does not need a special-case: you only need to attach a repair flag to the mutation when sending out the repair command, it's up to the column to interpret this. anyway it's probably too inflexible to strictly mandate that all repair behaviors should be same as write, or just rep

"include" ability in schema file?

s this possible? also btw, for an avro-generate object class, would it be better to make the getSchema() method static? that way I can get its schema without creating an actual obj thanks Yang

Re: "include" ability in schema file?

sorry wrong list ... please ignore On Tue, May 31, 2011 at 4:26 PM, Yang wrote: > I have a protocol schema hello.avpr > > { > types: { >{ name : input_msg , type: record : fields [ > { name: date , type int }, >{ na

caution for restarting CassandraDaemon in junit

one fails. it turns out that after "deactivate()" , the static caches for implementing singleton in Table is not cleared, so they are re-used. there could be more cases like this. so to get that working, you need to set the "forkMode" of surefire-plugin to let each test class be run in a separate JVM yang

Re: need some help with counters

something like this: https://issues.apache.org/jira/browse/CASSANDRA-2103 but this turns out not feasible On Thu, Jun 9, 2011 at 12:41 PM, Ian Holsman wrote: > Hi. > > I had a brief look at CASSANDRA-2103 (expiring counter columns), and I wa

auto-expiration of columns happens only during compaction?

if I have a really short ttl, and the column expired before flush happens. then if I query on this column, would Cassandra recognize that it has lived past its ttl? or do I need to filter that out in application logic? Thanks Yang

Re: auto-expiration of columns happens only during compaction?

thanks Nate On Fri, Jun 10, 2011 at 3:54 PM, Nate McCall wrote: > These are filtered out server side (see > o.a.c.db.filter.QueryFilter#isRelevant and o.a.c.db.ExpiringColumn for > specifics). > > On Fri, Jun 10, 2011 at 5:08 PM, Yang wrote: > > if I have a really shor

simple get_slice() gives error?

buffer, which also preserves the pos. is this some error on server code? (looks a flip() is needed somewhere) Thanks Yang

one way to make counter delete work better

th, in the "no replicate-on-write" case, we need to add a read to sstable. but in the "replicate-on-write" case, we already read that, so it's no extra time cost. "no replicate-on-write" is not a very useful setup in reality anyway. does this sound a feasible way? if this works, expiring counter should also naturally work. Thanks Yang

Re: one way to make counter delete work better

ordering rule used in reconciliation; here we just need to find a similar ordering rule. the epoch thing could be a step on this direction. Thanks Yang On Mon, Jun 13, 2011 at 9:04 AM, Jonathan Ellis wrote: > I don't think that's bulletproof either. For instance, what if the >

Re: one way to make counter delete work better

ch number] then within each epoch, counter updates work as currently implemented On Mon, Jun 13, 2011 at 10:12 AM, Yang wrote: > I think this approach also works for your scenario: > > I thought that the issue is only concerned with merging within the same > leader; but you pointed o

Re: one way to make counter delete work better

ompletely new counter, the counter name we are using is just kind of an alias. yang On Tue, Jun 14, 2011 at 11:21 AM, Sylvain Lebresne wrote: > Who assigns those epoch numbers ? > You need all nodes to agree on the epoch number somehow to have this work, > but then how do you maintai

Re: one way to make counter delete work better

in "stronger reason", I mean the +3 is already merged up in memtable of node B, you can't find +1 and +2 any more On Tue, Jun 14, 2011 at 7:02 PM, Yang wrote: > I almost got the code done, should release in a bit. > > > > your scenario is not a problem conc

Re: one way to make counter delete work better

both node eventually agree on the value 3 (i.e, only the second >> increment). >> I don't see how you could assign epoch numbers or anything to fix that. >> >> -- >> Sylvain >> >> On Mon, Jun 13, 2011 at 8:26 PM, Yang wrote: >> > ok, I think it

Re: one way to make counter delete work better

patch in https://issues.apache.org/jira/browse/CASSANDRA-2774 <https://issues.apache.org/jira/browse/CASSANDRA-2774>some coding is messy and only intended for demonstration only, we could refine it after we agree this is a feasible way to go. Thanks Yang On Tue, Jun 14, 2011 at 11

Re: Propose new ConsistencyLevel.ALL_AVAIL for reads

consistency level definition should be a definition of requirement from the application perspective, it should not be tied to some ephemeral state in the system (: a node being deemed "available/up" or down is determined by the gossip and changes every second ) what you want can be simply achieve

MR-hook for sstable compaction?

yang

Re: MR-hook for sstable compaction?

Thanks Jonathan. yes I did notice the RF issue, and thought , for example, to get a total salary, you'd need to divide it by RF, something like that. I'll take a look at 1608, Yang On Sun, Jun 19, 2011 at 12:12 AM, Jonathan Ellis wrote: > I'm skeptical that this is the rig

Re: simple get_slice() gives error?

another question: in current cassandra daemon, is it possible that a column (or more specifically its bytebuffer) is still being held by the read thread , while it was partially written by a write thread? this way the read thread could possibly get garbled result. Thanks Yang On Fri, Jun 10, 2011

Re: Concurrency: Does C* support a Happened-Before relation between processes' writes?

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

Re: Concurrency: Does C* support a Happened-Before relation between processes' writes?

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

network/message simulation framework?

ious mock frameworks look like a good fit, but in reality is not enough to simulate complex network code, for example, it's basically impossible to setup a simulated N-node cluster on only one test box. Thanks Yang

Re: network/message simulation framework?

an even more difficult thing is that the ThriftSocket etc will need to open a java.net.Socket, which hooks onto the real IP address and port, in a simulation environment, we'd need to mock out the java.net.Socket too, that sounds more difficult. yang On Fri, Jun 24, 2011 at 8:23 PM, Jon

Re: network/message simulation framework?

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 con

Re: network/message simulation framework?

re static, then the tests can be carried out in a shell script organizing several java processes, slightly less convenient than a single junit process which orchestrates those multiple servers in a single JVM yang On Sat, Jun 25, 2011 at 3:40 AM, Watanabe Maki wrote: > iptables? > > From

Re: Clock skew

oftentimes people use time actually subconsciously to express causal relations ("before/after"), as long as you have some other means to establish causal relations, you don't really need to have an exactly clock. On Mon, Jun 27, 2011 at 4:54 PM, aaron morton wrote: > Without exception the timesta

custom reconciling columns?

ay to incorporate such custom reconcile under current code framework? (I see custom sorting, but no custom reconcile) thanks yang

Re: custom reconciling columns?

Cheers > > > - > Aaron Morton > Freelance Cassandra Developer > @aaronmorton > http://www.thelastpickle.com > > On 29 Jun 2011, at 04:20, Yang wrote: > > > for example, if I have an application that needs to read off a user > browsing history, a

Re: custom reconciling columns?

btw I use only one box now just because I'm running it on dev junit test, not that it's going to be that way in production On Tue, Jun 28, 2011 at 10:06 PM, Yang wrote: > ok, here is the profiling result. I think this is consistent (having been > trying to recover how to

Re: custom reconciling columns? (improve performance of long rows )

return is going to be even slower... On Tue, Jun 28, 2011 at 10:07 PM, Yang wrote: > btw I use only one box now just because I'm running it on dev junit test, > not that it's going to be that way in production > > > On Tue, Jun 28, 2011 at 10:06 PM, Yang wr

Re: custom reconciling columns?

fact a sortedmap) in the internal process. we could very well just use a sorted list to do the read path, which would be much faster. (hacking out this idea today ...) yang On Thu, Jun 30, 2011 at 8:27 AM, Jeremiah Jordan < jeremiah.jor...@morningstar.com> wrote: > ** > The r

Re: custom reconciling columns?

? the only disadvantage is a slight change to getTopLevelColumns so we have 2 flavors of this method Thanks Yang On Wed, Jun 29, 2011 at 5:51 PM, Jonathan Ellis wrote: > On Tue, Jun 28, 2011 at 10:06 PM, Yang wrote: > > I'm trying to see whether there are some easy magic bu

Re: custom reconciling columns?

https://issues.apache.org/jira/browse/CASSANDRA-2843 thanks Yang On Fri, Jul 1, 2011 at 12:09 AM, Sylvain Lebresne wrote: > I think it's an interesting solution. And we can probably avoid the two > getTopLevelColumns flavors with at bit a refactor. Let's open a ticket > howe

faster ByteBuffer comparison

mpare() looping over each byte doing a ByteBuffer.get() is there a faster (probably hardware-based) compare ? I tried doing 8 bytes at a time by doing getLong() and it actually seems slower thanks Yang

Re: Strong Consistency with ONE read/writes

there is a JIRA completed in 0.7.x that "Prefers" a certain node in snitch, so this does roughly what you want MOST of the time but the problem is that it does not GUARANTEE that the same node will always be read. I recently read into the HBase vs Cassandra comparison thread that started after F

Re: Strong Consistency with ONE read/writes

can use different CL for each single write request. in that case you would need to keep both the current lightweight Phi-detector and add the ZK for leader election for single-entry mode write. Thanks Yang (I should correct my terminology it's not a "strong failure dete

Re: Strong Consistency with ONE read/writes

I'm no expert. So addressing the question to me probably give you real answers :) The single entry mode makes sure that all writes coming through the leader are received by replicas before ack to client. Probably wont be stale data On Jul 3, 2011 11:20 AM, "AJ" wrote: > Yang,

Re: What does a write lock ?

just to add onto what jonathan said the columns are immutable . if u overwrite/ reconcile a new obj is created and shoved into the memtable there is a shared lock for all writes though which guard against an exclusive lock on memtable switching/flushing On Jul 7, 2011 7:51 AM, "A J" wrote:

Re: What does a write lock ?

validation is on the new incoming column ,not the old row,right? On Jul 7, 2011 8:25 AM, "Jeffrey Kesselman" wrote: > Hi Jonnathan, > > This brings up an important question. I have been assuming that the > validation check is part of the atomic update operation. Is this NOT the > case? Which is t

Re: What does a write lock ?

Thu, Jul 7, 2011 at 3:21 PM, Yang wrote: > >> just to add onto what jonathan said >> >> the columns are immutable . if u overwrite/ reconcile a new obj is >> created and shoved into the memtable >> >> there is a shared lock for all writes though which guard agai

AntiEntropy?

I looked around in the code, it seems that AntiEntropy operations are not automatically run in the server daemon, but only manually invoked through nodetool, am I correct? if this is the case, I guess the reason to disable it is just the load impact it brings to servers? Thanks Yang

custom StoragePort?

value, maybe someone more familiar with the code could do the refactoring Thanks yang

Re: custom StoragePort?

never mind, found this.. https://issues.apache.org/jira/browse/CASSANDRA-200?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel On Mon, Jul 11, 2011 at 12:39 PM, Yang wrote: > I tried to run multiple cassandra daemons on the same host, using > different ports, for a te

Re: Strong Consistency with ONE read/writes

it comes back online. but possibly this could be limited to some max length so that over that length, the woken replica simply does a complete bootstrap. thanks yang On Sun, Jul 3, 2011 at 8:25 PM, AJ wrote: > We seem to be having a fundamental misunderstanding.  Thanks for your > comment

Re: ReplicateOnWrite issues

interesting, first just to make sure: since replicateOnWrite is for Counters, you are using counters (you use the word "insert" instead of "add/increment" ) right? if you are using counters, supposedly the leader runs replicateOnWrite, somehow all your adds find the one box as leader, that's prob

Re: Strong Consistency with ONE read/writes

from the leader, which is less interesting because it's almost hbase then... On Tue, Jul 12, 2011 at 7:37 AM, AJ wrote: > Yang, I'm not sure I understand what you mean by "prefix of the HLog". >  Also, can you explain what failure scenario you are talking about?  The >

Re: Strong Consistency with ONE read/writes

thanks , let me read it... On Tue, Jul 12, 2011 at 9:27 AM, Ryan King wrote: > If you're interested in this idea, you should read up about Spinnaker: > http://www.vldb.org/pvldb/vol4/p243-rao.pdf > > -ryan > > On Mon, Jul 11, 2011 at 2:48 PM, Yang wrote: >> I'

Re: ReplicateOnWrite issues

ke to > know what happens when replicate on write is true and when it is false so I > can make a more informed choice. > > On Jul 12, 2011, at 12:20 AM, Yang wrote: > >> interesting, >> >> first just to make sure: since replicateOnWrite is for Counters, you >>

Re: Strong Consistency with ONE read/writes

that is not an important issue, it's separate from the replication question I'm thinking about. for now I'll just think about the case where every node owns the same key range , or N=RF. > Are you saying:  All replicas will receive the value whether or not they > actually own the key range for th

Re: JSR-347

"data grids", it seems that this really does not have much relationship to "java", since all major noSQL solutions explicitly create interfaces in almost all languages and try to be language-agnostic by using RPC like thrift,avro etc. On Wed, Jul 13, 2011 at 9:06 AM, Pete Muir wrote: > Hi, > > I

Re: JNA to avoid swap but physical memory increase

btw just a reminder that even if jna + mlock works fine, with a large portion of physical memory locked by cassandra JVM, you won't get swapping with Cassandra, but you could possibly get swapping happening on other processes in the OS, On Fri, Jul 15, 2011 at 9:47 AM, Chris Burroughs wrote: > On

  1   2   3   >