edited by
265 views
0 votes
0 votes

In a databse system, let TS(T1) and TS(T2) be the timestamps of transactions T1 and T2 respectively. W-t(X) denotes the largest timestamp of any transaction that executed write(X) successfully and R-t(X) denotes the largest timestamp of any transaction that executed read(X) successfully. Which of the following is False?

  1.  If transaction T₁ issues read(X) operation and TS(T) < W-t(X) then T₁ is rolled back.
  2. If transaction T₁ issues read(X) operation and TS(T₁)> W-t(X) then write operation is executed.
  3. If transaction T₁ issues write(X) operation and TS(T₁) < W-t(X) then T₁ is rolled back
  4. All of the above.

PS: Ans given as B

edited by

Please log in or register to answer this question.

Related questions

452
views
1 answers
0 votes
Shukrayani asked Oct 31, 2018
452 views
Let a schedule be strict recoverable schedule then it will suffer from which problem? 1.ww2.rw3.wr4.lost update
535
views
2 answers
0 votes
239
views
0 answers
0 votes
Shrenik Pradhan asked Nov 16, 2023
239 views
How can I represent the ER model in tabular form? , in java point, the tabular form doesn't seem to be correct.Ref. https://www.javatpoint.com/dbms-reduction-of-er-diagram-into-table
580
views
0 answers
0 votes
Sahil_Lather asked Jan 29, 2023
580 views
In a B+ Tree index having order 6, which is the maximum number of child pointers it can have. Keys are numbered from 1 to 83. What can be the maximum number of nodes which can be used to store all the keys?A. 17B. 19C. 59D. 57