Jump to content

Locks with ordered sharing

Add links
From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Dr vulpes (talk | contribs) at 04:07, 1 September 2024 (→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). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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. Further softening of locks eliminates thrashing.

See also

[edit]

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
  • Mahmoud, H. A., Arora, V., Nawab, F., Agrawal, D., & El Abbadi, A. (2014). Maat: Effective and scalable coordination of distributed transactions in the cloud. Proceedings of the VLDB Endowment, 7(5), 329-340.


Stub icon

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=1243382170"