and 2 others joined a min ago.
1
7.9kviews
Explain the basic timestamp ordering algorithm
1 Answer
1
257views
written 7.3 years ago by
teamques10
★ 65k
|
• Whenever some transaction T tries to issue a read_item(X) or a write_item(X) operation, the basic TO algorithm compares the timestamp of T with read_TS(X) and write_TS(X) to ensure that the timestamp order of transaction execution is not violated.
• The concurrency control algorithm must check whether conflicting operations violate …
ADD COMMENT
EDIT
Please log in to add an answer.