Computer Science: An Overview (12th Edition)
12th Edition
ISBN: 9780133760064
Author: Glenn Brookshear, Dennis Brylow
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 9, Problem 45CRP
Program Plan Intro
Wound wait protocol:
In this protocol, an older transaction is given priority.
- If older requires access to an item that is locked by a younger transaction, the younger transaction is forced to release all of its data items, and its activities are rolled back.
- The older transaction is given access to the item it required, and the younger transaction is forced to start again.
- If a younger transaction is repeatedly rolled back, it grows older in the process and ultimately become one of the older transactions with high priority.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
The snapshot isolation protocol uses a validation step which, before performinga write of a data item by transaction T, checks if a transaction concurrentwith T has already written the data item.a. A straightforward implementation uses a start timestamp and a committimestamp for each transaction, in addition to an update set, that, is theset of data items updated by the transaction. Explain how to performvalidation for the first-committer-wins scheme by using the transactiontimestamps along with the update sets. You may assume that validationand other commit processing steps are executed serially, that is, for onetransaction at a time,b. Explain how the validation step can be implemented as part of commitprocessing for the first-committer-wins scheme, using a modification ofthe above scheme, where instead of using update sets, each data itemhas a write timestamp associated with it. Again, you may assume thatvalidation and other commit processing steps are executed serially.c. The…
How is the "two-phase commit" protocol beneficial in a transactional context?
The first rule in the basic timestamping protocol for concurrency control is:
If transaction T asks to read the variable P, check for any younger transaction’s write.
If WriteTimestamp(P) > TimeStamp(T), then T is late to read (the value of P it needs is already overwritten, will be inconsistent read)
Explain why this rule states that the value of P that this transaction needs is already overwritten.
Chapter 9 Solutions
Computer Science: An Overview (12th Edition)
Ch. 9.1 - Identify two departments in a manufacturing plant...Ch. 9.1 - Prob. 2QECh. 9.1 - Summarize the roles of the application software...Ch. 9.2 - Prob. 1QECh. 9.2 - Prob. 2QECh. 9.2 - Prob. 4QECh. 9.2 - Prob. 5QECh. 9.2 - Prob. 6QECh. 9.3 - Prob. 1QECh. 9.3 - What is a persistent object?
Ch. 9.3 - Identify some classes as well as some of their...Ch. 9.3 - Prob. 4QECh. 9.4 - Prob. 1QECh. 9.4 - Prob. 2QECh. 9.4 - Prob. 3QECh. 9.4 - Prob. 4QECh. 9.4 - Prob. 5QECh. 9.4 - Prob. 6QECh. 9.5 - Prob. 1QECh. 9.5 - Prob. 2QECh. 9.5 - Prob. 3QECh. 9.5 - Prob. 4QECh. 9.5 - Prob. 5QECh. 9.5 - Prob. 6QECh. 9.5 - Prob. 7QECh. 9.6 - Prob. 1QECh. 9.6 - Give an additional example of a pattern that might...Ch. 9.6 - Prob. 3QECh. 9.6 - How does data mining differ from traditional...Ch. 9.7 - Prob. 1QECh. 9.7 - Prob. 2QECh. 9.7 - Prob. 3QECh. 9.7 - Prob. 4QECh. 9 - Prob. 1CRPCh. 9 - Prob. 2CRPCh. 9 - Prob. 3CRPCh. 9 - Prob. 4CRPCh. 9 - Prob. 5CRPCh. 9 - Prob. 6CRPCh. 9 - Prob. 7CRPCh. 9 - Prob. 8CRPCh. 9 - Prob. 9CRPCh. 9 - Prob. 10CRPCh. 9 - Prob. 11CRPCh. 9 - Prob. 12CRPCh. 9 - Using the commands SELECT, PROJECT, and JOIN,...Ch. 9 - Answer Problem 13 using SQL. PROBLEM 13 13. Using...Ch. 9 - Prob. 15CRPCh. 9 - Prob. 16CRPCh. 9 - Prob. 17CRPCh. 9 - Prob. 18CRPCh. 9 - Prob. 19CRPCh. 9 - Empl Id Name Address SSN Job Id Job Title Skill...Ch. 9 - Empl Id Name Address SSN Job Id Job Title Skill...Ch. 9 - Prob. 22CRPCh. 9 - Prob. 23CRPCh. 9 - Prob. 24CRPCh. 9 - Prob. 25CRPCh. 9 - Write a sequence of instructions (using the...Ch. 9 - Prob. 27CRPCh. 9 - Prob. 28CRPCh. 9 - Prob. 29CRPCh. 9 - Prob. 30CRPCh. 9 - Prob. 31CRPCh. 9 - Prob. 32CRPCh. 9 - Prob. 33CRPCh. 9 - Prob. 34CRPCh. 9 - Prob. 35CRPCh. 9 - Prob. 36CRPCh. 9 - Prob. 37CRPCh. 9 - Prob. 38CRPCh. 9 - Prob. 39CRPCh. 9 - Prob. 40CRPCh. 9 - Prob. 41CRPCh. 9 - Prob. 42CRPCh. 9 - Prob. 43CRPCh. 9 - Prob. 44CRPCh. 9 - Prob. 45CRPCh. 9 - Prob. 46CRPCh. 9 - Prob. 47CRPCh. 9 - Prob. 48CRPCh. 9 - Prob. 49CRPCh. 9 - Prob. 50CRPCh. 9 - Prob. 51CRPCh. 9 - Prob. 52CRPCh. 9 - Prob. 53CRPCh. 9 - Prob. 54CRPCh. 9 - Prob. 55CRPCh. 9 - Prob. 56CRPCh. 9 - Prob. 57CRPCh. 9 - Prob. 58CRPCh. 9 - Prob. 59CRPCh. 9 - Prob. 60CRPCh. 9 - Prob. 61CRPCh. 9 - Prob. 62CRPCh. 9 - Prob. 1SICh. 9 - Prob. 2SICh. 9 - Prob. 3SICh. 9 - Prob. 4SICh. 9 - Prob. 5SICh. 9 - Prob. 6SICh. 9 - Prob. 7SICh. 9 - Prob. 8SICh. 9 - Prob. 9SICh. 9 - Prob. 10SI
Knowledge Booster
Similar questions
- Draw a wait-for-graph for detecting a for deadlock cycle in the given transactions T1 and T2 considering (Read-Write) or (Write-Read) conflicting parameters.arrow_forwardThe transactions below are supposed to have a write-read conflict (dirty reads). But I am having a hard time understanding how. T1: R(A), W(A), R(B), W(B), Abort T2: R(A), W(A), C The way I understand this is that transaction 1 (T1) reads A and then writes A. Then transaction 2 reads A and then writes A. Finally, transaction 1 reads B and then writes B. I don't see how this creates a write-read conflict. Can someone explain how this is the case?arrow_forwardW-timestamp(Q) is the biggest timestamp of any transaction that successfully completed write(Q). Instead, let's say we specified it as the timestamp of the most recent transaction that successfully executed write(Q). Is it possible that this adjustment in language will make a difference? Explain your response.arrow_forward
- Under what circumstances does the wait-die scheme perform better than the wound-wait scheme for granting resources to concurrently executing transactions?arrow_forwardShow that there are schedules that are possible under the two-phase locking protocol but not possible under the timestamp protocol, and vice versaarrow_forwardGiven the following transactions (with basic operations r - read, w - write, a - abort, c - commit, data sets X, Y, Z) T1 = w1 (X), c1 Т2 %3 12 (Y), г2 (Z), r2 (X), с2 T3 = w3 (Y), w3 (Z), c3 T4 %3D г4 (X), г4 (Y), с4 Create a serializable history with the help of locks (2 PL protocol) or by skilfully arranging the basic operations, if possible.arrow_forward
- Consider what would happen if there was a problem with 2PC for a transaction. In Exercise 23.2a, you wrote down a list of things that could go wrong. For each one, explain how 2PC keeps transactions atomic even if one of them goes wrong.arrow_forwardCheck the given schedule for serializability: T1 T2 T3 T4 R(X) W(X) Commit W(X) Commit W(Y) R(Z) Commit R(X) R(Y) Commit All the methods for checking the serializability should be discussed with well drawn schedules and diagrams, if any.arrow_forwardConsider the following two transactions: T1 = R(A). W(A), R(B), R(C) T2 - W(C). R(B), R(A). W(B) Say that sharing lock, exclusive lock, and unlock actions are inserted by the scheduler, resulting in the following annotated transactions: T1 - X(A), R(A), W(A), S(B), R(B), S(C), U(A), R(C), U(B), S(C) T2 - X(C), W(C), X(B), S(A), U(C), R(B), R(A), U(A), W(B), U(B) The above schedule follows 2 PL so conflict serializability is guaranteed. O True O Falsearrow_forward
- Consider the following two transactions: T1-R(B), W(B), R(C), R(A) T2-R(B). W(B) Say that sharing lock, exclusive lock, and unlock actions are inserted by the scheduler, resulting in the following annotated transactions: T1= X(B), R(B), W(B), S(C), R(C), S(A), U(B), R(A), U(C), U(A) T2-X(B), R(B), W(B), U(B) Cascading rollback is not possible for the above schedule. True Falsearrow_forwardDraw the overall diagram of Secure Hash Algorithm-1 (SHA-1) and explain the process of generating the message digest using SHA-1.arrow_forward11. The deadlock in a set of transaction can be determined by a. Read-only graph b. Wait graph c. Wait-for graph d. All of the mentionedarrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education