{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:19:29Z","timestamp":1740169169452,"version":"3.37.3"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.2985407","type":"journal-article","created":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T20:10:10Z","timestamp":1585944610000},"page":"100948-100962","source":"Crossref","is-referenced-by-count":3,"title":["TLSM: Tiered Log-Structured Merge-Tree Utilizing Non-Volatile Memory"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1274-8185","authenticated-orcid":false,"given":"Jihwan","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7793-4651","authenticated-orcid":false,"given":"Won Gi","family":"Choi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Doyoung","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4797-9060","authenticated-orcid":false,"given":"Hanseung","family":"Sung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanghyun","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3093337.3037737"},{"journal-title":"NVMRocks Rocksdb on non-volatile memory systems","year":"2019","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/121133.121137"},{"journal-title":"RocksDB Wiki","year":"2019","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3093241.3093278"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3033273"},{"key":"ref15","first-page":"71","article-title":"LSM-trie: An LSM-tree-based ultra-large key-value store for small data items","author":"wu","year":"2015","journal-title":"Proc of USENIX Annual Technical Conf (USENIX)"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10766-016-0472-z"},{"key":"ref17","first-page":"1","article-title":"A light-weight compaction tree to reduce I\/O amplification toward efficient key-value stores","author":"yao","year":"2017","journal-title":"Proc Int Conf on Massive Storage Systems and Technology (MSST)"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.85"},{"key":"ref19","first-page":"3","article-title":"Optimizing space amplification in RocksDB","volume":"3","author":"dong","year":"2017","journal-title":"Proc CIDR"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629589"},{"journal-title":"Cassandra","year":"2019","key":"ref4"},{"journal-title":"Persistent Memory Programming","year":"2019","key":"ref27"},{"journal-title":"Apache HBase","year":"2019","key":"ref3"},{"journal-title":"RocksDB","year":"2019","key":"ref6"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1961295.1950379"},{"journal-title":"LevelDB","year":"2019","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-66917-5_22"},{"key":"ref7","first-page":"993","article-title":"Redesigning LSMs for nonvolatile memory with NoveLSM","author":"kannan","year":"2018","journal-title":"Proc of USENIX Annual Technical Conf (USENIX)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1365815.1365816"},{"key":"ref9","first-page":"191","article-title":"SLM-DB: Single-level key-value store with persistent memory","author":"kaiyrakhmet","year":"2019","journal-title":"Proc 17th USENIX Conf File Storage Technol (USENIX FAST)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050048"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213862"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2980024.2872410"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2954679.2872392"},{"key":"ref24","first-page":"167","article-title":"NV-Tree: Reducing consistency cost for NVM-based single level systems","author":"yang","year":"2015","journal-title":"Proc USENIX Conf File Storage Technol (FAST)"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824044"},{"key":"ref26","first-page":"257","article-title":"WORT: Write optimal radix tree for persistent memory storage systems","author":"lee","year":"2017","journal-title":"Proc USENIX Conf File Storage Technol (FAST)"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915251"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09056561.pdf?arnumber=9056561","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:51:10Z","timestamp":1639770670000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9056561\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2985407","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}