

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
Notes of DBMS module 5 notes are there. Kindly inform if ay other notes are required
Typology: Study notes
1 / 3
This page cannot be seen from the preview
Don't miss anything!
VTU DBMS Module 5: Transaction Management and Concurrency Control (Detailed Notes)
A transaction is a logical unit of database operations that must be executed completely or not at all. Example of a Transaction:
a. Atomicity Ensures all operations of a transaction are completed. If not, the transaction is aborted. Handled by undo mechanism. b. Consistency A transaction transforms the database from one consistent state to another. c. Isolation Ensures that the execution of one transaction is isolated from others. Intermediate transaction results are invisible. d. Durability Once a transaction is committed, it remains so even after a system crash. Handled by redo mechanism.
Active → Partially Committed → Committed OR → Failed → Aborted
A schedule is a sequence of operations from multiple transactions. Types:
Serial Schedule : One transaction executes completely before another. Concurrent Schedule : Interleaved operations of transactions. Conflict Serializability: A schedule is conflict serializable if it can be transformed into a serial schedule by swapping non- conflicting operations.
Concurrency control ensures that database transactions are executed concurrently without violating data integrity. Problems in Concurrency: Lost Update : Two transactions overwrite each other’s changes. Temporary Update (Dirty Read) : One transaction reads uncommitted data from another. Incorrect Summary : Aggregate functions on inconsistent data.
a. Lock-Based Protocols Shared Lock (S) : Read-only Exclusive Lock (X) : Read & Write Two-Phase Locking Protocol (2PL):
Deadlock : A situation where two or more transactions wait for each other’s resources. Handling Techniques : Deadlock Prevention : Resource ordering, wait-die & wound-wait schemes.