Concurrency Control Using Timestamp Ordering
Main idea: insure that conflicting operations occur in timestamp order
Each item X must have a read TS and a write TS
- = TS's of the T which last read or wrote X
If T wants to use X, then X's TSs are checked. For a conflicting operation, TS(T) must be later. If not, T is aborted and restarted with a new (later) TS.