CAP theorem


#1

Hello Masters,

Which guarantees from CAP theorem does Couchbase satisfy.
I’d appreciate if you could shed some light regarding above guarantees and Couchbase.

Thanks in advance,
Erwin
AT&T, Sr. Software Architect


#2

Hello,

Couchbase has been designed to be “CP”: Consistent and Partitioned.

Why not A (available)?
Simply because when a node dies, the data of these node are not available until this node is “fail over” as documented here : http://docs.couchbase.com/couchbase-manual-2.2/#couchbase-admin-tasks-failover

But keep in mind that you can use the replica read to access a replica from your application (so always available too).

I am inviting you to look a this white paper that explains the basic of Couchbase and you should be able to understand why we are Consistent and Partitioned:

Do not hesitate to ask for more informations, since this discussion could be a very long subject :slight_smile:

Regards
Tug
@tgrall


#3

Thanks a lot for fast turnaround response.
So, does Couchbase support partition tolerance, that is, network partition tolerance and recovery?

Thanks,
Erwin


#4

Thanks a lot fot fast turnaround response.
So, is couchbase support partition tolerance, that is, network partition tolerance and recovery?

Thanks,
Erwin