Thomas write Rule

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/UP-LT-GRADE-ASSISTANT-TEACHER-2025/cs-07-database-management-systems/concurrency-control/timestamp-ordering-protocols/asset-thomas-write-rule after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. CS | 01 | Digital Logic and Circuits and Discrete Mathematical Structures: Digital Systems & Boolean Basics, Number System, Number Representation, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Permutation and Combination
  3. CS | 02 | Computer Organization and Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Multiprocessors
  4. CS | 03 | Data Structures and Algorithm: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Complexity Theory, Advanced Algorithms
  5. CS | 04 | Problem Solving through C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. CS | 05 | Object Oriented Techniques: Object Oriented Technology, Java
  7. CS | 06 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Unix OS
  8. CS | 07 | Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Query Processing & Optimization, File Organization & Indexing
  9. CS | 08 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics
  10. CS | 09 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  11. CS | 10 | Internet Technology, Web Design and Web Technology: Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, JavaScript-Basics, HTML Basics
  12. CS | 11 | System Analysis And Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance
  13. CS | 12 | Information Security and Cyber Laws: Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security
  14. CS | 13 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  15. GS Paper | 01 | Indian and World Geography: Geography
  16. GS Paper | 02 | History: History
  17. GS Paper | 03 | Indian Economy & Social Development: Indian Economy
  18. GS Paper | 04 | General Science: Biology, Chemistry, Physics
  19. GS Paper | 05 | Elementary Maths: Number System, Divisibility Rules, HCF LCM, Percentage, Profit and Loss, Simple Interest and Compound Interest, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Algebra, Mensuration and Geometry, Data Interpretation, Arithmetic, Statistics, Probability, Sequence and Series (Series), Mixture and Alligation, Calculus, Trigonometry, Vectors
  20. GS Paper | 06 | Indian Polity and Governance: Polity
  21. GS Paper | 07 | Current Events: GK- Current Affairs
  22. UPLT Live Classes Notes: UPLT Live Classes
  23. UPLT Full Mock Tests Tier 1:
  24. UPLT Full Mock Tests Tier 2:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture provides a detailed explanation of the Thomas Write Rule, a modification to the standard timestamp-ordering protocol used in database concurrency control. The instructor begins by defining the rule as an improvement that increases potential concurrency by allowing certain "blind write" operations to be ignored rather than causing a transaction rollback. The lecture then breaks down the specific conditions under which write operations are accepted or ignored, contrasting them with the standard protocol. Finally, the instructor uses a comparison table to analyze the properties of the Thomas Write Rule, specifically noting its ability to ensure view serializability while sacrificing conflict serializability.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The session opens with a slide titled "THOMAS WRITE RULE". The text on the slide defines the rule as an improvement in timestamping protocol that makes modifications to generate view serializable protocols with greater concurrency. It explicitly states that it is a modified version of the timestamp-ordering protocol where blind write operations may be ignored under certain circumstances. The slide also clarifies that while protocol rules for read operations remain unchanged, there is a slight change in the write operation logic compared to the standard timestamp ordering protocol.

  2. 2:00 – 5:00 02:00-05:00

    The instructor displays a slide listing four rules for when a transaction $T_i$ issues a `write(Q)`. He explains that if $TS(T_i) < W ext{-}timestamp(Q)$, the transaction is attempting to write an obsolete value. The standard protocol would reject this and roll back $T_i$. However, the Thomas Write Rule modifies this: if $TS(T_i) < W ext{-}timestamp(Q)$, the write operation is simply ignored. To illustrate this, the instructor draws a timeline diagram with $TS(T_i) = 5$ and $TS(T_k) = 10$. He writes $w(Q)$ operations on the timeline, showing that if an older transaction ($T_i$) tries to write after a newer transaction ($T_k$) has already written, the older write is discarded. He writes values like $Q=50, 100, 200$ to demonstrate the sequence of writes and how the final value is determined by the most recent valid write, effectively ignoring the obsolete one.

  3. 5:00 – 6:10 05:00-06:10

    The final segment features a comparison table evaluating different concurrency control schemes. The instructor focuses on the "Thomas Write Rule" row. He marks "NO" for Conflict Serializability, indicating that the protocol does not guarantee conflict serializability. He marks "YES" for View Serializability, confirming it maintains this property. He also marks "YES" for Deadlock Freedom. This section serves as a summary of the protocol's characteristics, emphasizing that the relaxation of conflict serializability allows for the benefits of view serializability and deadlock freedom.

The lecture systematically builds an understanding of the Thomas Write Rule. It starts with a high-level definition, moves to the specific algorithmic changes regarding write operations (ignoring obsolete writes), and concludes with a comparative analysis of its serializability properties. The core concept is the trade-off: by ignoring blind writes, the protocol avoids unnecessary rollbacks, thereby increasing concurrency and ensuring view serializability, even though it loses the guarantee of conflict serializability.

Loading lesson…