Consider the following interleaving of transactions t

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: provides two operations for its clients: (1) read(i) returns the value of ai; and (2) write(i; value) assigns “value” to ai. Consider the following interleaving of transactions T, U, and V: Time 1 2 3 4 5 6 7 8 9 10 T openTransaction y=read(k); U openTransaction x=read(k); write(i,55); write(j,66); commit; V openTransaction write(i,77); x=read(i); write(k,44); write(k,88); (a) (strict 2‐phase locking) Suppose the strict 2‐phase locking mechanism is used for concurrency control. Answer the following questions: (i) (ii) (iii) (iv) Does U have to wait to acquire the lock for x =read(k)? Does V have to wait to a...
View Full Document

This document was uploaded on 11/11/2013.

Ask a homework question - tutors are online