lecture11-ConcurrencyControl.ppt

Concurrency Control T1 T2 … Tn Example: T1: Read(A) T2: Read(A) A ? A+100 A ? A?2 Write(A) Write(A) Read(B) Read(B) B ? B+100 B ? B?2 Write(B) Write(B) Correctness depends on scheduling of transactions A schedule - Chronological (possibly interleaving) order in which actions of transactions are executed - A correct schedule is equivalent to executing transactions one-at-a-time in some order Schedule A T1 T2 Read(A); A ? A+100; Write(A); Read(B); B ? B+100; Write(B); Read(A);A ? A?2; Write(A); Read(B);B ? B?2; Write(B); Schedule B T1