Locks with ordered sharing: Difference between revisions

Content deleted Content added
m References: ISSN using AWB
References: WP:CHECKWIKI article had a list, where one line had a break (<br />) at the end of the line. Done to improve accessibility, see MOS:LISTGAP
 
(6 intermediate revisions by 4 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]].
 
==ReferencesSee also==
* [[Autonomic computing]]
 
==References==
* D. Agrawal, A. El Abbadi, A. E. Lang: [httphttps://portaldl.acm.org/citationdoi/10.cfm?id=627615 1109/69.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.
 
[[Category:Data management]]