Thomas write Rule
Duration: 6 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Quantitative Aptitude and Math: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Algebra, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Statistics, Probability, Percentage, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Average, Calculus, Trigonometry, Vectors, Linear Algebra
- Logical and Analytical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Verbal Analogy (Word Based Analogy), Directions (Direction Test), Blood Relations, Ranking, Order and Sequence, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Puzzle Solving (Puzzles), Cubes & Dices, Analytical Reasoning (Counting Figures Reasoning)
- English Language & Comprehension: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, Verb, Articles, Preposition, Pronoun, Conjunction, Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Cloze Test (Cloze Passage)
- Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
- 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, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security, Cyber and Info Security
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- 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, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
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
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: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.
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.

