{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:29:27Z","timestamp":1750220967648,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,8,5]],"date-time":"2019-08-05T00:00:00Z","timestamp":1564963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"The National High Technology Research and Development Program of China","award":["2017YFC08038"],"award-info":[{"award-number":["2017YFC08038"]}]},{"name":"The National Science Foundation of China","award":["61572377 and 61572373"],"award-info":[{"award-number":["61572377 and 61572373"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,8,5]]},"DOI":"10.1145\/3337821.3337836","type":"proceedings-article","created":{"date-parts":[[2019,7,25]],"date-time":"2019-07-25T12:34:36Z","timestamp":1564058076000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["On Integration of Appends and Merges in Log-Structured Merge Trees"],"prefix":"10.1145","author":[{"given":"Caixin","family":"Gong","sequence":"first","affiliation":[{"name":"Alibaba Group, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuibing","family":"He","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Zhejiang University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yili","family":"Gong","sequence":"additional","affiliation":[{"name":"School of Computer Science, Wuhan University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingchun","family":"Lei","sequence":"additional","affiliation":[{"name":"Daowoo Times Tech. Co., China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,8,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3064176.3064193"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1365815.1365816"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196927"},{"key":"e_1_3_2_1_5_1","unstructured":"Facebook. 2017. Write stalls. https:\/\/github.com\/facebook\/rocksdb\/wiki\/writestalls.  Facebook. 2017. Write stalls. https:\/\/github.com\/facebook\/rocksdb\/wiki\/writestalls."},{"key":"e_1_3_2_1_6_1","unstructured":"Facebook. 2019. MyRocks. http:\/\/myrocks.io\/.  Facebook. 2019. MyRocks. http:\/\/myrocks.io\/."},{"key":"e_1_3_2_1_7_1","unstructured":"Facebook. 2019. RocksDB. https:\/\/rocksdb.org\/.  Facebook. 2019. RocksDB. https:\/\/rocksdb.org\/."},{"key":"e_1_3_2_1_8_1","unstructured":"Google. 2019. LevelDB. http:\/\/leveldb.org\/.  Google. 2019. LevelDB. http:\/\/leveldb.org\/."},{"key":"e_1_3_2_1_9_1","volume-title":"Proceedings of ATC'18","author":"Kannan Sudarsun","year":"2018","unstructured":"Sudarsun Kannan , Nitish Bhat , Ada Gavrilovska , Andrea ArpaciDusseau , and Remzi Arpaci-Dusseau . 2018 . Redesigning LSMs for nonvolatile memory with NoveLSM . In Proceedings of ATC'18 . 993--1005. Sudarsun Kannan, Nitish Bhat, Ada Gavrilovska, Andrea ArpaciDusseau, and Remzi Arpaci-Dusseau. 2018. Redesigning LSMs for nonvolatile memory with NoveLSM. In Proceedings of ATC'18. 993--1005."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1773912.1773922"},{"key":"e_1_3_2_1_11_1","volume-title":"Proceedings of FAST'16","author":"Lu Lanyue","year":"2016","unstructured":"Lanyue Lu , Thanumalayan Sankaranarayana Pillai , Andrea C Arpacidusseau , and Remzi H Arpacidusseau . 2016 . WiscKey: Separating keys from values in SSD-conscious storage . In Proceedings of FAST'16 . 133--148. Lanyue Lu, Thanumalayan Sankaranarayana Pillai, Andrea C Arpacidusseau, and Remzi H Arpacidusseau. 2016. WiscKey: Separating keys from values in SSD-conscious storage. In Proceedings of FAST'16. 133--148."},{"key":"e_1_3_2_1_12_1","volume-title":"Carey","author":"Luo Chen","year":"2018","unstructured":"Chen Luo and Michael J . Carey . 2018 . LSM-based Storage Techniques: A Survey . https:\/\/arxiv.org\/abs\/1812.07527. Chen Luo and Michael J. Carey. 2018. LSM-based Storage Techniques: A Survey. https:\/\/arxiv.org\/abs\/1812.07527."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050048"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132765"},{"key":"e_1_3_2_1_15_1","volume-title":"Proceedings of ATC'13","author":"Ren Kai","year":"2013","unstructured":"Kai Ren and Garth A Gibson . 2013 . TABLEFS: enhancing metadata efficiency in the local file system . In Proceedings of ATC'13 . 145--156. Kai Ren and Garth A Gibson. 2013. TABLEFS: enhancing metadata efficiency in the local file system. In Proceedings of ATC'13. 145--156."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/3151106.3151108"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213862"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/2336664.2336673"},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings of ATC'15","author":"Xingbo Wu","year":"2015","unstructured":"Wu Xingbo , Xu Yuehai , Shao Zili , and Jiang Song . 2015 . LSM-trie: An LSM-tree-based ultra-large key-value store for small data . In Proceedings of ATC'15 . 71--82. Wu Xingbo, Xu Yuehai, Shao Zili, and Jiang Song. 2015. LSM-trie: An LSM-tree-based ultra-large key-value store for small data. In Proceedings of ATC'15. 71--82."},{"key":"e_1_3_2_1_20_1","volume-title":"Proceedings of MSST'17","author":"Yao Ting","year":"2017","unstructured":"Ting Yao , Jiguang Wan , Ping Huang , Xubin He , Qingxin Gui , Fei Wu , and Changsheng Xie . 2017 . A light-weight compaction tree to reduce I\/O amplification toward efficient key-value stores . In Proceedings of MSST'17 . Ting Yao, Jiguang Wan, Ping Huang, Xubin He, Qingxin Gui, Fei Wu, and Changsheng Xie. 2017. A light-weight compaction tree to reduce I\/O amplification toward efficient key-value stores. In Proceedings of MSST'17."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196931"}],"event":{"name":"ICPP 2019: 48th International Conference on Parallel Processing","sponsor":["University of Tsukuba University of Tsukuba"],"location":"Kyoto Japan","acronym":"ICPP 2019"},"container-title":["Proceedings of the 48th International Conference on Parallel Processing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3337821.3337836","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3337821.3337836","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:25Z","timestamp":1750204465000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3337821.3337836"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,5]]},"references-count":21,"alternative-id":["10.1145\/3337821.3337836","10.1145\/3337821"],"URL":"https:\/\/doi.org\/10.1145\/3337821.3337836","relation":{},"subject":[],"published":{"date-parts":[[2019,8,5]]},"assertion":[{"value":"2019-08-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}