Storage Structure
Duration: 20 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
- Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
- Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
- Paper 1 | Unit Tests:
- Paper 1 | Full-Length Mock Tests:
- Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
- Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation Registers and Counters Boolean Algebra and Logic Gates Microprocessors and Microcontrollers Logic Families and CMOS Logic Microprocessors Logic Gates and Boolean Algebra Number Systems and Codes Minimization of Boolean Functions Timing, Hazards and Testing Logic Families Combinational Logic Design Arithmetic Circuits Semiconductor Memories and Programmable Logic Devices Combinational Logic Circuits Sequential Circuits and State Machines Latches and Flip-Flops Finite State Machines Minimization of Boolean Functions Arithmetic Circuits Registers and Counters Latches and Flip-Flops Number Systems and Codes
- Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
- Paper 2 | Programming and 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
- Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
- Paper 2 | Theory Of Computation/Automata Theory: 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
- Paper 2 | 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
- Paper 2 | Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management
- Paper 2 | DataBase Management System/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
- Paper 2 | 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
- Paper 2 | CS/IT Sectional Mock Tests:
- Complete Paper Full Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The video presents a lecture on storage structures and recovery approaches in database systems. It begins by defining three types of storage: volatile storage, which is lost on system crash (e.g., main memory); nonvolatile storage, which survives crashes (e.g., disk, flash memory); and stable storage, a theoretical concept that survives all failures by maintaining multiple copies on distinct media. The lecture then transitions to recovery approaches, explaining the steal and no-steal methods, which determine when updated cache pages are written to disk relative to transaction commit, and the force and no-force methods, which determine if writes are immediate upon commit. The final section details the implementation of stable storage, emphasizing the need to maintain multiple copies on separate disks, often at remote sites, to protect against disasters. It discusses the risks of data transfer failure, which can lead to inconsistent copies, and outlines a recovery strategy: first, identify inconsistent blocks by comparing copies, and then resolve the inconsistency by overwriting the incorrect copy with the correct one, a method used in hardware RAID systems.
Chapters
0:00 – 2:00 00:00-02:00
The video opens with a slide titled "Storage Structure". It defines three types of storage. 1. Volatile storage: does not survive system crashes, examples include main memory and cache memory. 2. Nonvolatile storage: survives system crashes, examples include disk, tape, flash memory, and battery-backed-up RAM. 3. Stable storage: described as a mythical form of storage that survives all failures, approximated by maintaining multiple copies on distinct nonvolatile media. The instructor uses a yellow highlighter to emphasize key terms like "volatile storage", "nonvolatile storage", and "stable storage" on the slide.
2:00 – 5:00 02:00-05:00
The slide changes to "Recovery approaches". The instructor explains four methods. 1. Steal approach: cache pages updated by a transaction can be written to disk before the transaction commits. 2. No-steal approach: cache pages cannot be written to disk before the transaction commits. 3. Force approach: when a transaction commits, all updated pages are immediately written to disk. 4. No-force approach: when a transaction commits, updated pages are not immediately written to disk. A diagram on the left shows the flow from CPU to cache to main memory to disk, with handwritten annotations like "before" and "after" to illustrate the steal and no-steal concepts. The instructor also draws a diagram at the bottom for "Cache Page Replacement" and "Write Back".
5:00 – 10:00 05:00-10:00
The video returns to the "Storage Structure" slide, where the instructor continues to highlight key terms. The focus is on the definition of stable storage, which is described as a "mythical form of storage that survives all failures". The instructor emphasizes that this is approximated by maintaining multiple copies on distinct nonvolatile media. The slide also lists examples of nonvolatile storage, including disk, tape, flash memory, and non-volatile (battery-backed up) RAM. The instructor uses a yellow highlighter to underline and circle important words like "volatile", "nonvolatile", and "stable".
10:00 – 15:00 10:00-15:00
The slide changes to "Stable-Storage Implementation". The instructor explains that to implement stable storage, multiple copies of each block are maintained on separate disks, which can be at remote sites to protect against disasters like fire or flooding. The slide then discusses failure during data transfer, which can result in inconsistent copies. It lists three outcomes: successful completion, partial failure (destination block has incorrect information), and total failure (destination block was never updated). The instructor emphasizes the need for a recovery procedure to restore the block to a consistent state if a data-transfer failure occurs.
15:00 – 19:39 15:00-19:39
The final slide, titled "Protecting storage media from failure during data transfer", outlines a procedure for executing an output operation with two copies of each block. The steps are: 1. Write the information to the first physical block. 2. When the first write successfully completes, write the same information to the second physical block. 3. The output is completed only after the second write successfully completes. The instructor draws a diagram showing two sites, Site 1 and Site 2, with a write operation. The slide then explains how to recover from failure: first, find inconsistent blocks by comparing the two copies of every disk block. It presents an expensive solution (comparing all blocks) and a better solution (recording in-progress writes in non-volatile storage, like NVRAM, to only compare potentially inconsistent blocks). The final step is to overwrite the inconsistent copy with the correct one.
The lecture systematically builds a conceptual framework for reliable data storage. It starts by classifying storage types based on their resilience to failure, from volatile to the theoretical ideal of stable storage. This foundation leads to the practical discussion of recovery approaches, which are the mechanisms used to ensure data consistency in the face of system crashes. The core of the lesson is the implementation of stable storage, which is presented as a solution to the problem of data loss during a write operation. The video demonstrates that this is achieved not through a single magical technology, but through a robust, multi-step process involving redundancy, careful sequencing of writes, and a well-defined recovery protocol to handle the inevitable failures that occur during data transfer.

