I first learned about CockroachDB in the fall when the BSDNow podcast covered it running on freebsd and the “Critters in a Jar” blog post. The project looks interesting so i have been lurking.
One thing i have never seen discussed are the CAP tradeoffs that CockroachDB makes. After asking on twitter I was informed that official documentation is in the works, and in the mean time to ask here for more information.
For those that dont know CAP theorem, in the event of a failure take
- Partition tolerance
Pick any two but one of them needs to be Partition tolerance
The response i got on twitter says that is a CP system yet still had High Availability, what tradeoffs are made to accomplish this