So, the task is to prove the following: If S is a schedule containing at most one write action, then S is conflict-serializable. The answer is yes, but I disagree, because the following schedule contains at most one write action, and is not conflict-serializable: R1(A), R2(A), W2(A), R1(A). Am I completely wrong? Or is theRead more
Blog
Satisfaction guarantee
Best Proxy Packs
-
2,000 Private Proxies
$299.00 / month
-
1,000 Private Proxies
$179.00 / month
Like And Follow Us
