Skip to main content

Multi-granularity locking for nested transaction systems

  • Storage And Organization
  • Conference paper
  • First Online:
MFDBS 91 (MFDBS 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 495))

Included in the following conference series:

  • 145 Accesses

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Aspnes, A. Fekete, N. Lynch, M. Merritt, and W. Weihl. A theory of timestamp-based concurrency control for nested transactions. In Proceedings of 14th International Conference on Very Large Data Bases, pages 431–444, August 1988.

    Google Scholar 

  2. P. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987.

    Google Scholar 

  3. A. Fekete, N. Lynch, M. Merritt, and W. Weihl. Commutativity-based locking for nested transactions. Journal of Computer and System Sciences, 41(1):65–156, August 1990.

    Google Scholar 

  4. K. Goldman and N. Lynch. Nested transactions and quorum consensus. In Proceedings of 6th ACM Symposium on Principles of Distributed Computation, pages 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 

  5. J. Gray, R. Lorie, G. Putzolu, and I. Traiger. Granularity of Locks and Degrees of Consistency in a Shared Data Base In Modeling in Database Management Systems (G. Nijssen, ed), 1976.

    Google Scholar 

  6. M. Herlihy, N. Lynch, M. Merritt, and W. Weihl. On the correctness of orphan elimination algorithms. In Proceedings of 17th IEEE Symposium on Fault-Tolerant Computing, pages 8–13, 1987. To appear in Journal of the ACM.

    Google Scholar 

  7. B. Liskov. Distributed computing in Argus. Communications of the ACM, 31(3):300–312, March 1988.

    Google Scholar 

  8. J. K. Lee, and A. Fekete. Proof of A Concurrency Control Algorithm Using a Possibilities Mapping In Proceedings of Australian Database Research Conference, February 1990. Also, Technical Report 352, Basser Department of Computer Science, University of Sydney, July 1989.

    Google Scholar 

  9. J.E.B. Moss. Nested Transactions: An Approach to Reliable Distributed Computing. PhD 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.

    Google Scholar 

  10. A. Spector and K. Swedlow. Guide to the Camelot distributed transaction facility: Release 1, October 1987. Available from Carnegie Mellon University, Pittsburgh, PA.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Bernhard Thalheim János Demetrovics H. -D. Gerhardt

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, J.K., Fekete, A. (1991). Multi-granularity locking for nested transaction systems. In: Thalheim, B., Demetrovics, J., Gerhardt, H.D. (eds) MFDBS 91. MFDBS 1991. Lecture Notes in Computer Science, vol 495. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54009-1_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-54009-1_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54009-0

  • Online ISBN: 978-3-540-47348-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics