{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T04:24:36Z","timestamp":1745987076242,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642371332"},{"type":"electronic","value":"9783642371349"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37134-9_6","type":"book-chapter","created":{"date-parts":[[2013,3,18]],"date-time":"2013-03-18T03:39:37Z","timestamp":1363577977000},"page":"71-85","source":"Crossref","is-referenced-by-count":0,"title":["Making Transaction Execution the Bottleneck"],"prefix":"10.1007","author":[{"given":"Harumi","family":"Kuno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Goetz","family":"Graefe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hideaki","family":"Kimura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00263762","volume":"9","author":"R. Bayer","year":"1977","unstructured":"Bayer, R., Schkolnick, M.: Concurrency of operations on B-trees. Acta Inf.\u00a09, 1\u201321 (1977)","journal-title":"Acta Inf."},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"DeWitt, D., Katz, R., Olken, F., Shapiro, L., Stonebraker, M., Wood, D.: Implementation techniques for main memory database systems. SIGMOD, 1\u20138 (1984)","DOI":"10.1145\/971697.602261"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Graefe, G.: Write-optimized B-trees. In: VLDB, pp. 672\u2013683 (2004)","DOI":"10.1016\/B978-012088469-8.50060-7"},{"key":"6_CR4","unstructured":"Graefe, G.: Hierarchical locking in B-tree indexes. In: BTW, pp. 18\u201342 (2007)"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Graefe, G.: A survey of B-tree locking techniques. ACM Trans. Database Syst.\u00a035(3) (2010)","DOI":"10.1145\/1806907.1806908"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Graefe, G.: Modern B-tree techniques. Foundations and Trends in Databases (2011)","DOI":"10.1109\/ICDE.2011.5767956"},{"issue":"1","key":"6_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2109196.2109197","volume":"37","author":"G. Graefe","year":"2012","unstructured":"Graefe, G.: A survey of b-tree logging and recovery techniques. ACM TODS\u00a037(1), 1:1\u20131:35 (2012)","journal-title":"ACM TODS"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Graefe, G., Kimura, H., Kuno, H.: Foster b-trees. ACM Transactions on Database Systems, TODS (2012)","DOI":"10.1145\/2338626.2338630"},{"key":"6_CR9","unstructured":"Graefe, G., Stonecipher, R.: Efficient verification of B-tree integrity. In: BTW, pp. 27\u201346 (2009)"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Harizopoulos, S., Abadi, D.J., Madden, S.R., Stonebraker, M.: OLTP through the looking glass, and what we found there. In: SIGMOD, Vancouver, Canada (2008)","DOI":"10.1145\/1376616.1376713"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Helland, P., Sammer, H., Lyon, J., Carr, R., Garrett, P., Reuter, A.: Group commit timers and high volume transaction systems. High Performance Transaction Systems, 301\u2013329 (1989)","DOI":"10.1007\/3-540-51085-0_52"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s00778-004-0140-6","volume":"14","author":"I. Jaluta","year":"2005","unstructured":"Jaluta, I., Sippu, S., Soisalon-Soininen, E.: Concurrency control and recovery for balanced B-link trees. VLDB J.\u00a014, 257\u2013277 (2005)","journal-title":"VLDB J."},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Johnson, R., Pandis, I., Ailamaki, A.: Improving OLTP scalability using speculative lock inheritance. PVLDB, 479\u2013489 (2009)","DOI":"10.14778\/1687627.1687682"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Johnson, R., Pandis, I., Hardavellas, N., Ailamaki, A., Falsafi, B.: Shore-MT: a scalable storage manager for the multicore era. In: EDBT, pp. 24\u201335 (2009)","DOI":"10.1145\/1516360.1516365"},{"issue":"1","key":"6_CR15","first-page":"681","volume":"3","author":"R. Johnson","year":"2010","unstructured":"Johnson, R., Pandis, I., Stoica, R., Athanassoulis, M., Ailamaki, A.: Aether: A scalable approach to logging. PVLDB\u00a03(1), 681\u2013692 (2010)","journal-title":"PVLDB"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Johnson, R., Pandis, I., Stoica, R., Athanassoulis, M., Ailamaki, A.: Scalability of write-ahead logging on multicore and multisocket hardware. VLDB J., 239\u2013263 (2012)","DOI":"10.1007\/s00778-011-0260-8"},{"key":"6_CR17","unstructured":"Kimura, H., Graefe, G., Kuno, H.: Efficient locking techniques for databases on modern hardware. In: Third International Workshop on Accelerating Data Management Systems Using Modern Processor and Storage Architectures (2012)"},{"key":"6_CR18","first-page":"380","volume-title":"Proceedings of 1986 ACM Fall Joint Computer Conference, ACM 1986","author":"V. Lanin","year":"1986","unstructured":"Lanin, V., Shasha, D.: A symmetric concurrent B-tree algorithm. In: Proceedings of 1986 ACM Fall Joint Computer Conference, ACM 1986, pp. 380\u2013389. IEEE Computer Society Press, Los Alamitos (1986)"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1145\/319628.319663","volume":"6","author":"P.L. Lehman","year":"1981","unstructured":"Lehman, P.L., Yao, S.B.: Efficient locking for concurrent operations on B-trees. ACM Trans. Database Syst.\u00a06, 650\u2013670 (1981)","journal-title":"ACM Trans. Database Syst."},{"key":"6_CR20","unstructured":"Lomet, D.B.: Key range locking strategies for improved concurrency. In: VLDB, pp. 655\u2013664 (1993)"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Lomet, D.B.: Simple, robust and highly concurrent b-trees with node deletion. In: ICDE, pp. 18\u201327 (2004)","DOI":"10.1109\/ICDE.2004.1319981"},{"issue":"3","key":"6_CR22","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/s007780050042","volume":"6","author":"D.B. Lomet","year":"1997","unstructured":"Lomet, D.B., Salzberg, B.: Concurrency and recovery for index trees. VLDB J.\u00a06(3), 224\u2013240 (1997)","journal-title":"VLDB J."},{"key":"6_CR23","unstructured":"Mohan, C.: ARIES\/KVL: A key-value locking method for concurrency control of multiaction transactions operating on b-tree indexes. In: VLDB, pp. 392\u2013405 (1990)"},{"key":"6_CR24","unstructured":"Mohan, C.: Commit_lsn: A novel and simple method for reducing locking and latching in transaction processing systems. In: McLeod, D., Sacks-Davis, R., Schek, H.-J. (eds.) VLDB, pp. 406\u2013418. Morgan Kaufmann (1990)"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Mohan, C.: Disk read-write optimizations and data integrity in transaction systems using write-ahead logging. In: ICDE, pp. 324\u2013331 (1995)","DOI":"10.1109\/ICDE.1995.380378"},{"issue":"1","key":"6_CR26","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1145\/128765.128770","volume":"17","author":"C. Mohan","year":"1992","unstructured":"Mohan, C., Haderle, D.J., Lindsay, B.G., Pirahesh, H., Schwarz, P.M.: ARIES: A transaction recovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging. ACM Trans. Database Syst.\u00a017(1), 94\u2013162 (1992)","journal-title":"ACM Trans. Database Syst."},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Mohan, C., Levine, F.E.: ARIES\/IM: An efficient and high concurrency index management method using write-ahead logging. In: SIGMOD, pp. 371\u2013380 (1992)","DOI":"10.1145\/141484.130338"},{"issue":"4","key":"6_CR28","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1145\/7239.7266","volume":"11","author":"C. Mohan","year":"1986","unstructured":"Mohan, C., Lindsay, B., Obermarck, R.: Transaction management in the R* distributed database management system. ACM TODS\u00a011(4), 378\u2013396 (1986)","journal-title":"ACM TODS"},{"key":"6_CR29","unstructured":"Oracle asynchronous commit. Oracle database advanced application developer\u2019s guide"},{"key":"6_CR30","unstructured":"Rafii, A., DuBois, D.: Performance tradeoffs of group commit logging. In: CMG Conference (1989)"},{"key":"6_CR31","first-page":"28","volume-title":"ACM PODS, PODS 1985","author":"Y. Sagiv","year":"1985","unstructured":"Sagiv, Y.: Concurrent operations on b-trees with overtaking. In: ACM PODS, PODS 1985, pp. 28\u201337. ACM, New York (1985)"},{"key":"6_CR32","doi-asserted-by":"crossref","unstructured":"Sewall, J., Chhugani, J., Kim, C., Satish, N., Dubey, P.: PALM: Parallel architecture-friendly latch-free modifications to B+ trees on many-core processors. PVLDB\u00a04(11) (2011)","DOI":"10.14778\/3402707.3402719"}],"container-title":["Lecture Notes in Computer Science","Databases in Networked Information Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37134-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T00:52:19Z","timestamp":1745974339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37134-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642371332","9783642371349"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37134-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}