Idea of Concurrency control

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/database-systems/concurrency-control/introduction-to-concurrency-control/asset-idea-of-concurrency-control after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Section 1 | Language (Hindi): भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  3. Section 1 | Language (उर्दू भाषा — 22 प्रश्न (निश्चित)): Spelling & Diacritics, Grammar (اسم, فعل, صفت, ضمیر), Vocabulary, Idioms & Proverbs, Comprehension
  4. Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित)): Bangla Script and Sounds, Bangla Grammar and Usage, Bangla Word Formation and Vocabulary, Reading and Text Interpretation
  5. Section 1 | Language (English): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Verb, Adverb, Preposition, Articles, Determiner, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Facts, Inference and Judgements
  6. Section 2 | Primary Maths & Reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Mensuration and Geometry, Age Problems, Arithmetic, Powers and Exponents (Surds and Indices), Algebra, Probability, Trigonometry, Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence
  7. Section 2 | General Awareness (GK + Current Affairs): Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, Indian Economy, Environment, GK- Current Affairs, Static General Knowledge
  8. Section 3 | Computer System and Org. (CSO): Basics of COA, Floating Point Rep, Cache Memory Organization, Instr Formats & Modes, Programming the Basic Computer, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design
  9. Section 3 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control
  10. Section 3 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Process Synchronization
  11. Section 3 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics
  12. Section 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Shortest Path Algos
  13. Section 3 | Theory Of Computation & Compiler Design: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  14. Section 3 | Emerging Trends (AI, Societal Ethics & MS Office): Artificial Intelligence, Emerging Tech Trends, Society, Law & Ethics, MS Office Applications
  15. Section 3 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Maintenance and Configuration Management, Software Testing
  16. Section 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Section 3 | OOPS, C++, JAVA, HTML: OOPS with C++, Java, HTML Basics, CSS
  18. Section 3 | Java: Java Fundamentals, Array, String, IO & References
  19. Section 3 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  20. Section 3 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  21. Section 3 | Multimedia: Multimedia
  22. BPSC Previous Year Papers:
  23. BPSC Full Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces Concurrency Control, a critical mechanism for maintaining database consistency during simultaneous transaction execution. The instructor begins by recapping the necessity of verifying schedule correctness, specifically checking for properties like conflict serializability, view serializability, recoverability, and cascade-less execution. The primary objective is to transition from analyzing existing schedules to designing protocols that inherently guarantee these safety properties. The session then delves into the specific mechanics of conflict serializability, defining the precise conditions under which instructions conflict. It outlines three major methodological approaches to achieve this: timestamping, locking, and validation. Finally, the lecture concludes by establishing the fundamental goals of any concurrency control protocol, prioritizing high concurrency and implementation simplicity. The instructor uses visual aids like underlining and red circles to emphasize key terms such as conflict serializability and Concurrency on the slides.

Chapters

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

    The session opens with the title CONCURRENCY CONTROL displayed on the slide. The instructor explains that having a schedule is not enough; one must verify if it maintains database consistency. He lists specific properties to check: conflict serializability, view serializability, recoverability, and cascade-less. The slide text explicitly states the goal is to understand protocols that guarantee how to design schedules ensuring conflict serializability or other properties. This sets the stage for moving from theoretical verification to practical protocol design. The instructor emphasizes that we have understood how to check schedules and now need to understand the protocols that guarantee these designs.

  2. 2:00 – 5:00 02:00-05:00

    The focus shifts to ensuring conflict serializability, described as the most important property. The instructor defines conflicting instructions using three simultaneous conditions: they must belong to different transactions, operate on the same data value, and at least one must be a write instruction. He notes the core issue is simultaneous access to the same data. Three approaches are introduced: Timestamping (deciding order before entry), Lock-based (locking data items to prevent simultaneous use), and Validation-based. The Lock-based section details 2-phase locking (2PL) variants including Basic 2PL, Conservative 2PL, Rigorous 2PL, and Strict 2PL, alongside Graph-based protocols. The instructor writes Ti <-> Tj to symbolize potential conflicts between transactions. He explains that locking prevents different transactions from using data simultaneously, effectively removing conflict possibilities.

  3. 5:00 – 7:52 05:00-07:52

    The lecture details the Validation based protocol, noting it is useful when most transactions are read-only and conflict rates are low. The final section outlines the Goals of a Protocol. The instructor emphasizes that concurrency should be as high as possible, calling it the ultimate goal. Other goals include minimizing transaction time, satisfying desirable properties, and ensuring the protocol is easy to understand and implement. The slide lists these points clearly, with the instructor underlining Concurrency and Desirable Properties to highlight their importance in protocol evaluation. He specifically notes that while we desire these properties, the primary effort is driven by the need for high concurrency. The slide text explicitly lists these goals as the desired properties from schedule generating protocols.

The video provides a structured overview of Concurrency Control, moving from the theoretical need for consistency checks to the practical application of protocols. It establishes conflict serializability as a key metric, defining the exact conditions for instruction conflicts. By categorizing solutions into timestamping, locking, and validation methods, it offers a comprehensive framework for managing transaction interactions. The concluding emphasis on protocol goals reinforces that while correctness is vital, efficiency and usability remain paramount design constraints. The instructor systematically breaks down complex database concepts into actionable definitions and protocol categories.

Loading lesson…