Jump to content

Locks with ordered sharing

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Comps (talk | contribs) at 22:36, 12 January 2009 (stub; categories). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In databases and transaction processing Locks with ordered sharing comprise enhancements of the Two phase locking (2PL) concurrency control protocol by changing the locking semantics upon conflicts. In many situations such changes provide performance improvements over 2PL.

References

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

This database-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Locks_with_ordered_sharing&oldid=263681717"

Hidden category:

All stub articles