Under the CAP theorem, what must a distributed store choose between during a network partition?
- Low latency or full durability
- Consistency or availability
- Sharding or replication
- Indexes or joins
When nodes can't talk, a system either refuses some requests (consistent) or answers with possibly stale data (available).
Play SQL & Databases ▸