186 views
0 votes
0 votes

Find the number of all possible conflict-equivalent schedules to the following serial schedule:

r1(X);w1(Y);w1(Z);r2(X);w2(Y);w2(Z);
where ri(A) means ith transaction reads resource A and wi(A) means ith transaction writes resource A.

1 Answer

Related questions

0 votes
0 votes
1 answer
1
1 votes
1 votes
1 answer
4
Naveen K Verma asked Jan 10, 2018
680 views
Consider the following instance R.A1234BNull122The number of tuples returned by the following SQL query is _____________. select * from R as R1 where not exists (select...