Give an example of a schedule in which a pessimistic concurrency control makes a transaction wait but then allows it to commit, while an optimistic concurrency control allows the transaction to commit without waiting.
What will be an ideal response?
The following schedule would be accepted by an optimistic control.
r1(x) r2(y) w1(z ) w2(z ) commit1 commit2
A pessimistic control would force the operation w2(z ) to wait.
Computer Science & Information Technology
You might also like to view...
What is the output of the following statement? cout << strspn("Cows like to moo.'', "Ceik losw");
a. Nothing. b. 10. c. 8. d. e.
Computer Science & Information Technology
You are reading a report that shows Company A generated $2,000 last week. This would be ________
A) knowledge B) a competitive advantage C) data D) information
Computer Science & Information Technology
Each method that each object can use is an ____ method.
A. invoke B. instance C. enabled D. included
Computer Science & Information Technology
Which of the following is not an aggregate function that can be applied in a total row?
What will be an ideal response?
Computer Science & Information Technology