Why Serializability is Important

 

 Why Serializability is Important

  • A schedule is serializable ⇒ correct
  • It behaves like a serial execution (one transaction at a time)

👉 So, serializability = correctness guarantee

⚠️ Serial vs Serializable

Serial Schedule        Serializable Schedule
No interleaving        Interleaving allowed
Very slow ❌        Efficient ✅
Safe ✔        Safe ✔

📌 Key Idea:

  • Serial execution is too slow
  • Serializable execution gives:
    • ✅ Correctness
    • ✅ Concurrency (performance)

Problem in Practice

❗ Difficulties:

  1. Unpredictable scheduling
    • OS decides execution order
    • Depends on:
      • system load
      • transaction arrival time
      • priorities

👉 So we cannot predict the schedule in advance

  1. Testing after execution is impractical
    • If schedule is not serializable
    • We must:
      • ❌ undo all operations
      • ❌ restart transactions

👉 Very costly and inefficient

Solution: Concurrency Control Protocols

Instead of testing schedules:

👉 DBMS uses protocols (rules) that ensure serializability automatically

📌 Idea:

If every transaction follows rules →
👉 resulting schedule is always serializable

Common Concurrency Control Techniques

1. Two-Phase Locking (2PL)

  • Transactions lock data items
  • Prevents conflicts

Guarantees:

  • ✅ Always serializable

Used in:

  • Most commercial DBMS

2. Timestamp Ordering

  • Each transaction gets a timestamp
  • Operations executed in timestamp order

👉 Ensures correct ordering of conflicts

3. Multiversion Protocols

  • Maintain multiple versions of data
  • Transactions read appropriate version

👉 Improves concurrency

4. Optimistic (Validation) Protocol

  • No strict control during execution
  • At commit time:
    • Check if conflicts occurred

👉 If conflict → rollback

5. Snapshot Isolation

  • Transactions see a snapshot of data
  • Reduces locking overhead

⚠️ Not always perfectly serializable

Continuous Transactions Problem

  • Transactions are continuously entering system
  • No clear start/end of schedule

📌 Solution: Committed Projection

👉 Consider only committed transactions

  • Ignore aborted ones

  • Check serializability of:

    C(S) → committed projection

 Summary

  • Serializability ensures correctness
  • Serial schedules are inefficient
  • Serializable schedules give:
    • ✔ correctness
    • ✔ concurrency

Key Takeaways

  • ❌ Don’t test schedules after execution
  • ✅ Use protocols to guarantee serializability
👉 “Instead of checking if a schedule is correct, DBMS ensures only correct schedules are possible.

Comments

Post a Comment

Popular posts from this blog

Database Management Systems DBMS PCCST402 Semester 4 KTU CS 2024 Scheme

 About Me Database Management Systems DBMS PCCST402 Scheme and Syllabus Model Question Paper - KTU BTech DBMS PCCST402 2024 Scheme Module-1 Introduction to DBMS Introduction to DBMS Example  Database Database System Vs Traditional File Processing Advantages of using DBMS Database System Concepts and Architecture Data Models, Schemas and Instances   Three schema architecture and Data Independence Database Languages and Interfaces Centralized and Client Server Architectures in DBMS Classification of Database Management Systems Conceptual Data Modeling and Database Design Conceptual Modeling and the Role of the ER Model in Database Design Entities and Attributes  Company Database Application - Example Entity Types, Entity Sets, Keys, and Value Sets in the ER Model Initial Conceptual Design of the COMPANY Database Relationship Types in the ER Model Relationship Degree, Role Names, and Recursive Relationships Constraints on Binary Relationship Types Attributes of Relation...
Read more

Data Models, Schemas and Instances

  Data Models, Schemas and Instances  1. Data Abstraction In databases, data abstraction means hiding the complex details of how data is stored and focusing only on what is important. Different users can view data at different levels of detail depending on their needs. 2. Data Models A data model is a collection of concepts used to describe the structure of a database. It defines: Data types Relationships among data Constraints on data Operations for accessing and updating data Data models help us understand and design databases without worrying about low-level storage details. Categories of Data Models a) High-level / Conceptual Data Models Close to how users think about data. Use concepts like entities , attributes , and relationships . Example: ER (Entity–Relationship) Model . b) Representational (Implementation) Data Models In between conceptual and physical models. Easy for users to understand but still close to how data is st...
Read more

Introduction to Database Management System -DBMS

Image
In today’s digital world, almost every application—from mobile banking and e-commerce to university portals and hospital systems—depends on the efficient storage, organization, and retrieval of data. As the amount of information generated by individuals and organizations continues to grow, managing this data in a structured and meaningful way becomes essential. This is where database systems play a central role. A database can be thought of as a well-organized collection of related data, designed so that it can be easily accessed, managed, and updated. But the database itself is only one component. To manage it effectively, we rely on a specialized software package known as a Database Management System (DBMS) . A DBMS provides a systematic and automated way to store large volumes of data, enforce rules for consistency and correctness, protect data from unauthorized access, and allow multiple users to work with the data simultaneously without conflicts. A database typically has three...
Read more