A theorem stating that it is impossible for a distributeddata store to simultaneously provide more than two of three guarantees: consistency (every read receives the most recent write or an error), availability (every request receives a non-error response, without the guarantee that it contains the most recent write), and partitiontolerance (the system continues to operate despite an arbitrary number of messages being dropped or delayed between nodes).
Origin
Named after computer scientist Eric Brewer.
Modern English dictionary
Explore and search massive catalog of over 900,000 word meanings.
Word of the Day
Get a curated memorable word every day.
Challenge yourself
Level up your vocabulary by setting personal goals.