CS Theorems
  • Posts
  • Areas
  • Kinds
  • Search
Home Areas

Databases

Conflict Serializability and Two-Phase Locking

2PL produces exactly the serializable schedules; anomalies are precisely what you buy by weakening it.

August 29, 2026 · 8 min
T071 theorem Medium #databases #concurrency
Builds on: T055 — Linearizability

Codd's Theorem

Relational algebra and relational calculus have equal expressive power. Why SQL is declarative and why a query planner can exist at all.

August 29, 2026 · 8 min
T069 theorem Medium #databases
Read with: T038 — The Chomsky Hierarchy

Paxos, Raft, and the Shape of Consensus

How real systems dodge FLP impossibility: safety always, liveness only when the network cooperates.

August 29, 2026 · 9 min
T064 demonstration theorem Medium #distributed-systems #databases
Builds on: T062 — FLP Impossibility

Quorum Intersection (R + W > N)

One inequality generating the entire read/write consistency tradeoff space.

August 29, 2026 · 8 min
T065 theorem Easy #distributed-systems #databases
© 2026 CS Theorems · Powered by Hugo & PaperMod