{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:40:22Z","timestamp":1742593222951,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540540090"},{"type":"electronic","value":"9783540473480"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54009-1_12","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:21:40Z","timestamp":1330208500000},"page":"160-172","source":"Crossref","is-referenced-by-count":4,"title":["Multi-granularity locking for nested transaction systems"],"prefix":"10.1007","author":[{"given":"J. K.","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Fekete","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"12_CR1","unstructured":"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\u2013444, August 1988."},{"key":"12_CR2","unstructured":"P. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987."},{"issue":"1","key":"12_CR3","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0022-0000(90)90034-I","volume":"41","author":"A. Fekete","year":"1990","unstructured":"A. Fekete, N. Lynch, M. Merritt, and W. Weihl. Commutativity-based locking for nested transactions. Journal of Computer and System Sciences, 41(1):65\u2013156, August 1990.","journal-title":"Journal of Computer and System Sciences"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"K. Goldman and N. Lynch. Nested transactions and quorum consensus. In Proceedings of 6th ACM Symposium on Principles of Distributed Computation, pages 27\u201341, August 1987. Expanded version is available as Technical Report MIT\/LCS\/TM-390, Laboratory for Computer Science, Massachusetts Institute Technology, Cambridge, MA, May 1987.","DOI":"10.1145\/41840.41843"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1145\/1282480.1282513"},{"key":"12_CR6","unstructured":"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\u201313, 1987. To appear in Journal of the ACM."},{"issue":"3","key":"12_CR7","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/42392.42399","volume":"31","author":"B. Liskov","year":"1988","unstructured":"B. Liskov. Distributed computing in Argus. Communications of the ACM, 31(3):300\u2013312, March 1988.","journal-title":"Communications of the ACM"},{"key":"12_CR8","unstructured":"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."},{"key":"12_CR9","unstructured":"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."},{"key":"12_CR10","unstructured":"A. Spector and K. Swedlow. Guide to the Camelot distributed transaction facility: Release 1, October 1987. Available from Carnegie Mellon University, Pittsburgh, PA."}],"container-title":["Lecture Notes in Computer Science","MFDBS 91"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54009-1_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:12:37Z","timestamp":1742591557000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54009-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540540090","9783540473480"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-54009-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}