PPT-Transaction And Concurrency Control

Bhavya Kilari Dr Yanqing Zhang CSc 8320 PREVIEW P ART I I NTRODUCTION Transaction Processing System R Chow amp T Johnson 1997. 1. David . Lomet. Microsoft Research. Mohamed . Mokbel. University of Minnesota. Talk Outline. Unbundled. Transaction Services. Challenge: Key Range Locking. Using. Conventional . L. ocking. . M. anagers. Seminar: Transaction Processing (Bachelor). SS 2009. Dennis . Stratmann. Outline. Goal and Overview. Examine Three Approaches to CC on RD:. 1. Predicate-Oriented Concurrency Control. 2. Relational Update Transactions. concurrency. . controll. Chapter. 13. “Distributed Systems: . Concepts and Design”. Coulouris. , . Dollimore. , Kindberg. Hanna. Björling, . Stina Fröjd & Liv Sundman. Transaction. A transaction is a point where there is interaction with the database. Slides. are . mainly. . taken. from «O. perating. Systems: Internals and Design Principles”, . 8/E . William Stallings (Chapter . 5). . Sistemi di Calcolo (II semestre) – Roberto Baldoni. Multiple Processes. Median of a Triangle. A line segment connecting a vertex of a triangle to the midpoint of the opposite side. On a piece of graph paper, graph the triangle with vertices A(2, 1) B(5, 8) C(8, 3). . Find the midpoint of each side and label the midpoint opposite A “D”, opposite B “E”, opposite C “F”. . Concurrency Topics. 1. Sequential programming notation. 2. Expressing concurrency with . co. and . process. . 3. States and hardware. 4. Atomic actions. 5. Inter-leavings and histories. 6. The finite progress assumption. Database System Implementation CSE 507. Some slides adapted from . Navathe. et. Al. and . Silberchatz. et. Al. . Transaction Concept. A . transaction. . is a . unit . of program execution that accesses and possibly updates various data items.. in SDD-1. Philip A. Bernstein. Microsoft Research. SDD-1. A DARPA-funded research project at Computer Corporation of America (Cambridge, MA) to build a distributed database system. Started in the fall of 1976. Introduction. Concurrency control protocols. Set of rules to guarantee serializability. Two-phase locking protocols. Lock data items to prevent concurrent access. Timestamp. Unique identifier for each transaction. for Transactions. Part One. CSEP 545 Transaction Processing. Philip A. Bernstein. Copyright ©2012 Philip A. Bernstein. 1/11/2012. 2. Outline. 1. A Simple System Model. 2. Serializability Theory. 3. Synchronization Requirements . Sadhna Kumari. OUTLINE. ACID Properties. 2-Phase Commit Protocol. TPS. Serializability. Concurrency Control Protocols. Current Research. Future. References. ACID PROPERTIES. Atomicity: . A . transaction is . CSc. 8320: Advanced Operating Systems. Hari Uday. Part 1: Basic Knowledge. Originally Developed for Databases, but can be applied to Distributed File management systems. Motivation is to make use of clean and powerful atomic transactions semantics [ACID]. Software & the Concurrency Revolution by Sutter & Larus ACM Queue Magazine, Sept. 2005 For CMPS 5433 - Halverson 1 In a Nutshell “The concurrency revolution is primarily a software revolution Some slides adapted from . Navathe. et. Al. , . Silberchatz. et. Al and . Hector Garcia-Molina . Lock Based Protocols. A lock is a mechanism to control concurrent access to a data item. Data items can be locked in two modes :.