Unrepeatable Read Problem

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/SSC-JE-IMD-SCIENTIFIC-ASSISTANT-COMPUTER-SCIENCE/databases/transaction-management/concurrency-problems/asset-unrepeatable-read-problem after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. General Intelligence & Reasoning: Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Logical Sequence Of Words, Syllogisms, Venn Diagram, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Data Sufficiency, Puzzle Solving (Puzzles), Data Arrangement, Cubes & Dices, Calendar, Clock, Arithmetic, Number System, HCF LCM, Verbal Analogy (Word Based Analogy), Visual Recognition and Figure Completion, Paper Folding and Cutting, Transformation of Shapes, Clocks and Calendars, Direction Sense, Cubes and Dice, Patterns in Two-Dimensional Figures, Seating Arrangements, Analogy and Classification, Logical Deduction and Induction, Alphabet and Word Tests, Mathematical Operations, Series Completion, Simplification and Approximation, Coding and Decoding, Numerical Reasoning, Assembling and Grouping of Shapes, Three-Dimensional Patterns and Visualization, Vocabulary, Number System, Averages, Mixtures and Alligation, Simple and Compound Interest, Percentages, Algebra, Speed, Time and Distance, Seating and Arrangement Puzzles, Traverse Surveying, Order, Ranking and Sequence, Constraint Puzzles, Syllogisms and Venn Diagrams, Reading Comprehension, Critical Reasoning, Permutations and Combinations, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Ratio and Proportion, Time and Work, Mensuration, Data Interpretation, Powers, Surds and Logarithms, Sequences and Series, Articles and Determiners, Sentence Completion, Data Sufficiency, Blood Relations, Simple Interest and Compound Interest, Mixture and Alligation, Sequence and Series (Series), Speed Time and Distance, Algebra, Profit and Loss, Powers and Exponents (Surds and Indices), Permutation and Combination
  2. General Awareness: Physics, Chemistry, Biology, History, Geography, Polity, Indian Economy, Environment, Static General Knowledge, GK- Current Affairs, Artificial Intelligence, MS Office Applications, Terms & Abbreviations, Keyboard Shortcuts, Evolution of Indian Banking (Banking & Financial Awareness), Emerging Tech Trends
  3. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus, Probability, Statistics, Signal Space and Optimum Detection, Probability, Statistics
  4. Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Number Systems and Codes, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Waveform Generators and Timer Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Latches and Flip-Flops, Finite State Machines, Sequential Circuits and State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Latches and Flip-Flops, Number Systems and Codes, Registers and Counters
  5. Computer Organisation & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Register Transfer and Microoperations, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output, Registers and Counters
  6. Programming & Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, HTML Basics, OOPS with C++, Java, Object Oriented Technology
  7. Databases: 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, Database Security & Authorization
  8. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  9. Theory of Computation: 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
  10. Compiler Design: 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
  11. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Security, Windows OS, Distributed Systems, Unix OS, Linux OS
  12. Computer Networks: Introduction to CN, 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, Data Communication, Website, Browser & Services, Web Design & Development, Network Security, Cyber Threats and Malware Attacks, Cyber Safety and Security
  13. Full Length Mock Tests:
  14. Sectional Tests:
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…