Call Me Maybe: Percona XtraDB Cluster
1–10 of 10 posts
Re: Call Me Maybe: Percona XtraDB Cluster
#2some days ago a paper was linked here
"A Critique of the CAP Theorem" - http://arxiv.org/abs/1509.05393
which I found very englighting about the P in CAP.
Re: Call Me Maybe: Percona XtraDB Cluster
#3>Moreover, if we test the same workload on a simple single instance InnoDB, we will get the same result.
He simply states that he tested it and it didn't happen, so it must be OK. But later on says the x=x+y form perhaps only accidentally works as "I suspect that this only passes because the window of concurrency for the read/write cycle is very short".
Why wouldn't this be true of the single-node scenario? Certainly things are faster on a single node, so unless Jepsen is pre-empting and delaying each thread-instruction combination, a test passing certainly isn't proof of it actually being OK, right? It's possible that the same workload on a heavily overloaded instance, might, somehow, exhibit the same behaviour, eh? I understand that the next sentence goes on to attribute it to a likely problems with Galera's locks. But the test alone shouldn't be conclusive evidence. Not trying to be pedantic or discuss what "proof" means just curious as to if I missed something.
Re: Call Me Maybe: Percona XtraDB Cluster
#4Discussion of Aphyr's MariaDB Galera Cluster post: https://news.ycombinator.com/item?id=10171942
Discussion of Percona’s response to it: https://news.ycombinator.com/item?id=10238690
Re: Call Me Maybe: Percona XtraDB Cluster
#5Re: Call Me Maybe: Percona XtraDB Cluster
#6Concerning his claims about CAP and that their cluster is neither C nor A, because of P, while Percona claims it is CA, some days ago a paper was linked here "A Critique of the CAP Theorem" - http://arxiv.org/abs/1509.05393 which I found very englighting about the P in CAP.
There's a bunch of other articles listed on the wikipedia CAP page [https://en.wikipedia.org/wiki/CAP_theorem], for example the post by Abadi is worth reading.
The #1 issue is that the "2 out of 3" formulation is utterly misleading, as it sounds as if all the three options are feature of the distributed system. In reality, people don't control "P" - it's a feature of the network. You may be very careful about designing and operating your network, but one day a partition will happen. So "CA" systems are nonsense.
The other problem is that while CAP uses the same basic terms as ACID, the meaning of those terms is entirely different. This makes discussions about the CAP vs. ACID stuff pretty much impossible, because each group thinks Consistency or Availability means the same thing in both worlds. So RDBMS people will shout "We have availability, just like you!" and NoSQL people will shout "We have consistency, just like you!" Madness ...
Re: Call Me Maybe: Percona XtraDB Cluster
#7Concerning his claims about CAP and that their cluster is neither C nor A, because of P, while Percona claims it is CA, some days ago a paper was linked here "A Critique of the CAP Theorem" - http://arxiv.org/abs/1509.05393 which I found very englighting about the P in CAP.
I think this article from 2012 by Brewer himself is a good read too - a bit shorter and somewhat more comprehensible: http://www.infoq.com/articles/cap-twelve-years-later-how-the... There's a bunch of other articles listed on the wikipedia CAP page [ https://en.wikipedia.org/wiki/CAP_theorem ], for example the post by Abadi is worth reading. The #1 issue is that the "2 out of 3" formulation is utterly misleading, as…
You're right about the C(onsistency) bit, but the A in ACID stands for Atomic, not Available.
Re: Call Me Maybe: Percona XtraDB Cluster
#8Earlier quoted context omitted.
I think this article from 2012 by Brewer himself is a good read too - a bit shorter and somewhat more comprehensible: http://www.infoq.com/articles/cap-twelve-years-later-how-the... There's a bunch of other articles listed on the wikipedia CAP page [ https://en.wikipedia.org/wiki/CAP_theorem ], for example the post by Abadi is worth reading. The #1 issue is that the "2 out of 3" formulation is utterly misleading, as…
Re: AVID vs CAP. You're right about the C(onsistency) bit, but the A in ACID stands for Atomic, not Available.
For example it may mean a master-slave system with an automatic failover, which is rather different from what Availability means in CAP.
Re: Call Me Maybe: Percona XtraDB Cluster
#9Earlier quoted context omitted.
Re: AVID vs CAP. You're right about the C(onsistency) bit, but the A in ACID stands for Atomic, not Available.
Good point, but I wasn't implying that the "A" in ACID stands for Availability (sorry if that was unclear), but that what people dealing with traditional systems (build on ACID) mean when they speak about "Availability". For example it may mean a master-slave system with an automatic failover, which is rather different from what Availability means in CAP.
As you were.
Re: Call Me Maybe: Percona XtraDB Cluster
#10My very personal takeaway from all these aphyr tests: Distributed systems are hard. Out of the box, very few work properly and probably none of them will work as expected because of a faulty deployment. Think twice before deploying one and consider other ways to scale your system.
In our case, we are going with the memcached approach: client-side sharding with some kind of replication in the backend (mysql master-slave, drdb, etc). Far easier to deploy and, what is more important, far easier to recover when something goes wrong.