1 / 20

Transactions

Explore how transactions work in databases, including recovery and concurrency control. Learn the properties of transactions and examples of atomic operations.

evelynp
Download Presentation

Transactions

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Transactions • Motivating Questions • How does transaction work ? • Why is it important for DBMS ? • How to use it ?

  2. Transactions, Recovery, and Concurrency Control • Transactions are the units to be considered in both recovery and concurrency control • Recovery techniques are needed to ensure that transactions complete successfully despite system failures • Logs are used to allow recovery, and checkpoints to identify what transactions need recovery • Concurrency control is needed to prevent concurrent transactions from interfering with each other • Locking and timestamping are the major techniques for concurrency control

  3. Properties of Transactions • Atomicity - a transaction is an atomic unit of processing; it is either performed in its entirety or not performed at all • Consistency preservation - a transaction must take the database from one consistent state to another • Isolation - changes made by a transaction should not be seen by other transactions until the initial transaction is committed • Durability - changes that are made and committed by a transaction must never be lost

  4. Atomicity • Either an operation completes fully or the operation does not happen at all • Low-level atomic operations are built into hardware • High-level atomic operations are called transactions • Transaction manager ensures that all transactions either • complete (“committed transaction”) • have no effect on the database (“aborted transaction”)

  5. A A B B A B System Model Memory Disk read (A) write (B) read (A) write (B) A local buffer T1 local buffer T2

  6. Assumptions • Each data item can be read and written only once by one single transaction. If can be modified many times in the local buffer • Values are written onto the global buffer space in the same sequential order that the write instructions are issued • If the transaction reads a value from the database, and this value was previously modified, it always gets the latest value • A data item can be a file, relation, record, physical page, etc., determined by the designer

  7. Transaction Example • Transfer $50 from account A to account B • Transaction structure • read (A) • A <- A -50 • write (A) • read (B) • B <-B +50 • write (B) • If initial values are A= 180 and B = 100, then after the execution A = 130 and B = 150 • If the system crashes between steps 3 and 6, then the database is in an inconsistent state

  8. Transaction Model • A transaction must see a consistent database • During transaction execution the database may be inconsistent • When the transaction is committed (completed successfully), the database must be consistent • A transaction which does not complete successfully is termed “aborted” • An aborted transaction must be “rolled back”, meaning the database is returned to its state prior to the transaction

  9. Problems in Ensuring Atomicity • Transaction failure: transaction cannot complete due to user abort or internal error condition • System errors: the database system must terminate an active transaction due to an error condition (e.g., deadlock) • System crash: a power failure or other hardware failure causes the system to crash • Disk failure: a head crash or similar failure destroys all or part of disk storage

  10. Write-ahead Log(Incremental Log with Immediate Updates) • A log file is kept on stable storage • Each transaction Ti when it starts, registers itself on the log, by writing <Ti, starts> • Whenever Ti executes write (X), the record <Ti, X, old-value, new-value> is written sequentially on the log, and then the write (X) is executed • When Ti reaches its last statement, the record <Ti commits> is added to the log • If X is modified, then its corresponding log record is always first written on the log and then written on the database • Before Ti is committed, all its corresponding log records must be in stable storage

  11. Example Transactions T1: read (A) A <-A + 50 read (B) B <- B + 100 write (B) read (C) C <- 2C write (C) A <- A + B + C write (A) T2: read (A) A <-A + 10 write (A) read (D) D <- D - 10 read (E) read (B) E <- E + B write (E) D <- D + E write (D) Initial values: A=100, B=300, C=5, D=60, E=80

  12. Log Records 1. <T1 starts> 2. <T1, B, 300, 400> 3. <T1, C, 5, 10> 4. <T1, A, 100, 560> 5. <T1 commits> 6. <T2 starts> 7. <T2, A, 560, 570> 8. <T2, E, 80, 480> 9. <T2, D, 60, 530> 10. <T2 commits> Database Values I. B 400 II. C 10 III. A 560 IV. A 570 V. E 480 VI. D 530

  13. Possible Order of Writes Log Database 1 2 3 4 5 I II III 6 7 8 IV 9 10 V VI Time

  14. Consequences of a Crash • After a crash, the log is examined. • Various actions are taken depending on the last instruction written on the log • Example:Last instruction (i)Action i = 0 nothing 1 <i<4 undo (T1) 5 <i<9 redo (T2) undo (T2) i>10 redo (T1) redo (T2)

  15. Algorithm • Redo all transactions for which the log has both start and commit operations • Undo all transactions for which the log has a start operation but no commit operation • Remarks: • in a multitasking system more than one transaction may need to be undone • if a system crashes during the recovery stage, the new recovery must still give correct results • in this algorithm, a large number of transactions need to be redone, since we don’t not know how far behind the database updates are

  16. Incremental Log with Deferred Updates • Each transaction Ti when it starts, registers itself on the log, by writing <Ti, starts> • Whenever Ti executes write (X), the record <Ti, X, new-value> is written sequentially on the log • When Ti reaches its last statement, the record <Ti commits> is added to the log • Before Ti is committed, all its corresponding log records must be in stable storage • Use the log records to perform the actual updates to the database after the commit • When system crash, only need to redo transactions for which the log has both start and commit operations

  17. Checkpointing • During execution, in addition to the activities of the previous method, periodically perform checkpointing • force log buffers on log • force database buffers on database • force “checkpoint record” on log • During recovery • undo all transactions that have not committed • redo all transactions that have committed after a checkpoint

  18. Checkpointing Example Tc Tf time T1 T2 T3 T4 checkpoint system failure • T1 okay • T2 and T3 redone • T4 undone

  19. Transactions: Summary • The concept of transaction is fundamental to database safeguards against and recovery from failure • A transaction is a sequence of instructions which alters the database so as to represent a single change in the world, and/or which retrieve information about a single snapshot of the world so as to support some task

  20. Report Exercise • The director of a financial organization has been alarmed concerning the vulnerability of relational databases. He has asked you to write a report advising her as to the risks to data as a consequence of systems failures and the vulnerability of data to unauthorized access. In your report you should identify the potential risks and steps that can be taken to minimize them (you can assume a RDBMS of your choice).

More Related