BE - Database Management Systems

1. Conflict Serializability: The "Rulebook" Method

• What it checks: The order of specific actions.

• The Rule: If two transactions try to read and write the same piece of data, their order must not be mixed up. The order of these critical operations must be the same as if the transactions ran one after the other.

• Simple Test: Can we rearrange the schedule by only swapping actions that don't interfere (like two reads) to make it look serial? If yes, it's conflict-serializable.

• Analogy: Following a strict recipe. You can mix the dry ingredients (non-conflicting actions) in any order, but you must add the eggs (a write) before you mix (a read)—you can't swap that step.

In short: It's about the process. Are the steps in an acceptable order?

2. View Serializability: The "Final Result" Method

• What it checks: The final outcome.

• The Rule: It doesn't care about the steps. It only cares if the end result—what each transaction sees and the final database state—is identical to running the transactions in some serial order.

• Simple Test: Is the final database state the same? Did every transaction read the values it would have read in a serial schedule? If yes, it's view-serializable.

• Analogy: Grading a finished cake. The teacher doesn't care if you mixed the dry ingredients before the wet ones, as long as the final cake looks and tastes exactly like the one made by following the recipe step-by-step.

In short: It's about the result. Does the end result look correct?