DBMS Cheat Sheet
Keys and normal forms
Super ⊇ Candidate (minimal) → Primary (chosen, NOT NULL) + Alternate
1NF atomic · 2NF no partial dep · 3NF no transitive dep · BCNF determinant = super key
"The key, the whole key, and nothing but the key"
Transactions
ACID: Atomicity(undo log) Consistency Isolation(locks/MVCC) Durability(WAL)
Dirty read → stopped by READ COMMITTED
Non-repeatable → stopped by REPEATABLE READ
Phantom → stopped by SERIALIZABLE
2PL: growing then shrinking → conflict serializable
Precedence graph without a cycle → conflict serializable
Indexing
B+ tree: data only in leaves, leaves linked → range queries
1 clustered per table, many non-clustered
Composite (a,b): a ✓ a+b ✓ b ✗
Full DBMS documentation