Unrepeatable Read Problem

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/UP-LT-GRADE-ASSISTANT-TEACHER-2025/cs-07-database-management-systems/transaction-management/concurrency-problems/asset-unrepeatable-read-problem 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 concurrency control problems in database management systems, specifically focusing on the 'Unrepeatable Read' and 'Phantom Read' anomalies. The instructor begins by presenting a slide titled 'Unrepeatable read problem' which defines the issue: when a transaction reads a data item twice, and another transaction updates it in between, the results differ. He then uses a visual table to demonstrate this with two transactions, T1 and T2. He initializes a data item A with the value 10. T1 performs a Read(A), followed by T2 performing a Read(A) and then a Write(A) changing the value to 25. Finally, T1 performs a second Read(A). The instructor writes the values '10' and '25' next to the operations to visually track the change, showing that T1 read 10 first and then 25, proving the read was not repeatable. The second half of the video introduces the 'Phantom read problem' with a new slide. The instructor explains this occurs when a transaction reads a set of rows, and another transaction deletes or inserts rows that match the search criteria. He sets up a similar table where T1 reads A (value 10). Then, T2 executes a Delete(A) operation. When T1 attempts to read A again, the data item is gone. The instructor writes a question mark next to the second read operation to signify the missing data. He explains that the data item has vanished like a 'phantom,' causing the second read to return a different result (or nothing) compared to the first. This highlights the importance of isolation levels in preventing such inconsistencies.

Chapters

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

    The instructor introduces the 'Unrepeatable read problem' using a slide definition and a transaction table. He sets up an example where data item A equals 10. T1 reads A (10), followed by T2 reading A (10) and writing A (25). Finally, T1 reads A again, retrieving 25. The instructor writes '10' and '25' next to the read/write operations to show the value change, illustrating how T1 sees inconsistent data. He emphasizes that the first transaction sees different values for the same read operation. The slide text explicitly states: 'When a transaction tries to read a value of a data item twice, and another transaction updates the data item in between, then the result of the two read operation of the first transaction will differ, this problem is called, Non-repeatable read problem'.

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

    The topic shifts to the 'Phantom read problem' with a new slide and table. The instructor sets A=10. T1 reads A (10). Then T2 performs a Delete(A) operation. When T1 reads A again, the data is missing. The instructor uses a question mark to indicate the missing value, explaining that the data item disappeared, creating a 'phantom' effect where the second read yields a different outcome than the first. He gestures to emphasize the disappearance of the data. The slide title changes to 'Phantom read problem' and the table shows T1 Read(A), T2 Delete(A), and T1 Read(A) again. The instructor writes 'a=10' and then a question mark next to the final read.

The lecture effectively contrasts two specific concurrency anomalies. Unrepeatable read focuses on value changes of an existing item, while phantom read focuses on the existence of the item itself (deletion/insertion). Both demonstrate why strict isolation levels are necessary to maintain data consistency. The visual aids of the transaction tables and handwritten values are crucial for understanding the sequence of events that lead to these problems. The instructor uses clear examples to differentiate between a value changing (unrepeatable read) and a row disappearing (phantom read).

Loading lesson…