{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:56:36Z","timestamp":1742932596302,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031007453"},{"type":"electronic","value":"9783031018732"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-031-01873-2_13","type":"book-chapter","created":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T05:15:24Z","timestamp":1654751724000},"page":"369-381","source":"Crossref","is-referenced-by-count":0,"title":["The End of Optimistic Concurrency Control"],"prefix":"10.1007","author":[{"given":"Goetz","family":"Graefe","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Berenson, H., Bernstein, P. A., Gray, J., Melton, J., O\u2019Neil, E. J., and O\u2019Neil, P. A. (1995). A critique of ANSI SQL isolation levels. ACM SIGMOD, pages 1-10. 10.1145\/223784.223785. 373","DOI":"10.1145\/568271.223785"},{"issue":"4","key":"13_CR2","first-page":"338","volume":"4","author":"MJ Carey","year":"1986","unstructured":"Carey, M. J. and Muhanna, W. A. (1986). The performance of multi-version concurrency control algorithms. ACM TODS, 4(4), pages 338-378. 10.1145\/6513.6517. 370, 372","journal-title":"ACM TODS,"},{"key":"13_CR3","unstructured":"Carey, M. J. and Stonebraker, M. (1984). The performance of concurrency control algorithms for database management systems. VLDB, pages 107-118. 370, 372"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Chan, A., Fox, S., Lin, W.-T. K., Nori, A., and Ries, D. R. (1982). The implementation of an integrated concurrency control and recovery scheme. SIGMOD, pages 184-191. 10.1145\/582383.582386. 373, 379","DOI":"10.1145\/582353.582386"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"DeWitt, D. J., Katz, R. H., Olken, F., Shapiro, L. D., Stonebraker, M., and Wood, D. A. (1984). Implementation techniques for main memory database systems. ACM SIGMOD, pages 1-8. 10.1145\/602260.602261. 371, 374","DOI":"10.1145\/971697.602261"},{"key":"13_CR6","unstructured":"Graefe, G. (2007). Hierarchical locking in B-tree indexes. BTW, pages 18-42 (Chapter 2). 379"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Graefe, G. (2010). A survey of B-tree locking techniques. ACM TODS, 35(3) (Chapter 1). 10.1145\/1806907.1806908. 374","DOI":"10.1145\/1806907.1806908"},{"key":"13_CR8","unstructured":"Graefe, G. (2016). Revisiting optimistic and pessimistic concurrency control. Hewlett Packard Labs Technical Report HPE-2016-47, May. 372"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Graefe, G., Lillibridge, M., Kuno, H. A., Tucek, J., and Veitch, A. C. (2013). Controlled lock violation. ACM SIGMOD, pages 85-96 (Chapter 4). 10.1145\/2463676.2465325. 374, 375, 379","DOI":"10.1145\/2463676.2465325"},{"key":"13_CR10","unstructured":"Graefe, G. and Kimura, H. (2015). Orthogonal key-value locking. BTW, pages 237-256 (Chapter 5). 379"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Graefe, G. and Zwilling, M. J. (2004). Transaction support for indexed views. ACM SIGMOD, pages 323-334 (Chapter 3). 10.1145\/1007568.1007606. 379","DOI":"10.1145\/1007568.1007606"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Gray, J., Lorie, R. A., Putzolu, G. R., and Traiger, I. L. (1975). Granularity oflocks in a large shared data base. VLDB, pages 428-451. 10.1145\/1282480.1282513. 376","DOI":"10.1145\/1282480.1282513"},{"key":"13_CR13","unstructured":"Gray, J., Lorie, R. A., Putzolu, G. R., and Traiger, I. L. (1976). Granularity oflocks and degrees of consistency in a shared data base. IFIP Working Conference on Modelling in Data Base Management Systems, pages 365-394. 369"},{"issue":"2","key":"13_CR14","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0306-4379(84)90020-6","volume":"9","author":"T H\u00e4rder","year":"1984","unstructured":"H\u00e4rder, T. (1984). Observations on optimistic concurrency control schemes. Information Systems, 9(2), pages 111-120. 10.1016\/0306-4379(84)90020-6. 369, 371, 372","journal-title":"Information Systems,"},{"issue":"1","key":"13_CR15","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1145\/322358.322363.","volume":"30","author":"HF Korth","year":"1983","unstructured":"Korth, H. F. (1983). Locking primitives in a database system. Journal of the ACM, 30(1), pages 55-79. 10.1145\/322358.322363. 376, 379","journal-title":"Journal of the ACM,"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Kung, H. T. and Papadimitriou, C. H. (1979). An optimality theory of concurrency control for databases. ACM SIGMOD, pages 116-126. 10.1145\/582095.582114. 370","DOI":"10.1145\/582095.582114"},{"issue":"2","key":"13_CR17","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1145\/319566.319567","volume":"6","author":"HT Kung","year":"1981","unstructured":"Kung, H. T. and Robinson, J. T. (1981). On optimistic methods for concurrency control. ACM TODS, 6(2), pages 213-226. 10.1145\/319566.319567. 369, 370","journal-title":"ACM TODS,"},{"key":"13_CR18","unstructured":"Lomet, D. B. (1993). Key range locking strategies for improved concurrency. VLDB, pages 655664. 379"},{"key":"13_CR19","unstructured":"Mohan, C. (1990). ARIES\/KVL: A key-value locking method for concurrency control of mul-tiaction transactions operating on B-tree indexes. VLDB, pages 392-405. 379"},{"key":"13_CR20","doi-asserted-by":"publisher","unstructured":"Mohan, C. (1994). Less optimism about optimistic concurrency control. RIDE-TQP, pages 199-204. https:\/\/doi.org\/10.1109\/ride.1992.227405. 372","DOI":"10.1109\/ride.1992.227405"},{"issue":"1","key":"13_CR21","first-page":"94","volume":"17","author":"C Mohan","year":"1992","unstructured":"Mohan, C., Haderle, D. J., Lindsay, B. G., Pirahesh, H., and Schwarz, P. M. (1992). ARIES: A transaction recovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging. ACMTODS, 17(1), pages 94-162. 10.1145\/128765.128770. 374","journal-title":"ACMTODS,"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Mohan, C. and Levine, F. E. (1992). ARIES\/IM: An efficient and high concurrency index management method using write-ahead logging. ACM SIGMOD, pages 371-380. 10.1145\/130283.130338. 379","DOI":"10.1145\/141484.130338"},{"issue":"4","key":"13_CR23","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1145\/7239.7265","volume":"11","author":"PE O\u2019Neil","year":"1986","unstructured":"O\u2019Neil, P. E. (1986). The Escrow transactional method. ACM TODS, 11(4), pages 405-430. 10.1145\/7239.7265. 376, 379","journal-title":"ACM TODS,"},{"key":"13_CR24","unstructured":"Peinl P. and Reuter, A. (1983). Empirical comparison of database concurrency control schemes. VLDB, pages 97-108. 371"},{"issue":"3","key":"13_CR25","first-page":"421","volume":"9","author":"A Thomasian","year":"1997","unstructured":"Thomasian, A. (1997). A performance comparison of locking methods with limited wait depth. IEEE TKDE, 9(3), pages 421-434. 10.1109\/69.599931. 377","journal-title":"IEEE TKDE,"},{"issue":"2","key":"13_CR26","doi-asserted-by":"publisher","first-page":"S69","DOI":"10.1016\/S0166-5316(98)00025-X","volume":"34","author":"A Thomasian","year":"1998","unstructured":"Thomasian, A. (1998). Performance analysis of locking methods with limited wait depth. Performance Evaluation, 34(2), pages S69-89. 10.1016\/s0166-5316(98)00025-x. 377","journal-title":"Performance Evaluation"}],"container-title":["Synthesis Lectures on Data Management","On Transactional Concurrency Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-01873-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,2]],"date-time":"2022-10-02T18:14:47Z","timestamp":1664734487000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-01873-2_13"}},"subtitle":["Why good locking will always win"],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783031007453","9783031018732"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-01873-2_13","relation":{},"ISSN":["2153-5418","2153-5426"],"issn-type":[{"type":"print","value":"2153-5418"},{"type":"electronic","value":"2153-5426"}],"subject":[],"published":{"date-parts":[[2019]]}}}