{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:11:12Z","timestamp":1750219872296,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,18]],"date-time":"2023-06-18T00:00:00Z","timestamp":1687046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["502384507"],"award-info":[{"award-number":["502384507"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,18]]},"DOI":"10.1145\/3592980.3595316","type":"proceedings-article","created":{"date-parts":[[2023,6,14]],"date-time":"2023-06-14T03:07:44Z","timestamp":1686712064000},"page":"63-69","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards Data-Based Cache Optimization of B+-Trees"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1485-140X","authenticated-orcid":false,"given":"Roland","family":"K\u00fchn","sequence":"first","affiliation":[{"name":"TU Dortmund University, DE"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-9061-4189","authenticated-orcid":false,"given":"Daniel","family":"Biebert","sequence":"additional","affiliation":[{"name":"TU Dortmund University, DE"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9992-9415","authenticated-orcid":false,"given":"Christian","family":"Hakert","sequence":"additional","affiliation":[{"name":"TU Dortmund University, DE"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8114-9760","authenticated-orcid":false,"given":"Jian-Jia","family":"Chen","sequence":"additional","affiliation":[{"name":"TU Dortmund University, DE and Lamarr Institute for Machine Learning and Artificial Intelligence, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0344-5203","authenticated-orcid":false,"given":"Jens","family":"Teubner","sequence":"additional","affiliation":[{"name":"TU Dortmund University, DE and Lamarr Institute for Machine Learning and Artificial Intelligence, Germany"}]}],"member":"320","published-online":{"date-parts":[[2023,6,18]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Efficient realization of decision trees for real-time inference. ACM transactions on embedded computing systems 21, 6","author":"Chen Kuan-Hsun","year":"2022","unstructured":"Kuan-Hsun Chen, Chiahui Su, Christian Hakert, Sebastian Buschj\u00e4ger, Chao-Lin Lee, Jenq-Kuen Lee, Katharina Morik, and Jian-Jia Chen. 2022. Efficient realization of decision trees for real-time inference. ACM transactions on embedded computing systems 21, 6 (2022), 1\u201326."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564710"},{"key":"e_1_3_2_1_3_1","unstructured":"Goetz Graefe. 2003. Sorting And Indexing With Partitioned B-Trees.. In CIDR Vol.\u00a03. Citeseer 5\u20138."},{"key":"e_1_3_2_1_4_1","volume-title":"Modern B-tree techniques. Foundations and Trends\u00ae in Databases 3, 4","author":"Goetz Graefe","year":"2011","unstructured":"Goetz Graefe 2011. Modern B-tree techniques. Foundations and Trends\u00ae in Databases 3, 4 (2011), 203\u2013402."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2001.914847"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/781027.781063"},{"key":"e_1_3_2_1_7_1","volume-title":"https:\/\/software.intel.com\/vtune\/. [Online","author":"Profiler Tune","year":"2023","unstructured":"Intel. 2023. VTune Profiler. https:\/\/software.intel.com\/vtune\/. [Online; accessed 23-March-2023]."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/2856318.2856321"},{"key":"e_1_3_2_1_9_1","volume-title":"An Overview: NUMA becomes more common because memory controllers get close to execution units on microprocessors.Queue 11, 7","author":"Lameter Christoph","year":"2013","unstructured":"Christoph Lameter. 2013. NUMA (Non-Uniform Memory Access): An Overview: NUMA becomes more common because memory controllers get close to execution units on microprocessors.Queue 11, 7 (2013), 40\u201351."},{"key":"e_1_3_2_1_11_1","first-page":"73","article-title":"Optimistic Lock Coupling: A Scalable and Efficient General-Purpose Synchronization Method.","volume":"42","author":"Leis Viktor","year":"2019","unstructured":"Viktor Leis, Michael Haubenschild, and Thomas Neumann. 2019. Optimistic Lock Coupling: A Scalable and Efficient General-Purpose Synchronization Method.IEEE Data Eng. Bull. 42, 1 (2019), 73\u201384.","journal-title":"IEEE Data Eng. Bull."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544812"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933349.2933352"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544834"},{"volume-title":"perf. https:\/\/perf.wiki.kernel.org\/. [Online","year":"2023","key":"e_1_3_2_1_15_1","unstructured":"Linux. 2023. perf. https:\/\/perf.wiki.kernel.org\/. [Online; accessed 23-March-2023]."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2168836.2168855"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050048"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/3149193.3149202"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/645925.671362"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335449"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/3236187.3236205"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/3397230.3397247"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196895"}],"event":{"name":"SIGMOD\/PODS '23: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Seattle WA USA","acronym":"SIGMOD\/PODS '23"},"container-title":["Proceedings of the 19th International Workshop on Data Management on New Hardware"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3592980.3595316","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3592980.3595316","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:48:01Z","timestamp":1750178881000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3592980.3595316"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,18]]},"references-count":22,"alternative-id":["10.1145\/3592980.3595316","10.1145\/3592980"],"URL":"https:\/\/doi.org\/10.1145\/3592980.3595316","relation":{},"subject":[],"published":{"date-parts":[[2023,6,18]]},"assertion":[{"value":"2023-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}