Three different types of consistencies, viz., semiweak, weak, and strong, of a read-only transaction in a schedule s of a set T of transactions are defined and these are compared with the existing notions of consistencies of a read-only transaction in a schedule. We present a technique that enables a user to control the consistency of a read-only transaction in heterogeneous locking protocols. Since the weak consistency of a read-only transaction improves concurrency in heterogeneous locking protocols, the users can help to improve concurrency in heterogeneous locking protocols by supplying the consistency requirements of read-only transactions. A heterogeneous locking protocol P' derived from a locking protocol P that uses exclusive mode locks only and ensures serializability need not be deadlock-free. We present a sufficient condition that ensures the deadlock-freeness of P′, when P is deadlock-free and all the read-only transactions in P′ are two phase.
CITATION STYLE
Hansdah, R. C., & Patnaik, L. M. (1987). Weak consistency of read-only transactions: A tool to improve concurrency in heterogeneous locking protocols. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 287 LNCS, pp. 265–281). Springer Verlag. https://doi.org/10.1007/3-540-18625-5_55
Mendeley helps you to discover research relevant for your work.