{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:14:30Z","timestamp":1759133670904},"reference-count":24,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2018,8]]},"abstract":"<jats:p>In the past, resource sharing has been extensively studied for OLAP workloads. Naturally, the question arises, why studies mainly focus on OLAP and not on OLTP workloads? At first sight, OLTP queries - due to their short runtime - may not have enough potential for the additional overhead. In addition, OLTP workloads do not only execute read operations but also updates. In this paper, we address query sharing for OLTP workloads. We first analyze the sharing potential in real-world OLTP workloads. Based on those findings, we then present an execution strategy, called OLTPShare that implements a novel batching scheme for OLTP workloads. We analyze the sharing benefits by integrating OLTPShare into a prototype version of the commercial database system SAP HANA. Our results show for different OLTP workloads that OLTPShare enables SAP HANA to provide a significant throughput increase in high-load scenarios compared to the conventional execution strategy without sharing.<\/jats:p>","DOI":"10.14778\/3229863.3229866","type":"journal-article","created":{"date-parts":[[2018,9,10]],"date-time":"2018-09-10T12:12:28Z","timestamp":1536581548000},"page":"1769-1780","source":"Crossref","is-referenced-by-count":22,"title":["OLTPshare"],"prefix":"10.14778","volume":"11","author":[{"given":"Robin","family":"Rehrmann","sequence":"first","affiliation":[{"name":"SAP SE, Germany and TU Dresden, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carsten","family":"Binnig","sequence":"additional","affiliation":[{"name":"TU Darmstadt, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"B\u00f6hm","sequence":"additional","affiliation":[{"name":"SAP SE, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kihong","family":"Kim","sequence":"additional","affiliation":[{"name":"SAP Labs Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfgang","family":"Lehner","sequence":"additional","affiliation":[{"name":"TU Dresden, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amr","family":"Rizk","sequence":"additional","affiliation":[{"name":"TU Darmstadt, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-011-0221-2"},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-95281-4","volume-title":"On Regenerative Processes in Queueing Theory. Lecture notes in economics and mathematical systems","author":"Cohen J.","year":"1976","unstructured":"J. Cohen . On Regenerative Processes in Queueing Theory. Lecture notes in economics and mathematical systems . Springer-Verlag , 1976 . J. Cohen. On Regenerative Processes in Queueing Theory. Lecture notes in economics and mathematical systems. Springer-Verlag, 1976."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/2809974.2809981"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2094114.2094126"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/191839.191947"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/2168651.2168654"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066201"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/2047485.2047491"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/645484.656390"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/2904121.2904124"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035959"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920959"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536360.2536364"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/319702.319729"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/42201.42203"},{"key":"e_1_2_1_17_1","volume-title":"Telecommunication application transaction processing (TATP) benchmark description. Technical report","author":"Simo Neuvonen M. M.","year":"2009","unstructured":"M. M. Simo Neuvonen , Antoni Wolski and V. Raatikka . Telecommunication application transaction processing (TATP) benchmark description. Technical report , IBM Software Group Information Management , March 2009 . M. M. Simo Neuvonen, Antoni Wolski and V. Raatikka. Telecommunication application transaction processing (TATP) benchmark description. Technical report, IBM Software Group Information Management, March 2009."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213838"},{"key":"e_1_2_1_19_1","unstructured":"TPC BENCHMARK\u2122C Standard Specification Revision 5.11. Technical report Transaction Processing Performance Council (TPC) 2010"},{"key":"e_1_2_1_20_1","first-page":"619","volume-title":"Proceedings of the 32nd International Conference on Very Large Data Bases","author":"Wang S.","year":"2006","unstructured":"S. Wang , E. A. Rundensteiner , S. Ganguly , and S. Bhatnagar . State-slice: New paradigm of multi-query optimization of window-based stream queries . In Proceedings of the 32nd International Conference on Very Large Data Bases , Seoul, Korea, September 12--15 , 2006 , pages 619 -- 630 , 2006. S. Wang, E. A. Rundensteiner, S. Ganguly, and S. Bhatnagar. State-slice: New paradigm of multi-query optimization of window-based stream queries. In Proceedings of the 32nd International Conference on Very Large Data Bases, Seoul, Korea, September 12--15, 2006, pages 619--630, 2006."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687671"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/2876473.2876479"},{"key":"e_1_2_1_23_1","unstructured":"D. V. A. Zeyuan Shang and A. Pavlo. Carnegie Mellon Database Application Catalog (CMDBAC). http:\/\/cmdbac.cs.cmu.edu 2018. {Online; accessed 01-March-2018}.  D. V. A. Zeyuan Shang and A. Pavlo. Carnegie Mellon Database Application Catalog (CMDBAC). http:\/\/cmdbac.cs.cmu.edu 2018. {Online; accessed 01-March-2018}."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247540"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3229863.3229866","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:12:08Z","timestamp":1672222328000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3229863.3229866"}},"subtitle":["the case for sharing in OLTP workloads"],"short-title":[],"issued":{"date-parts":[[2018,8]]},"references-count":24,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["10.14778\/3229863.3229866"],"URL":"https:\/\/doi.org\/10.14778\/3229863.3229866","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2018,8]]}}}