Locks with ordered sharing: Difference between revisions

Revision as of 15:05, 5 August 2012

Latest revision as of 04:07, 1 September 2024

(9 intermediate revisions by 6 users not shown)

Line 1:

In [[databasesdatabase]]s and [[transaction processing]] the term '''Locks with ordered sharing''' comprises several variants of the ''[[Two two-phase locking]]'' (2PL) [[concurrency control]] protocol generated by changing the blocking semantics of locks upon [[Serializability#View and conflict serializability|conflicts]]. One variant is identical toFurther ''[[CommitmentGraceful ordering#Strictexit|softening]]'' COof (SCO)|Strictlocks commitmenteliminates ordering[[Thrashing (SCOcomputer science)|thrashing]].

==See also==

* [[Autonomic computing]]

==References==

* D. Agrawal, A. El Abbadi, A. E. Lang: [httphttps://portaldl.acm.org/citationdoi/10.1109/69.cfm?id=627615 317708 ''The Performance of Protocols Based on Locks with Ordered Sharing''], IEEE Transactions on Knowledge and Data Engineering, Volume 6, Issue 5, October 1994, PPpp. 805 - 818805–818, {{ISSN:|1041-4347}}

* Mahmoud, H. A., Arora, V., Nawab, F., Agrawal, D., & El Abbadi, A. (2014). [http://www.vldb.org/pvldb/vol7/p329-mahmoud.pdf Maat: Effective and scalable coordination of distributed transactions in the cloud.] ''Proceedings of the VLDB Endowment'', ''7''(5), 329-340.

*D. Agrawal, A. El Abbadi, A. E. Lang: [http://portal.acm.org/citation.cfm?id=627615 ''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

{{database-stub}}

[[Category:Data management]]

Line 11 ⟶ 12:

[[Category:Concurrency control]]

[[Category:Transaction processing]]

{{database-stub}}