The CAP theorem, also known as Brewer’s theorem, states that it is impossible for a distributed computer system to simultaneously provide all three of the following guarantees:
- Consistency – all nodes always give the same result.
- Availability – a guarantee that nodes always answer queries and accept updated.
- Partition tolerance – system continues working even if one or more nodes become silent or not responsive.
Hadoop ABCD 