Locks with ordered sharing

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

In databases and transaction processing the term Locks with ordered sharing comprises several variants of the Two phase locking (2PL) concurrency control protocol generated by changing the blocking semantics of locks upon conflicts. One variant is identical to Strict commitment ordering (SCO).

References[edit]

  • D. Agrawal, A. El Abbadi, A. E. Lang: The Performance of Protocols Based on Locks with Ordered Sharing, IEEE Transactions on Knowledge and Data Engineering, Volume 6, Issue 5, October 1994, PP. 805 – 818, ISSN 1041-4347