3,610 views
2 2 votes
In basic time stamp ordering W-time stamp (Q) denotes the largest time stamp of any transaction that has executed write-(Q) successfully.Suppose that we define W-time stamp(Q) as the most recent transaction to execute Write(Q) successfully.Which is true?

1)both with give same result in all cases

2)both with give same result in few cases

3)both with give different result in all cases

4)both with give different result insome cases

1 Answer

Best answer
1 1 vote

In basic time stamp ordering:
W-time stamp (Q) denotes the largest time stamp of any transaction that has executed write-(Q) successfully.

W-time stamp(Q) as the most recent transaction to execute Write(Q) "successfully"

1) both with give same result in all cases

this is correct option, because successful write operation will always bre done by the younger transaction, and younger transaction always has the larger timestamp than older transactions.

• selected by
Position:
Show:

Related questions

3 3 votes
2 2 answers
834
834 views
NullPointer_Pro asked Dec 24, 2025
834 views
We have a table Orders with a specific predicate range query Q: SELECT * FROM Orders WHERE Value 1000Transaction $T_1$ executes $Q$ and gets 5 rows.Transaction $T_2$ ins...
1 1 vote
1 1 answer
232
232 views
AIDAN_SUTHAR asked Oct 8, 2024
232 views
Suppose we have a transaction T that performs a series of read and write operations, followed by the creation of a savepoint S. After that, it continues with additional t...
0 0 votes
0 0 answers
639
639 views
gatecrack asked Sep 5, 2018
639 views
Consider th following scheduler1(A)r2(B)r3(C)w1(B)w2(C)w3(D)Find the schedule which are possible to execute by strict 2PL protocol? consider commit operation as immediate...
0 0 votes
2 answers 2 answers
1.1k
1.1k views
joshipratik232 asked Aug 16, 2022
1,079 views
Does Conservative 2PL ensures Recoverability ? If Yes then Does it ensures Cascadeless or Strict recoverable schedule ?