liveBook · Manning

BASE

As explained in ScyllaDB in Action

BASE is a distributed-systems consistency model characterized by basic availability, soft state, and eventual consistency.

BASE is a distributed-systems consistency model built around basic availability, soft state, and eventual consistency. Instead of guaranteeing ACID-level correctness after every write, it favors availability and faster writes, allowing replicas to converge over time. section 1.2.2 section 1.4

In ScyllaDB, BASE supports a cluster that remains useful when nodes fail. Developers can tune request consistency: ONE needs one responding node, QUORUM needs a majority, and ALL needs every node, balancing availability against correctness. section 1.4 section 1.2.2

A node failure

When a node crashes, ScyllaDB can continue serving requests through other nodes and later stream data to recover the cluster. Reads and writes may therefore favor availability before all replicas agree. section 1.4

How ScyllaDB in Action covers it

How deep it goes
Defines the acronym and explains its consistency trade-off, then connects it to request levels without detailing replica internals.
Examples
Uses ONE, QUORUM, and ALL consistency levels plus node failure and cluster recovery as concrete illustrations.
What you can do after
Evaluate consistency choices by weighing request availability, replica agreement, write speed, and recovery behavior.
How it connects
Connects BASE to ACID, eventual consistency, CAP theorem, consistency levels, horizontal scalability, and fault tolerance.

Related concepts

This explainer was generated by Manning's knowledge graph from the text of ScyllaDB in Action. The section links point to the parts of the book it draws on.