In this post we share performance and functionality progress that has been made on SQL joins in CockroachDB and what to expect in CockroachDB 1.0.
In August, we wrote about our concerted stability effort. Today, we've more than achieved our CockroachDB stability goal of running a 100-node cluster.
We recently improved our distributed SQL performance by implementing column families in CockroachDB. Column families are commonly found in NoSQL databases.
Our approach to building CockroachDB has been to focus on correctness, then performance, then stability. Without stability, we don’t have a working database
The good news is that CockroachDB’s JOIN seems to work, as in, “it returns correct results.” However, this is just our first, unoptimimized implementation.
If we abandoned our earthly constraints, how could we improve consensus algorithms? Specifically, what would it take to make them faster?
We have added a new feature: time-travel queries. To our knowledge, we are the first database to have implemented the them.
Adopting SQL had an unexpected consequence; it forced us to dabble in language design. In this post, we detail our approach to SQL typing in CockroachDB.
CockroachDB contributor Paul Steffensen (aka uptimeDBA) has analyzed CockroachDB's handling of NULL values as compared to other SQL implementations.
Does CockroachDB really survive? When data is written, will a failure really not end up in data loss? Let's explore how CockroachDB checks replication.