|Title:||The Virtues of Locking by Sxmbolic Names
|Abstract:||We Propose an algorithm for improving the concurrency of two phase locked transaction systems, which use symbolic-name locking. The algorithm determines by preanalysis which entities can be unlocked before all locks have been obtained, without compromising serilalizability. This extends tile work we published in , in three ways. First, the transactions are not restricted to exclusive locks, and may use shared locks as well. Second, a method is proposed to prevent the potential problem of cascading restarts, which results from unlocking of entities before commitment. Third, the transactions may be designed for a distributed database.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1986/CS/CS0416), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1986
To the main CS technical reports page
Computer science department, Technion