Locks with ordered sharing: Difference between revisions

Revision as of 22:07, 12 January 2009

Revision as of 22:36, 12 January 2009

Line 1:

In [[databases]] and [[transaction processing]] '''Locks with ordered sharing''' comprisescomprise enhancements of the ''[[Two phase locking]]'' (2PL) [[concurrency control]] protocol by changing the locking semantics upon [[Serializability#View and conflict serializability|conflicts]]. In many situationsituations such changes provide performance improvements over 2PL.

==References==

*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]]

[[Category:Databases]]

[[Category:Concurrency control]]

[[Category:Transaction processing]]