{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T18:10:05Z","timestamp":1746727805972,"version":"3.40.5"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Basic Science Research Program through the National Research Foundation of Korea"},{"name":"Ministry of Science and ICT (MSIT), South Korea","award":["2022R1A2C1006050"],"award-info":[{"award-number":["2022R1A2C1006050"]}]},{"name":"MSIT under the Global Research Support Program in the Digital Field Program supervised by the Institute for Information and Communications Technology Planning and Evaluation","award":["RS-2024-00428758"],"award-info":[{"award-number":["RS-2024-00428758"]}]},{"name":"Development of Novel Key-Value DB for Unstructured Bigdata","award":["2022-0-01022"],"award-info":[{"award-number":["2022-0-01022"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/access.2025.3565528","type":"journal-article","created":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T17:32:33Z","timestamp":1745947953000},"page":"78303-78319","source":"Crossref","is-referenced-by-count":0,"title":["DASL: An Index for Enhancing Tail Latency, Microarchitecture Friendliness, and Restructuring Overhead"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-0195-0291","authenticated-orcid":false,"given":"Hojin","family":"Shin","sequence":"first","affiliation":[{"name":"Department of Software, Dankook University, Yongin-si, Gyeonggi-do, South Korea"}]},{"given":"Gunhee","family":"Choi","sequence":"additional","affiliation":[{"name":"Department of Software, Dankook University, Yongin-si, Gyeonggi-do, South Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3689-3985","authenticated-orcid":false,"given":"Bryan S.","family":"Kim","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, Syracuse University, Syracuse, NY, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5464-4619","authenticated-orcid":false,"given":"Seehwan","family":"Yoo","sequence":"additional","affiliation":[{"name":"Department of Mobile Systems Engineering, Dankook University, Yongin-si, Gyeonggi-do, South Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2042-6327","authenticated-orcid":false,"given":"Jongmoo","family":"Choi","sequence":"additional","affiliation":[{"name":"Department of Software, Dankook University, Yongin-si, Gyeonggi-do, South Korea"}]}],"member":"263","reference":[{"volume-title":"LevelDB","year":"2024","key":"ref1"},{"volume-title":"RocksDB","year":"2024","key":"ref2"},{"volume-title":"Redis","year":"2024","key":"ref3"},{"key":"ref4","first-page":"1037","article-title":"Amazon DynamoDB: A scalable, predictably performant, and fully managed NoSQL database service","volume-title":"Proc. USENIX Annu. Tech. Conf. (USENIX ATC)","author":"Elhemali"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3552326.3587457"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3517884"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2694344.2694359"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1734663.1734671"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335449"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807206"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544834"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544812"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2168836.2168855"},{"key":"ref14","first-page":"257","article-title":"WORT: Write optimal radix tree for persistent memory storage systems","volume-title":"Proc. 15th USENIX Conf. File Storage Technol. (FAST)","author":"Lee"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1115\/1.4052728"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38527-8_13"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56111-0_1"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.54"},{"issue":"17","key":"ref19","doi-asserted-by":"crossref","first-page":"9925","DOI":"10.3390\/app13179925","article-title":"ESL: A high-performance skiplist with express lane","volume":"13","author":"Na","year":"2023","journal-title":"Appl. Sci."},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3034786.3056117"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.14778\/3352063.3352134"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3064176.3064193"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3423211.3425672"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-004-1138-6"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-022-00441-x"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1186810.1186816"},{"key":"ref27","first-page":"367","article-title":"Deterministic skip lists","volume-title":"Proc. 3rd Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Munro"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1233341.1233413"},{"key":"ref29","first-page":"1106","article-title":"Dynamic optimality for skip lists and B-trees","volume-title":"Proc. 19th Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Bose"},{"volume-title":"Perf: Linux Profiling With Performance Counters","year":"2024","key":"ref30"},{"volume-title":"Stx-btree","year":"2024","key":"ref31"},{"key":"ref32","first-page":"209","article-title":"Characterizing, modeling, and benchmarking RocksDB key-value workloads at Facebook","volume-title":"Proc. 18th USENIX Conf. File Storage Technol.","author":"Cao"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/78973.78977"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.14778\/3421424.3421425"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3654919"},{"volume-title":"Libart","year":"2024","key":"ref37"},{"volume-title":"Cache-Sensitive Skip List","year":"2024","key":"ref38"},{"volume-title":"Yahoo! Cloud Serving Benchmark in C++","year":"2024","key":"ref39"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72951-8_11"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.14778\/2809974.2809990"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3626246.3654691"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-024-00864-x"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10820123\/10979934.pdf?arnumber=10979934","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T17:40:13Z","timestamp":1746726013000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10979934\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":43,"URL":"https:\/\/doi.org\/10.1109\/access.2025.3565528","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2025]]}}}