{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:08:01Z","timestamp":1743095281469,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":21,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819986637"},{"type":"electronic","value":"9789819986644"}],"license":[{"start":{"date-parts":[[2023,12,15]],"date-time":"2023-12-15T00:00:00Z","timestamp":1702598400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,15]],"date-time":"2023-12-15T00:00:00Z","timestamp":1702598400000},"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-981-99-8664-4_23","type":"book-chapter","created":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T06:05:13Z","timestamp":1702533913000},"page":"402-418","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Optimized Solution for\u00a0Highly Contended Transactional Workloads"],"prefix":"10.1007","author":[{"given":"Chunxi","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuyan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ting","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,15]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Alomari, M., Cahill, M., Fekete, A., Rohm, U.: The cost of serializability on platforms that use snapshot isolation. In: ICDE, pp. 576\u2013585. IEEE (2008)","DOI":"10.1109\/ICDE.2008.4497466"},{"key":"23_CR2","volume-title":"Concurrency Control and Recovery in Database Systems","author":"PA Bernstein","year":"1987","unstructured":"Bernstein, P.A., Hadzilacos, V., Goodman, N.: Concurrency Control and Recovery in Database Systems. Addison-Wesley, Boston (1987)"},{"issue":"2","key":"23_CR3","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s00778-011-0221-2","volume":"20","author":"G Candea","year":"2011","unstructured":"Candea, G., Polyzotis, N., Vingralek, R.: Predictable performance and high query concurrency for data analytics. VLDB 20(2), 227\u2013248 (2011)","journal-title":"VLDB"},{"key":"23_CR4","unstructured":"Council, T.P.P.: TPC-C benchmark (1992). https:\/\/www.tpc.org\/tpcc\/"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"DeCandia, G., et al.: Dynamo: Amazon\u2019s highly available key-value store. In: SOSP, pp. 205\u2013220 (2007)","DOI":"10.1145\/1323293.1294281"},{"issue":"11","key":"23_CR6","first-page":"1190","volume":"8","author":"JM Faleiro","year":"2015","unstructured":"Faleiro, J.M., Abadi, D.J.: Rethinking serializable multiversion concurrency control. VLDB 8(11), 1190\u20131201 (2015)","journal-title":"VLDB"},{"issue":"6","key":"23_CR7","first-page":"526","volume":"5","author":"G Giannikis","year":"2012","unstructured":"Giannikis, G., Alonso, G., Kossmann, D.: SharedDB: killing one thousand queries with one stone. VLDB 5(6), 526\u2013537 (2012)","journal-title":"VLDB"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Huang, G., et al.: X-Engine: an optimized storage engine for large-scale e-commerce transaction processing. In: SIGMOD, pp. 651\u2013665 (2019)","DOI":"10.1145\/3299869.3314041"},{"issue":"6","key":"23_CR9","first-page":"480","volume":"9","author":"D Makreshanski","year":"2016","unstructured":"Makreshanski, D., Giannikis, G., Alonso, G., Kossmann, D.: MQJoin: efficient shared execution of main-memory joins. VLDB 9(6), 480\u2013491 (2016)","journal-title":"VLDB"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Makreshanski, D., Giceva, J., Barthels, C., Alonso, G.: BatchDB: efficient isolated execution of hybrid OLTP+OLAP workloads for interactive applications. In: SIGMOD, pp. 37\u201350 (2017)","DOI":"10.1145\/3035918.3035959"},{"key":"23_CR11","unstructured":"Narula, N., Cutler, C., Kohler, E., Morris, R.: Phase reconciliation for contended in-memory transactions. In: OSDI, pp. 511\u2013524 (2014)"},{"key":"23_CR12","unstructured":"Oracle: Oracle Database 12c: Advanced Queuing Whitepaper (2015)"},{"issue":"1\u20132","key":"23_CR13","first-page":"928","volume":"3","author":"I Pandis","year":"2010","unstructured":"Pandis, I., Johnson, R., Hardavellas, N., Ailamaki, A.: Data-oriented transaction execution. VLDB 3(1\u20132), 928\u2013939 (2010)","journal-title":"VLDB"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Prasaad, G., Cheung, A., Suciu, D.: Handling highly contended OLTP workloads using fast dynamic partitioning. In: International Conference on Management of Data, SIGMOD\/PODS 2020 (2020)","DOI":"10.1145\/3318464.3389764"},{"issue":"12","key":"23_CR15","first-page":"1769","volume":"11","author":"R Rehrmann","year":"2018","unstructured":"Rehrmann, R., Binnig, C., B\u00f6hm, A., Kim, K., Lehner, W., Rizk, A.: OLTPshare: the case for sharing in OLTP workloads. VLDB 11(12), 1769\u20131780 (2018)","journal-title":"VLDB"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Ren, K., Faleiro, J.M., Abadi, D.J.: Design principles for scaling multi-core OLTP under high contention. In: SIGMOD, pp. 1583\u20131598 (2016)","DOI":"10.1145\/2882903.2882958"},{"issue":"4","key":"23_CR17","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1326542.1326544","volume":"3","author":"O Rodeh","year":"2008","unstructured":"Rodeh, O.: B-trees, shadowing, and clones. TOS 3(4), 2 (2008)","journal-title":"TOS"},{"issue":"1","key":"23_CR18","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/42201.42203","volume":"13","author":"TK Sellis","year":"1988","unstructured":"Sellis, T.K.: Multiple-query optimization. TODS 13(1), 23\u201352 (1988)","journal-title":"TODS"},{"issue":"5","key":"23_CR19","first-page":"648","volume":"11","author":"B Tian","year":"2018","unstructured":"Tian, B., Huang, J., Mozafari, B., Schoenebeck, G.: Contention-aware lock scheduling for transactional databases. VLDB 11(5), 648\u2013662 (2018)","journal-title":"VLDB"},{"issue":"2","key":"23_CR20","first-page":"49","volume":"10","author":"T Wang","year":"2016","unstructured":"Wang, T., Kimura, H.: Mostly-optimistic concurrency control for highly contended dynamic workloads on a thousand cores. VLDB 10(2), 49\u201360 (2016)","journal-title":"VLDB"},{"issue":"5","key":"23_CR21","first-page":"1","volume":"14","author":"C Zhang","year":"2020","unstructured":"Zhang, C., Li, Y., Zhang, R., Qian, W., Zhou, A.: Benchmarking on intensive transaction processing. Front. Comp. Sci. 14(5), 1\u201318 (2020)","journal-title":"Front. Comp. Sci."}],"container-title":["Lecture Notes in Computer Science","Dependable Software Engineering. Theories, Tools, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8664-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T06:10:12Z","timestamp":1702534212000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8664-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,15]]},"ISBN":["9789819986637","9789819986644"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8664-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,15]]},"assertion":[{"value":"15 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SETTA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Dependable Software Engineering: Theories, Tools, and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanjing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"setta2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lcs.ios.ac.cn\/setta2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"78","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}