{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T21:24:31Z","timestamp":1771881871126,"version":"3.50.1"},"reference-count":22,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100020950","name":"National Science and Technology Council","doi-asserted-by":"publisher","award":["113-2221-E-007-134"],"award-info":[{"award-number":["113-2221-E-007-134"]}],"id":[{"id":"10.13039\/501100020950","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100020950","name":"National Science and Technology Council","doi-asserted-by":"publisher","award":["114-2927-I-002-525"],"award-info":[{"award-number":["114-2927-I-002-525"]}],"id":[{"id":"10.13039\/501100020950","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100020950","name":"National Science and Technology Council","doi-asserted-by":"publisher","award":["114-2927-I-002-532"],"award-info":[{"award-number":["114-2927-I-002-532"]}],"id":[{"id":"10.13039\/501100020950","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100020950","name":"National Science and Technology Council","doi-asserted-by":"publisher","award":["114-2223-E-002-011"],"award-info":[{"award-number":["114-2223-E-002-011"]}],"id":[{"id":"10.13039\/501100020950","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100020950","name":"National Science and Technology Council","doi-asserted-by":"publisher","award":["114-2221-E-002-219-MY3"],"award-info":[{"award-number":["114-2221-E-002-219-MY3"]}],"id":[{"id":"10.13039\/501100020950","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100020950","name":"National Science and Technology Council","doi-asserted-by":"publisher","award":["114-2221-E-002-222-MY3"],"award-info":[{"award-number":["114-2221-E-002-222-MY3"]}],"id":[{"id":"10.13039\/501100020950","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010002","name":"Ministry of Education","doi-asserted-by":"publisher","award":["114L900903"],"award-info":[{"award-number":["114L900903"]}],"id":[{"id":"10.13039\/100010002","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1109\/tcad.2025.3600356","type":"journal-article","created":{"date-parts":[[2025,8,20]],"date-time":"2025-08-20T18:42:40Z","timestamp":1755715360000},"page":"1239-1250","source":"Crossref","is-referenced-by-count":0,"title":["Bloom Merge Strategies for Sustainable SSD Endurance in Write-Intensive LSM-Trees"],"prefix":"10.1109","volume":"45","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1039-304X","authenticated-orcid":false,"given":"Yi-Hua","family":"Chen","sequence":"first","affiliation":[{"name":"Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-6671-3705","authenticated-orcid":false,"given":"Wei-Chun","family":"Cheng","sequence":"additional","affiliation":[{"name":"Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2665-9490","authenticated-orcid":false,"given":"Yun-Chih","family":"Chen","sequence":"additional","affiliation":[{"name":"Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8356-2495","authenticated-orcid":false,"given":"Wei-Kuan","family":"Shih","sequence":"additional","affiliation":[{"name":"Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1282-2111","authenticated-orcid":false,"given":"Yuan-Hao","family":"Chang","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1365815.1365816"},{"key":"ref2","volume-title":"Leveldb","year":"2025"},{"key":"ref3","first-page":"49","article-title":"TAO: Facebook\u2019s distributed data store for the social graph","volume-title":"Proc. 2013 USENIX Annu. Tech. Conf.","author":"Bronson"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064012"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3314041"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1323293.1294281"},{"key":"ref7","volume-title":"Rocksdb","year":"2025"},{"key":"ref8","volume-title":"Redis","year":"2025"},{"key":"ref9","volume-title":"Apache Cassandra","year":"2025"},{"key":"ref10","volume-title":"Apache Hbase","year":"2025"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3033273"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-023-04031-9"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132765"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CLOUD.2018.00090"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2831259"},{"key":"ref16","first-page":"1007","article-title":"HashKV: Enabling efficient updates in KV storage via hashing","volume-title":"Proc. USENIX Annu. Tech. Conf.","author":"Chan"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3276980"},{"key":"ref18","article-title":"ElasticBF: Fine-grained and elastic Bloom filter towards efficient read for LSM-tree-based KV stores","volume-title":"Proc. 10th USENIX Workshop Hot Topics Storage File Syst.","author":"Zhang"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/LCA.2023.3282276"},{"key":"ref20","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":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"ref22","first-page":"673","article-title":"Differentiated key-value storage management for balanced I\/O performance","volume-title":"Proc. USENIX Annu. Tech. Conf.","author":"Li"}],"container-title":["IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/43\/11404293\/11131199.pdf?arnumber=11131199","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T20:48:06Z","timestamp":1771879686000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11131199\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":22,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tcad.2025.3600356","relation":{},"ISSN":["0278-0070","1937-4151"],"issn-type":[{"value":"0278-0070","type":"print"},{"value":"1937-4151","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3]]}}}