Validation‐based concurrency control always requires buffering all writes until commit time.
The following question is about visualisation.
The data shows calories of a selection of chocolate bars, 100g equivalents. Which of the following statements are true?
Which of the following scheduling graphs indicates a cycle (and thus non‐serializable schedule)?
Consider two transactions T1 and T2 with timestamps TS(T1)=5 and TS(T2)=10 and the following schedule:
T1. | T2--------------+------------- write(A) | | read(A)
Under the basic timestamp ordering protocol, what happens?