Serializability in DBMS Theory - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is serializability in the context of databases?

Serializability is a property of a schedule (sequence of operations) in a database that ensures the schedule's outcome is the same as if the transactions were executed one after another, without overlapping.

beginner

Why is serializability important in database systems?

It ensures consistency by preventing conflicts and anomalies when multiple transactions run at the same time, making the database reliable and correct.

intermediate

What is the difference between serial and serializable schedules?

A serial schedule runs transactions one after another without overlap. A serializable schedule allows overlapping but guarantees the final result is the same as some serial schedule.

intermediate

Name two common types of serializability used in databases.

The two common types are conflict serializability and view serializability. Conflict serializability is easier to check and more commonly used.

intermediate

What is a conflict in the context of conflict serializability?

A conflict happens when two transactions access the same data item and at least one of them writes to it. The order of these conflicting operations affects the final result.

What does serializability ensure in a database schedule?

A Transactions are executed only one at a time without overlap

B All transactions run at the same time without any order

C The schedule produces the same result as some serial execution of transactions

D The database ignores transaction conflicts

Serializability ensures that even if transactions overlap, the final result is as if they ran one after another.

Which type of serializability is easier to check automatically?

A View serializability

B Logical serializability

C Temporal serializability

D Conflict serializability

Conflict serializability is easier to check because it focuses on conflicting operations between transactions.

A conflict occurs when two transactions:

A Access different data items

B Access the same data item and at least one writes

C Run at different times

D Are read-only

Conflicts happen when two transactions access the same data and at least one modifies it.

Which of the following is NOT a goal of serializability?

A Guarantee transactions run in parallel without any order

B Allow concurrent transaction execution

C Prevent transaction conflicts

D Maintain database consistency

Serializability does not guarantee unordered parallel execution; it ensures the result is as if transactions ran serially.

What is a serial schedule?

A Transactions run one after another without overlap

B Transactions run simultaneously

C Transactions run in random order

D Transactions are aborted

A serial schedule means transactions execute one at a time, fully completing before the next starts.

Explain in your own words what serializability means and why it is important in database transactions.

Think about how transactions can run together but still keep the database correct.

Describe the difference between conflict serializability and view serializability.

Focus on how conflicts and views affect the order of transactions.

Practice

1. What does serializability in a database ensure?

easy

A. Transactions appear to run one after another without overlap

B. All transactions run at the same time without any order

C. Data is deleted after each transaction

D. Only one transaction is allowed in the database

Solution

1. Step 1: Understand the meaning of serializability

   Serializability means the database behaves as if transactions are executed one by one, even if they run at the same time.

2. Step 2: Match the definition to the options

   Transactions appear to run one after another without overlap correctly states that transactions appear to run sequentially, which is the core idea of serializability.

3. Final Answer:

   Transactions appear to run one after another without overlap -> Option A

4. Quick Check:

   Serializability = Transactions run one by one [OK]

Hint: Serializability means no overlapping effects visible [OK]

Common Mistakes:

• Thinking transactions must run one at a time physically
• Confusing serializability with locking mechanisms
• Believing serializability deletes data
• Assuming only one transaction can exist

2. Which of the following schedules is not considered serializable?

easy

A. A schedule where transactions run one after another without overlap

B. A schedule where transactions are executed in a serial order

C. A schedule where transactions do not share any data

D. A schedule where transactions read and write the same data in conflicting order

Solution

1. Step 1: Identify what breaks serializability

   Conflicting operations like reading and writing the same data in overlapping order can cause non-serializable schedules.

2. Step 2: Analyze the options

   A schedule where transactions read and write the same data in conflicting order describes conflicting operations that break serializability. Options A, B, and C describe serial or conflict-free schedules.

3. Final Answer:

   A schedule where transactions read and write the same data in conflicting order -> Option D

4. Quick Check:

   Conflicting operations = Not serializable [OK]

Hint: Conflicting read/write means not serializable [OK]

Common Mistakes:

• Assuming all overlapping schedules are serializable
• Ignoring conflicts on shared data
• Thinking non-overlapping means non-serializable
• Confusing serial and serializable

3. Consider two transactions:
T1: Read(A), Write(A)
T2: Read(A), Write(A)
Which schedule is conflict serializable?

medium

A. T2 writes A first, then T1 reads and writes A

B. T1 and T2 read A simultaneously, then both write A simultaneously

C. T1 reads and writes A, then T2 reads and writes A

D. T1 reads A, T2 writes A, then T1 writes A

Solution

1. Step 1: Understand conflict serializability

   A schedule is conflict serializable if it can be rearranged to a serial order without conflicts.

2. Step 2: Analyze each schedule

   T1 reads and writes A, then T2 reads and writes A runs T1 fully before T2, so no conflicts. T1 and T2 read A simultaneously, then both write A simultaneously has simultaneous writes causing conflict. T2 writes A first, then T1 reads and writes A runs T2 before T1. T1 reads A, T2 writes A, then T1 writes A has overlapping writes causing conflict.

3. Final Answer:

   T1 reads and writes A, then T2 reads and writes A -> Option C

4. Quick Check:

   Serial order without conflicts = T1 reads and writes A, then T2 reads and writes A [OK]

Hint: Serial order with no overlapping writes is serializable [OK]

Common Mistakes:

• Thinking simultaneous writes are allowed
• Ignoring order of writes
• Confusing conflict serializability with view serializability
• Assuming any schedule with reads is serializable

4. Identify the error in this schedule:
T1: Read(X), Write(X)
T2: Write(X), Read(X)
Schedule order: T1 Read(X), T2 Write(X), T1 Write(X), T2 Read(X)
What is the problem?

medium

A. This schedule is not conflict serializable due to write-read conflict

B. This schedule is serializable because writes happen in order

C. No error, schedule is correct

D. The schedule has a deadlock

Solution

1. Step 1: Check for conflicts in the schedule

   T1 reads X, then T2 writes X before T1 writes X, causing a write-read conflict.

2. Step 2: Determine serializability

   Because of the conflicting order of operations, the schedule cannot be rearranged into a serial order without conflicts.

3. Final Answer:

   This schedule is not conflict serializable due to write-read conflict -> Option A

4. Quick Check:

   Write-read conflict breaks serializability [OK]

Hint: Write-read conflicts break serializability [OK]

Common Mistakes:

• Assuming writes always serialize correctly
• Ignoring read after write conflicts
• Confusing deadlock with serializability issues
• Thinking schedule order doesn't matter

5. You have three transactions:
T1: Read(A), Write(B)
T2: Write(A), Read(B)
T3: Read(B), Write(A)
Which schedule is conflict serializable?

hard

A. T1 -> T2 -> T3

B. T2 -> T3 -> T1

C. T3 -> T1 -> T2

D. T1 -> T3 -> T2

Solution

1. Step 1: Analyze conflicts between transactions

   T1 and T2 conflict on A and B; T2 and T3 conflict on A and B; T1 and T3 conflict on B and A.

2. Step 2: Check which order avoids cycles in conflict graph

   Order T2 -> T3 -> T1 avoids cycles, making the schedule conflict serializable.

3. Final Answer:

   T2 -> T3 -> T1 -> Option B

4. Quick Check:

   Conflict graph acyclic = T2 -> T3 -> T1 [OK]

Hint: Check conflict graph cycles to find serializable order [OK]

Common Mistakes:

• Ignoring conflicts between transactions
• Assuming any order is serializable
• Not checking for cycles in conflict graph
• Mixing read-write and write-write conflicts