{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:23:10Z","timestamp":1742912590877,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031683114"},{"type":"electronic","value":"9783031683121"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-68312-1_17","type":"book-chapter","created":{"date-parts":[[2024,8,16]],"date-time":"2024-08-16T18:01:59Z","timestamp":1723831319000},"page":"217-232","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Lightweight Latches for\u00a0B-Trees to\u00a0Cope with\u00a0High Contention"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-4561-9850","authenticated-orcid":false,"given":"Amir","family":"El-Shaikh","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9362-153X","authenticated-orcid":false,"given":"Bernhard","family":"Seeger","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6437-2127","authenticated-orcid":false,"given":"Eljas","family":"Soisalon-Soininen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,17]]},"reference":[{"key":"17_CR1","unstructured":"Alhomssi, A., Leis, V.: Contention and space management in B-trees. In: CIDR (2021)"},{"key":"17_CR2","unstructured":"Bailis, P., Davidson, A., Fekete, A., Ghodsi, A., Hellerstein, J.M.: Transaction retries for distributed data stores. In: Proceedings of the VLDB Endowment, vol.\u00a06, pp. 1022\u20131033. VLDB Endowment (2013)"},{"issue":"1","key":"17_CR3","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 Informatica 9(1), 1\u201321 (1977)","journal-title":"Acta Informatica"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"B\u00f6ttcher, J., Leis, V., Giceva, J., Neumann, T., Kemper, A.: Scalable and robust latches for database systems. In: Proceedings of the 16th International Workshop on Data Management on New Hardware, pp.\u00a01\u20138 (2020)","DOI":"10.1145\/3399666.3399908"},{"issue":"8","key":"17_CR5","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/2858788.2688503","volume":"50","author":"M Chabbi","year":"2015","unstructured":"Chabbi, M., Fagan, M., Mellor-Crummey, J.: High performance locks for multi-level NUMA systems. ACM SIGPLAN Not. 50(8), 215\u2013226 (2015)","journal-title":"ACM SIGPLAN Not."},{"key":"17_CR6","unstructured":"Chandy, K.M., Misra, J.: Transactional locking in a distributed system. In: Proceedings of the 2nd International Conference on Distributed Computing Systems, pp. 47\u201354. IEEE (1981)"},{"issue":"3","key":"17_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1806907.1806908","volume":"35","author":"G Graefe","year":"2010","unstructured":"Graefe, G.: A survey of B-tree locking techniques. ACM Trans. Database Syst. (TODS) 35(3), 1\u201326 (2010)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"issue":"3","key":"17_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2338626.2338630","volume":"37","author":"G Graefe","year":"2012","unstructured":"Graefe, G., Kimura, H., Kuno, H.: Foster B-trees. ACM Trans. Database Syst. (TODS) 37(3), 1\u201329 (2012)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"key":"17_CR9","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. 14, 257\u2013277 (2005)","journal-title":"VLDB J."},{"issue":"4","key":"17_CR10","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1145\/319628.319663","volume":"6","author":"PL Lehman","year":"1981","unstructured":"Lehman, P.L., Yao, S.B.: Efficient locking for concurrent operations on B-trees. ACM Trans. Database Syst. (TODS) 6(4), 650\u2013670 (1981)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"issue":"1","key":"17_CR11","first-page":"73","volume":"42","author":"V Leis","year":"2019","unstructured":"Leis, V., Haubenschild, M., Neumann, T.: Optimistic lock coupling: a scalable and efficient general-purpose synchronization method. IEEE Data Eng. Bull. 42(1), 73\u201384 (2019)","journal-title":"IEEE Data Eng. Bull."},{"issue":"1","key":"17_CR12","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1145\/103727.103729","volume":"9","author":"JM Mellor-Crummey","year":"1991","unstructured":"Mellor-Crummey, J.M., Scott, M.L.: Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Trans. Comput. Syst. (TOCS) 9(1), 21\u201365 (1991)","journal-title":"ACM Trans. Comput. Syst. (TOCS)"},{"key":"17_CR13","unstructured":"Neumann, T., Weikum, G.: Preemptive splitting in B-trees. In: Proceedings of the 24th International Conference on Very Large Databases (VLDB), Mumbai (Bombay), India (1998)"},{"issue":"3","key":"17_CR14","first-page":"686","volume":"26","author":"X Ouyang","year":"2015","unstructured":"Ouyang, X., Li, X., Chen, H., Li, J., Li, W., Zhou, X.: Transactional retry for distributed systems. IEEE Trans. Parallel Distrib. Syst. 26(3), 686\u2013695 (2015)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"4","key":"17_CR15","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0020-0190(76)90005-3","volume":"5","author":"B Samadi","year":"1976","unstructured":"Samadi, B.: B-trees in a system with multiple users. Inf. Process. Lett. 5(4), 107\u2013112 (1976)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"17_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3617336","volume":"1","author":"G Shi","year":"2023","unstructured":"Shi, G., Yan, Z., Wang, T.: OptiQL: robust optimistic locking for memory-optimized indexes. Proc. ACM Manag. Data 1(3), 1\u201326 (2023)","journal-title":"Proc. ACM Manag. Data"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68312-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,16]],"date-time":"2024-08-16T18:03:18Z","timestamp":1723831398000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68312-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683114","9783031683121"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68312-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"17 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DEXA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database and Expert Systems Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Naples","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.dexa.org\/dexa2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}