Every Map is Wrong, But We Made One Anyway| jepsen.io
Phenomenon G1c (Cyclic Information Flow) occurs when a set of transactions| jepsen.io
Phenomenon G0, or Write Cycle, occurs when a set of transactions overwrite| jepsen.io
Phenomenon G-single (Single Anti-dependency Cycle) is a specific kind of| jepsen.io
A phenomenon is something a database does that someone, somewhere, thought| jepsen.io
Informally, Strong Serializability (a.k.a. Strict Serializability, Strict| jepsen.io
Sequential consistency is a strong safety property for concurrent systems.| jepsen.io
Phenomenon G-nonadjacent, or Non-adjacent Anti-dependency Cycle, is| jepsen.io
Read uncommitted is a consistency model which prohibits dirty writes, where| jepsen.io
Monotonic atomic view is a consistency model which strengthens read| jepsen.io
1 Background| jepsen.io
Fundamental Concepts| jepsen.io
In a snapshot isolated system, each transaction appears to operate on an| jepsen.io
Read committed is a consistency model which strengthens read uncommitted by preventing dirty reads: transactions are not| jepsen.io
1 Update, 2025-05-03| jepsen.io
Jepsen analyzes the safety properties of distributed systems–most notably,| jepsen.io
Informally, serializability means that transactions appear to have occurred in| jepsen.io
1 Background| jepsen.io
Linearizability is one of the strongest single-object consistency models, and implies that every operation appears to take place atomically, in some order, consistent with the real-time ordering of those operations: e.g., if operation A completes before operation B begins, then B should logically take effect after A.| jepsen.io