Skip to main content
SpringerLink
Log in

Multi-granularity locking for nested transactions

A proof using a possibilities mapping

  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

The choice of granularity for locking items in a database involves performance trade-offs. In order to provide a choice between different locking granularities within a single system, the two-phase locking algorithm needs to be modified to include intention locks. This paper extends the well-known multigranularity locking algorithm of Gray et al. to deal with nested transactions, and verifies the correctness of the extended algorithm, using a possibilities mapping to abstract commutativity-based locking.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aspnes, J., Fekete, A., Lynch, N., Merritt, M., Weihl, W.: A theory of timestamp-based concurrency control for nested transactions. In Proc 14th Int Conf on very large data bases, pages 431–444, August 1988

  2. Bernstein, P., Hadzilacos, V., Goodman, N.: Concurrency control and recovery in database systems. Reading: Addison-Wesley 1987

    Google Scholar 

  3. Eppinger, J., Mummert, L., Spector, A.: Camelot and avalon: a distributed transaction facility. Los Altos: Morgan Kaufmann 1991

    Google Scholar 

  4. Fekete, A., Lynch, N., Merritt, M., Weihl, W.: Commutativity-based locking for nested transactions. J. Comput. System Sci. 41, 65–156 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  5. Goldman, K., Lynch, N.: Nested transactions and quorum consensus. In Proc. 6th ACM Symp. on Principles of Distributed Computation, pp. 27–41, August 1987. Expanded version is available as Technical Report MIT/LCS/TM-390, Laboratory for Computer Science, Massachusetts Institute Technology, Cambridge, MA, May 1987

    Google Scholar 

  6. Gray, J., Lorie, R., Putzolu, G., Traiger, I.: Granularity of locks and degrees of consistency in a shared data base. In: Modeling in database management systems (G. Nijssen, ed.) 1976

  7. Herlihy, M., Lynch, N., Merritt, M., Weihl, W.: On the correctness of orphan elimination algorithms. J. ACM 39, 881–930 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  8. Liskov, B.: Distributed computing in Argus. Commun. ACM 31, 300–312 (1988)

    Article  Google Scholar 

  9. Lee, J.K., Fekete, A.: Proof of a concurrency control algorithm using a possibilities mapping. In: Proc. Australian database research conf. pp. 185–194, February 1990

  10. Lee, J.K., Fekete, A.: Multi-granularity locking for nested transaction systems. In: ed. B. Thalheim Proc MFDBS’91, (Lect. Notes Computer Science, Vol. 495, pp. 160–172) Berlin: Springer

  11. Lynch, N., Tuttle, M.: Hierarchical correctness proofs for distributed algorithms. In: Proc. 6th ACM Symp. on principles of distributed computation, pp. 137–151, 1987

  12. Moss, J.E.B.: Nested transactions: An approach to reliable distributed computing. Ph.D. Thesis, Massachusetts Institute Technology, 1981. Technical Report MIT/LCS/TR-260, Laboratory for Computer Science, Massachusetts Institute Technology, April 1981. Also, published by MIT Press, March 1985

  13. Weihl, W.: Local atomicity properties: modular concurrency control for abstract data types, ACM Trans. Programming Languages Systems 11, 249–282 (1989)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Systems, Queensland University of Technology, 2 George Street, Brisbane, Australia

    John Lee

  2. Basser Department of Computer Science, The University of Sydney, Australia

    Alan Fekete

Authors
  1. John Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alan Fekete
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lee, J., Fekete, A. Multi-granularity locking for nested transactions. Acta Informatica 33, 131–152 (1996). https://doi.org/10.1007/s002360050038

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002360050038

Keywords

Search

Navigation