Strict serializability is the strongest consistency model for databases and distributed systems. It requires that the outcome of concurrently executed transactions equal that of some sequential execution (serializability) and that this order also respect the real-time order in which the transactions occurred (linearizability). A transaction that begins after another has completed is therefore guaranteed to observe its effects.
It is the easiest model to reason about, but it requires agreement and synchronization among nodes, which raises latency and limits scalability. Distributed databases such as Google Spanner and CockroachDB offer this level of guarantee, while many systems reduce the cost by adopting weaker models such as causal consistency or by providing the guarantee only per key.