Lost Update Problem

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/database-management-system/transaction-management/concurrency-problems/asset-lost-update-problem after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: 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, Network Security
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, 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, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. TOC & Compiler: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. Database Management System: 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, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture provides a detailed explanation of the 'Lost update problem,' frequently referred to in database systems as the 'Write-Write problem.' The instructor, Sanchit Jain Sir, begins by defining the specific conditions under which this anomaly occurs. He states that if two different transactions perform write operations on the same data value, and there are no read operations between these writes, the second write operation will overwrite the first. This leads to the loss of the first transaction's update. The lecture uses a concurrent execution schedule involving two transactions, T1 and T2, acting on a shared data item A to illustrate this concept. The instructor emphasizes the importance of understanding this problem to ensure data consistency and integrity in multi-user database environments.

Chapters

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

    The instructor introduces the topic with the title 'Lost update problem / Write - Write problem' displayed at the top of the slide. He reads the definition: 'If there is any two write operation of different transaction on same data value, and between them there is no read operations, then the second write over writes the first write.' He presents a table with columns for T1 and T2. T1 executes Read(A) followed by Write(A). T2 executes Write(A) followed by Commit. He begins to set up a concrete numerical example to make the abstract definition clearer, preparing to show how the data value changes over time. He points to the table to highlight the specific operations involved in the conflict.

  2. 2:00 – 4:47 02:00-04:47

    The instructor writes 'a=5' on the board to establish the initial state of the data item A. He traces the execution flow: T1 reads the value 5, then performs a Write(A) operation, changing the value to 15. Immediately after, T2 performs a Write(A) operation, which he notes as writing the value 50. He draws red arrows on the screen to visualize the flow of data and the overwriting process. He explains that because T2 did not read the value 15 written by T1, T2's write of 50 overwrites T1's update of 15. Consequently, the update from T1 is lost, and the final value of A becomes 50, demonstrating the lost update problem in action. He gestures with his hands to emphasize the overwriting nature of the second transaction.

The lecture effectively demonstrates the concurrency anomaly known as the lost update problem. By walking through a specific scenario where T1 updates a value and T2 subsequently overwrites it without reading the intermediate state, the instructor clarifies why serialization or locking mechanisms are necessary to prevent data inconsistency. The visual aid of the table and the step-by-step numerical example reinforce the theoretical definition provided at the start, showing exactly how the second write operation invalidates the first. This example serves as a foundational concept for understanding concurrency control protocols.

Loading lesson…