DBMS Topics
HubUnit 1 — Introduction to DBMS & Entity-Relationship ModelAdvantages and Disadvantages of DBMSAggregationCharacteristics of DBMSData IndependenceData ModelsDatabase Users and AdministratorsDBMS LanguagesER DiagramsEntity-Relationship ER ModelIntroduction to DBMSKeys in DBMSRelationships and CardinalitySchema and InstanceSpecialization and GeneralizationUnit 1 Summary — Introduction to DBMS & ER ModelThree-Level Architecture ANSI/SPARC ArchitectureWeak Entity SetUnit 2 — Relational Model & SQLConstraints in SQLCursorsDCL and TCL CommandsDDL CommandsDML CommandsDomain Relational Calculus DRCFunctions and Stored ProceduresJoins in SQLNested Queries SubqueriesRelational AlgebraRelational CalculusRelational ModelSQL IntroductionUnit 2 Summary — Relational Model & SQLTriggers in SQLTuple Relational Calculus TRCViews in SQLArmstrong's Axioms & Closure of AttributesBoyce-Codd Normal Form BCNFClosure of AttributesDependency PreservationFifth Normal Form 5NFFirst Normal Form 1NFFourth Normal Form 4NFFunctional DependencyLossless DecompositionMultivalued DependencyNormal Forms — OverviewNormalization — IntroductionSecond Normal Form 2NFUnit 3 Summary — NormalizationThird Normal Form 3NFUnit 4 — Transaction Management & Concurrency ControlACID PropertiesCheckpointsConcurrency Control & SerializabilityDeadlock in DBMSLock-Based Protocols & Two-Phase LockingLog-Based RecoveryRecovery SystemSerializabilityShadow PagingUnit 4 Summary — Transaction Management & Concurrency ControlTimestamp-Based ProtocolTransaction ManagementTransaction StatesTwo-Phase Locking 2PLUnit 5 — Storage & IndexingB+ TreeB-TreeCost EstimationDynamic HashingFile OrganizationHashing TechniquesIndexing — IntroductionMulti-Level IndexingQuery OptimizationQuery ProcessingSingle-Level IndexingStatic HashingUnit 5 Summary — Storage & IndexingUnit 6 — Advanced Topics in DBMSBig Data and DBMSCloud DatabaseData MiningData WarehouseDatabase SecurityDistributed DatabaseDistributed Query ProcessingDistributed DBMS Architecture, Fragmentation & ReplicationMongoDB — IntroductionNoSQL DatabaseReplication in Distributed DatabasesUnit 6 Summary — Advanced Topics in DBMSViva Voce — DBMSImportant Viva Questions — DBMSInterview Questions — DBMSViva Answers — DBMSDBMS Multiple Choice Questions MCQsDBMS Lab Programs
Unit 4 Summary — Transaction Management & Concurrency Control
Last Updated : 21 May, 2026
Unit 4132 words10 headingsTables includedExamples included
Quick Reference
Transaction States
Active → Partially Committed → Committed
↓ (failure)
Failed → Aborted
ACID Properties
| Property | Ensures | Mechanism |
|---|---|---|
| Atomicity | All-or-nothing | Undo log, Rollback |
| Consistency | Valid state → Valid state | Constraints, App logic |
| Isolation | No interference | Locks, MVCC |
| Durability | Committed = Permanent | WAL, Checkpoints |
Concurrency Problems
| Problem | Description | Fix |
|---|---|---|
| Dirty Read | Read uncommitted data | Strict 2PL / Read Committed |
| Lost Update | Write overwritten by another | Exclusive locks |
| Non-Repeatable Read | Same read gives different values | Repeatable Read isolation |
| Phantom Read | New rows appear between reads | Serializable isolation |
Serializability Test
| Ti | Tj if Ti's operation conflicts with and precedes Tj's |
| No cycle in graph | Conflict Serializable ✓ |
| Cycle exists | NOT serializable ✗ |
2PL Variants
| Basic 2PL | Serializable; cascading rollbacks possible |
| Strict 2PL | X-locks held till commit; no dirty reads |
| Rigorous 2PL | All locks held till commit; simplest |
Deadlock Handling
| Strategy | Method |
|---|---|
| Detection | Wait-For Graph cycle check; abort victim |
| Wait-Die | Older waits; younger aborts |
| Wound-Wait | Older preempts; younger waits |
| Prevention | Acquire locks in global order |
Timestamp Protocol Rules
| TS(Ti) < W-ts(X) | ABORT Ti |
| else | proceed, update R-ts(X) |
| TS(Ti) < R-ts(X) | ABORT Ti |
| TS(Ti) < W-ts(X) | ABORT Ti (or ignore — Thomas' Rule) |
| else | proceed, update W-ts(X) |
Recovery Methods Comparison
| Log-Based (WAL) | Write log first, then data. UNDO+REDO on crash. |
| Checkpoints | Periodic log truncation; faster recovery. |
| Shadow Paging | Maintain old page table; instant recovery; no log. |
Recovery After Crash (Log-Based)
| 1. Analysis | Find REDO set (committed) and UNDO set (incomplete) |
| 2. REDO pass | Re-apply committed changes (oldest log record first) |
| 3. UNDO pass | Reverse incomplete changes (newest log record first) |
Exam Focus
Revise definitions, diagrams, examples, and short-answer points for Unit 4 Summary — Transaction Management & Concurrency Control.
Interview Use
Prepare one clear explanation, one practical example, and one common mistake for this DBMS topic.
Search Terms
dbms, database management system, database notes, sql, unit, summary, unit 4 summary — transaction management & concurrency control
Related DBMS Topics
Continue learning this concept
Unit 4Unit 4 — Transaction Management & Concurrency ControlThis unit covers how databases maintain data integrity when multiple operations execute simultaneously or when system failures occur. Transactions are the fundamental uniUnit 4Concurrency Control & SerializabilityConcurrency control is the mechanism that ensures correct results when multiple transactions execute simultaneously, without interfering with each other.Unit 4Transaction ManagementA transaction is a logical unit of work consisting of one or more database operations reads/writes that must be executed as a single indivisible unit. Either ALL operatioUnit 4Transaction StatesA transaction passes through a series of well-defined states during its lifetime. The DBMS tracks the state of every transaction to manage concurrency and recovery correcUnit 4ACID PropertiesACID is an acronym for the four key properties that every database transaction must satisfy to ensure data validity even in cases of errors, power failures, and concurrenUnit 4CheckpointsA checkpoint is a snapshot mechanism where the DBMS periodically writes all dirty modified buffer pages to disk and records the state of active transactions in the log.