{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,17]],"date-time":"2026-10-17T19:33:18Z","timestamp":1792265598842,"version":"4.4.0"},"reference-count":14,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[1981,6,1]],"date-time":"1981-06-01T00:00:00Z","timestamp":360201600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Database Syst."],"published-print":{"date-parts":[[1981,6]]},"abstract":"<jats:p>Most current approaches to concurrency control in database systems rely on locking of data objects as a control mechanism. In this paper, two families of nonlocking concurrency controls are presented. The methods used are \u201coptimistic\u201d in the sense that they rely mainly on transaction backup as a control mechanism, \u201choping\u201d that conflicts between transactions will not occur. Applications for which these methods should be more efficient than locking are discussed.<\/jats:p>","DOI":"10.1145\/319566.319567","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T11:29:00Z","timestamp":1027769340000},"page":"213-226","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":963,"title":["On optimistic methods for concurrency control"],"prefix":"10.1145","volume":"6","author":[{"given":"H. T.","family":"Kung","sequence":"first","affiliation":[{"name":"Carnegie-Mellon Univ., Pittsburgh, PA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"John T.","family":"Robinson","sequence":"additional","affiliation":[{"name":"Carnegie-Mellon Univ., Pittsburgh, PA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[1981,6]]},"reference":[{"key":"e_1_2_1_1_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288683"},{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00263762"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289064"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/360363.360369"},{"key":"e_1_2_1_5_2","series-title":"Lecture Notes in Computer Science 60: Operating Systems","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/3-540-08755-9_9","volume-title":"Notes on database operating systems","author":"GRAY J.","year":"1978","unstructured":"GRAY , J. Notes on database operating systems . In Lecture Notes in Computer Science 60: Operating Systems , R. Bayer, R. M. Graham, and G. Seegmuller, Eds. Springer-Verlag , Berlin , 1978 , pp. 393 - 481 . GRAY, J. Notes on database operating systems. In Lecture Notes in Computer Science 60: Operating Systems, R. Bayer, R. M. Graham, and G. Seegmuller, Eds. Springer-Verlag, Berlin, 1978, pp. 393-481."},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/320613.320619"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/582095.582114"},{"key":"e_1_2_1_9_2","unstructured":"LEHMAN P. L. AND YAO S.B. Efficient locking for concurrent operations on B-trees. Submitted for publication.  LEHMAN P. L. AND YAO S.B. Efficient locking for concurrent operations on B-trees. Submitted for publication."},{"key":"e_1_2_1_10_2","volume-title":"Proc. Conf. Information Sciences and Systems","author":"MILLER R. E.","year":"1978","unstructured":"MILLER , R. E. , AND SNYDER , L. Multiple access to B-trees . Presented at Proc. Conf. Information Sciences and Systems , Johns Hopkins Univ., Baltimore, Md., Max. 1978 . MILLER, R. E., AND SNYDER, L. Multiple access to B-trees. Presented at Proc. Conf. Information Sciences and Systems, Johns Hopkins Univ., Baltimore, Md., Max. 1978."},{"key":"e_1_2_1_11_2","first-page":"275","volume-title":"Conf Theoretical Computer Science","author":"PAPADIMITRIOU C. H.","year":"1977","unstructured":"PAPADIMITRIOU , C. H. , BERNSTEIN , P. A. , AND ROTHNIE , J.B. Computational problems related to database concurrency control . In Conf Theoretical Computer Science , Univ. Waterloo , 1977 , pp. 275 - 282 . PAPADIMITRIOU, C. H., BERNSTEIN, P. A., AND ROTHNIE, J.B. Computational problems related to database concurrency control. In Conf Theoretical Computer Science, Univ. Waterloo, 1977, pp. 275-282."},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/322154.322158"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(76)90005-3"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1976.12"},{"key":"e_1_2_1_15_2","first-page":"9","volume":"2","author":"YA","year":"1978","unstructured":"YA o, A. On random 2-3 trees. Acta Inf. 2 , 9 ( 1978 ), 159-170. YAo, A. On random 2-3 trees. Acta Inf. 2, 9 (1978), 159-170.","journal-title":"Acta Inf."}],"container-title":["ACM Transactions on Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/319566.319567","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/319566.319567","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:26:35Z","timestamp":1750213595000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/319566.319567"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,6]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1981,6]]}},"alternative-id":["10.1145\/319566.319567"],"URL":"https:\/\/doi.org\/10.1145\/319566.319567","relation":{},"ISSN":["0362-5915","1557-4644"],"issn-type":[{"value":"0362-5915","type":"print"},{"value":"1557-4644","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,6]]},"assertion":[{"value":"1981-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}