In database theory, the CAP theorem, also named Brewer's theorem after computer scientist Eric Brewer, states that any distributed data store can provide only two of the following three guarantees:
When a network partition failure happens, it must be decided whether to do one of the following:
Thus, if there is a network partition, one has to choose between consistency or availability.