CAP theorem

Need to sacrifice consistency or availability in the presence of network partitions

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:ConsistencyEvery read receives the most recent write or an error. AvailabilityEvery request received by a non-failing node in the system must result in a response. This is the definition of availability in CAP theorem as defined by Gilbert and Lynch. Note that availability as defined in CAP theorem is different from high availability in software architecture. Partition toleranceThe system continues to operate despite an arbitrary number of messages being dropped by the network between nodes.

This keyword could refer to multiple things. Here are some suggestions: