Thomas write Rule

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/RPSC-PROGRAMMER/paper-1-dbms/concurrency-control/timestamp-ordering-protocols/asset-thomas-write-rule after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Paper 1 | Reasoning Test: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Puzzle Solving (Puzzles), Venn Diagram, Analogy, Ranking, Order and Sequence, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Selection Decision Table (Decision Making), Logical Sequence Of Words, Cubes & Dices, Analytical Reasoning (Counting Figures Reasoning), Calendar, Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Direction Sense, Algebra, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Profit, Loss and Discount, Constraint Puzzles, Speed, Time and Distance, Traverse Surveying, Ratio and Proportion, Time and Work, Mensuration, Permutations and Combinations, Clocks and Calendars, Data Interpretation, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Blood Relations, Data Sufficiency
  2. Paper 1 | Numerical Analysis: Number System, HCF LCM, Percentage, Ratio and Proportion (Ratios), Average, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Algebra, Statistics, Data Interpretation, Mental Ability, Arithmetic, Logarithm, Profit and Loss, Simple Interest and Compound Interest, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Permutation and Combination, Probability, Sequences and Series, Powers, Surds and Logarithms, Subject-Verb Agreement, Sentence Completion, Geometry, Sentence Structure and Correction, Data Sufficiency, Trigonometry, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Probability, Statistics, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Graph Theory, Combinatorics
  3. Paper 1 | General Knowledge: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge, Polity, Indian Economy
  4. Paper 1 | DBMS: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Transaction Management, Concurrency Control, Relational Calculus, Database Security & Authorization, Database Recovery
  5. Paper 1 | Data Communication & Network: 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, Network Security, Security in Mobile and Wireless Computing, Input Output Organisation, File Management, Hardware Basics, Terms & Abbreviations, Protocols & Services, Network Access Technologies, Cyber Safety and Security, Basics of COA
  6. Paper 2 | System Analysis & Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Security, Risk Management & Maintenance, extras
  7. Paper 2 | Programming Language (Java): Java Fundamentals, OOPS with Java, Array, String, IO & References, Generic & Collections, Multithreading, Java, Miscellaneous, Control Flow, OOPS with C++, Stack, C Fundamentals, Arrays & Pointers, Object Oriented Technology, Control Flow & Looping, Introduction to Python
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…