{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T02:53:30Z","timestamp":1783997610661,"version":"3.55.0"},"reference-count":87,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2024,8]]},"abstract":"<jats:p>\n            Persistent key-value (KV) stores are widely used by cloud services at ByteDance as local storage engines, and RocksDB used to be the\n            <jats:italic>de facto<\/jats:italic>\n            implementation since it can be tailored to a variety of workloads and requirements. In this paper, we provide key insights into local storage engine usage at ByteDance, explain why the combination of highly write-intensive workloads and stringent requirements on cost efficiency and point lookup tail latency may pose challenges to a general-purpose local storage engine such as RocksDB, and present the design and implementation of\n            <jats:italic>LavaStore<\/jats:italic>\n            , a high-performance cost-effective local storage engine purpose-built to address these challenges.\n          <\/jats:p>\n          <jats:p>LavaStore achieves its design goals by selectively customizing a few components of a RocksDB-based, general-purpose local storage engine, including a distinct KV separation design that decouples garbage collection from compaction, a specialized engine type for the commonly recurring Write-Ahead-Logging workload, and a customized user-space append-only filesystem. LavaStore has been deployed to production with hundreds of thousands of running instances, storing more than 100 PB of data and serving billions of requests per second, bringing significant performance improvements and cost reductions to customers over their original local storage engines. For example, a ByteDance proprietary distributed OLTP database service has experienced a reduction in average write and read latency by 61% and 16%, respectively, and a ByteDance proprietary caching service has gained an 87% increase in write throughput with no more than 6% space overhead.<\/jats:p>","DOI":"10.14778\/3685800.3685807","type":"journal-article","created":{"date-parts":[[2024,11,8]],"date-time":"2024-11-08T17:25:21Z","timestamp":1731086721000},"page":"3799-3812","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["LavaStore: ByteDance's Purpose-Built, High-Performance, Cost-Effective Local Storage Engine for Cloud Services"],"prefix":"10.14778","volume":"17","author":[{"given":"Hao","family":"Wang","sequence":"first","affiliation":[{"name":"ByteDance"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiaxin","family":"Ou","sequence":"additional","affiliation":[{"name":"ByteDance"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ming","family":"Zhao","sequence":"additional","affiliation":[{"name":"ByteDance"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sheng","family":"Qiu","sequence":"additional","affiliation":[{"name":"ByteDance"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yizheng","family":"Jiao","sequence":"additional","affiliation":[{"name":"ByteDance"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yi","family":"Wang","sequence":"additional","affiliation":[{"name":"ByteDance"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qizhong","family":"Mao","sequence":"additional","affiliation":[{"name":"ByteDance"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhengyu","family":"Yang","sequence":"additional","affiliation":[{"name":"ByteDance"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yang","family":"Liu","sequence":"additional","affiliation":[{"name":"ByteDance"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianshun","family":"Zhang","sequence":"additional","affiliation":[{"name":"ByteDance"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianyang","family":"Hu","sequence":"additional","affiliation":[{"name":"ByteDance"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jingwei","family":"Zhang","sequence":"additional","affiliation":[{"name":"ByteDance"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jinrui","family":"Liu","sequence":"additional","affiliation":[{"name":"ByteDance"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiaqiang","family":"Chen","sequence":"additional","affiliation":[{"name":"ByteDance"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yong","family":"Shen","sequence":"additional","affiliation":[{"name":"ByteDance"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lixun","family":"Cao","sequence":"additional","affiliation":[{"name":"ByteDance"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Heng","family":"Zhang","sequence":"additional","affiliation":[{"name":"ByteDance"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hongde","family":"Li","sequence":"additional","affiliation":[{"name":"ByteDance"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ming","family":"Li","sequence":"additional","affiliation":[{"name":"ByteDance"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yue","family":"Ma","sequence":"additional","affiliation":[{"name":"ByteDance"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lei","family":"Zhang","sequence":"additional","affiliation":[{"name":"ByteDance"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jian","family":"Liu","sequence":"additional","affiliation":[{"name":"ByteDance"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guanghui","family":"Zhang","sequence":"additional","affiliation":[{"name":"ByteDance"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fei","family":"Liu","sequence":"additional","affiliation":[{"name":"ByteDance"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianjun","family":"Chen","sequence":"additional","affiliation":[{"name":"ByteDance"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,11,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2749441"},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of the thirtieth Australasian conference on Computer science-Volume 62","author":"Askitis Nikolas","year":"2007","unstructured":"Nikolas Askitis and Ranjan Sinha. 2007. HAT-trie: a cache-conscious trie-based data structure for strings. In Proceedings of the thirtieth Australasian conference on Computer science-Volume 62. Citeseer, 97--105."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522732"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/3461535.3461543"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196896"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1317379.1317382"},{"key":"e_1_2_1_7_1","volume-title":"2021 USENIX Annual Technical Conference (USENIX ATC 21)","author":"Bj\u00f8rling Matias","year":"2021","unstructured":"Matias Bj\u00f8rling, Abutalib Aghayev, Hans Holmberg, Aravind Ramesh, Damien Le Moal, Gregory R Ganger, and George Amvrosiadis. 2021. ZNS: Avoiding the block interface tax for flash-based SSDs. In 2021 USENIX Annual Technical Conference (USENIX ATC 21). 689--703."},{"key":"e_1_2_1_8_1","volume-title":"Kubernetes: up and running","author":"Burns Brendan","unstructured":"Brendan Burns, Joe Beda, Kelsey Hightower, and Lachlan Evenson. 2022. Kubernetes: up and running. O'Reilly Media, Inc."},{"key":"e_1_2_1_9_1","volume-title":"Retrieved","year":"2019","unstructured":"ByteDance. 2019. TerarkDB. Retrieved January 18, 2024 from https:\/\/github.com\/bytedance\/terarkdb"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/3386691.3386712"},{"key":"e_1_2_1_11_1","volume-title":"Apache Flink: Stream and batch processing in a single engine. The Bulletin of the Technical Committee on Data Engineering 38, 4","author":"Carbone Paris","year":"2015","unstructured":"Paris Carbone, Asterios Katsifodimos, Stephan Ewen, Volker Markl, Seif Haridi, and Kostas Tzoumas. 2015. Apache Flink: Stream and batch processing in a single engine. The Bulletin of the Technical Committee on Data Engineering 38, 4 (2015)."},{"key":"e_1_2_1_12_1","volume-title":"Redis in action","author":"Carlson Josiah","unstructured":"Josiah Carlson. 2013. Redis in action. Simon and Schuster."},{"key":"e_1_2_1_13_1","volume-title":"2018 USENIX Annual Technical Conference (USENIX ATC 18)","author":"Chan Helen HW","year":"2018","unstructured":"Helen HW Chan, Chieh-Jan Mike Liang, Yongkun Li, Wenjia He, Patrick PC Lee, Lianjie Zhu, Yaozu Dong, Yinlong Xu, Yu Xu, Jin Jiang, et al. 2018. HashKV: Enabling Efficient Updates in KV Storage via Hashing. In 2018 USENIX Annual Technical Conference (USENIX ATC 18). 1007--1019."},{"key":"e_1_2_1_14_1","volume-title":"19th USENIX Conference on File and Storage Technologies (FAST 21)","author":"Chen Hao","year":"2021","unstructured":"Hao Chen, Chaoyi Ruan, Cheng Li, Xiaosong Ma, and Yinlong Xu. 2021. SpanDB: A fast, cost-effective LSM-tree based KV store on hybrid storage. In 19th USENIX Conference on File and Storage Technologies (FAST 21). 17--32."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/3554821.3554832"},{"key":"e_1_2_1_16_1","volume-title":"14th USENIX Symposium on Operating Systems Design and Implementation (OSDI 20)","author":"Dai Yifan","year":"2020","unstructured":"Yifan Dai, Yien Xu, Aishwarya Ganesan, Ramnatthan Alagappan, Brian Kroth, Andrea Arpaci-Dusseau, and Remzi Arpaci-Dusseau. 2020. From WiscKey to Bourbon: A Learned Index for Log-Structured Merge Trees. In 14th USENIX Symposium on Operating Systems Design and Implementation (OSDI 20). 155--171."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064054"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196927"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457273"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551853"},{"key":"e_1_2_1_21_1","volume-title":"Retrieved","year":"2019","unstructured":"Dgraph. 2019. BadgerDB. Retrieved January 18, 2024 from https:\/\/dgraph.io\/docs\/badger\/"},{"key":"e_1_2_1_22_1","volume-title":"Ribbon filter: practically smaller than Bloom and Xor. arXiv preprint arXiv:2103.02515","author":"Dillinger Peter C","year":"2021","unstructured":"Peter C Dillinger and Stefan Walzer. 2021. Ribbon filter: practically smaller than Bloom and Xor. arXiv preprint arXiv:2103.02515 (2021)."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2022.3188268"},{"key":"e_1_2_1_24_1","volume-title":"Key-Value Stores on Flash Storage Devices: A Survey. arXiv preprint arXiv:2205.07975","author":"Doekemeijer Krijn","year":"2022","unstructured":"Krijn Doekemeijer and Animesh Trivedi. 2022. Key-Value Stores on Flash Storage Devices: A Survey. arXiv preprint arXiv:2205.07975 (2022)."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3483840"},{"key":"e_1_2_1_26_1","unstructured":"Paul DuBois. 2013. MySQL. Addison-Wesley."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149371"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2674005.2674994"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1147\/JRD.2019.2934048"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/3598581.3598584"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS47774.2020.00113"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/511399.511340"},{"key":"e_1_2_1_33_1","volume-title":"DLC: A New Compaction Scheme for LSM-tree with High Stability and Low Latency.. In EDBT. 547--557.","author":"Jin Peiquan","year":"2021","unstructured":"Peiquan Jin, Jianchuan Li, and Hai Long. 2021. DLC: A New Compaction Scheme for LSM-tree with High Stability and Low Latency.. In EDBT. 547--557."},{"key":"e_1_2_1_34_1","volume-title":"Retrieved","author":"The","year":"2024","unstructured":"The kernel development community. 2023. Journal (jbd2). Retrieved January 18, 2024 from https:\/\/www.kernel.org\/doc\/html\/latest\/filesystems\/ext4\/journal.html"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300071"},{"key":"e_1_2_1_36_1","volume-title":"16th USENIX Symposium on Operating Systems Design and Implementation (OSDI 22)","author":"Kim Wonbae","year":"2022","unstructured":"Wonbae Kim, Chanyeol Park, Dongui Kim, Hyeongjun Park, Young-ri Choi, Alan Sussman, and Beomseok Nam. 2022. ListDB: Union of Write-Ahead logs and persistent SkipLists for incremental checkpointing on persistent memory. In 16th USENIX Symposium on Operating Systems Design and Implementation (OSDI 22). 161--177."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3526167"},{"key":"e_1_2_1_38_1","volume-title":"SysBench manual. MySQL AB","author":"Kopytov Alexey","year":"2012","unstructured":"Alexey Kopytov. 2012. SysBench manual. MySQL AB (2012), 2--3."},{"key":"e_1_2_1_39_1","volume-title":"Retrieved","author":"Langley Adam","year":"2008","unstructured":"Adam Langley. 2008. Crit-bit Trees. Retrieved January 18, 2024 from https:\/\/www.imperialviolet.org\/binary\/critbit.pdf"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2023.103567"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544812"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.14778\/3384345.3384356"},{"key":"e_1_2_1_43_1","volume-title":"2021 USENIX Annual Technical Conference (USENIX ATC 21)","author":"Li Yongkun","year":"2021","unstructured":"Yongkun Li, Zhen Liu, Patrick PC Lee, Jiayu Wu, Yinlong Xu, Yi Wu, Liu Tang, Qi Liu, and Qiu Cui. 2021. Differentiated Key-Value Storage Management for Balanced I\/O Performance. In 2021 USENIX Annual Technical Conference (USENIX ATC 21). 673--687."},{"key":"e_1_2_1_44_1","volume-title":"ElasticBF: Elastic Bloom Filter with Hotness Awareness for Boosting Read Performance in Large Key-Value Stores. In 2019 USENIX Annual Technical Conference (USENIX ATC 19)","author":"Li Yongkun","year":"2019","unstructured":"Yongkun Li, Chengjin Tian, Fan Guo, Cheng Li, and Yinlong Xu. 2019. ElasticBF: Elastic Bloom Filter with Hotness Awareness for Boosting Read Performance in Large Key-Value Stores. In 2019 USENIX Annual Technical Conference (USENIX ATC 19). 739--752."},{"key":"e_1_2_1_45_1","volume-title":"Towards Accurate and Fast Evaluation of Multi-Stage Log-structured Designs. In 14th USENIX Conference on File and Storage Technologies (FAST 16)","author":"Lim Hyeontaek","year":"2016","unstructured":"Hyeontaek Lim, David G Andersen, and Michael Kaminsky. 2016. Towards Accurate and Fast Evaluation of Multi-Stage Log-structured Designs. In 14th USENIX Conference on File and Storage Technologies (FAST 16). 149--166."},{"key":"e_1_2_1_46_1","volume-title":"Retrieved","year":"2023","unstructured":"LogDevice. 2023. LogDB. Retrieved January 18, 2024 from https:\/\/logdevice.io\/docs\/LogsDB.html"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3118599"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033273"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3492321.3519567"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00555-y"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389731"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-020-00638-1"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1186\/s40537-023-00734-3"},{"key":"e_1_2_1_54_1","volume-title":"Retrieved","year":"2018","unstructured":"Meta. 2018. RocksDB Wiki: Data Block Hash Index. Retrieved January 18, 2024 from https:\/\/github.com\/facebook\/rocksdb\/wiki\/Data-Block-Hash-Index"},{"key":"e_1_2_1_55_1","volume-title":"Retrieved","year":"2022","unstructured":"Meta. 2022. RocksDB Wiki: BlobDB. Retrieved January 18, 2024 from https:\/\/github.com\/facebook\/rocksdb\/wiki\/BlobDB"},{"key":"e_1_2_1_56_1","volume-title":"Retrieved","year":"2022","unstructured":"Meta. 2022. RocksDB Wiki: Performance Benchmarks. Retrieved January 18, 2024 from https:\/\/github.com\/facebook\/rocksdb\/wiki\/Performance-Benchmarks"},{"key":"e_1_2_1_57_1","volume-title":"PostgreSQL: introduction and concepts","author":"Momjian Bruce","unstructured":"Bruce Momjian. 2001. PostgreSQL: introduction and concepts. Vol. 192. Addison-Wesley New York."},{"key":"e_1_2_1_58_1","volume-title":"bloomRF: On performing range-queries in Bloom-Filters with piecewise-monotone hash functions and prefix hashing. arXiv preprint arXiv:2207.04789","author":"M\u00f6\u00dfner Bernhard","year":"2022","unstructured":"Bernhard M\u00f6\u00dfner, Christian Riegger, Arthur Bernhardt, and Ilia Petrov. 2022. bloomRF: On performing range-queries in Bloom-Filters with piecewise-monotone hash functions and prefix hashing. arXiv preprint arXiv:2207.04789 (2022)."},{"key":"e_1_2_1_59_1","volume-title":"Proceedings of the International Workshop on Accelerating Data Management Systems Using Modern Processor and Storage Architectures (ADMS).","author":"Mun Ju Hyoung","year":"2022","unstructured":"Ju Hyoung Mun, Zichen Zhu, Aneesh Raman, and Manos Athanassoulis. 2022. LSM-Tree Under (Memory) Pressure. In Proceedings of the International Workshop on Accelerating Data Management Systems Using Modern Processor and Storage Architectures (ADMS)."},{"key":"e_1_2_1_60_1","first-page":"1","article-title":"Time series databases and InfluxDB. Studienarbeit","volume":"12","author":"Zehra Naqvi Syeda Noor","year":"2017","unstructured":"Syeda Noor Zehra Naqvi, Sofia Yfantidou, and Esteban Zim\u00e1nyi. 2017. Time series databases and InfluxDB. Studienarbeit, Universit\u00e9 Libre de Bruxelles 12 (2017), 1--44.","journal-title":"Universit\u00e9 Libre de Bruxelles"},{"key":"e_1_2_1_61_1","volume-title":"20th USENIX Conference on File and Storage Technologies (FAST 22)","author":"Oh Joontaek","year":"2022","unstructured":"Joontaek Oh, Sion Ji, Yongjin Kim, and Youjip Won. 2022. exF2FS: Transaction Support in Log-Structured Filesystem. In 20th USENIX Conference on File and Storage Technologies (FAST 22). 345--362."},{"key":"e_1_2_1_62_1","first-page":"4","article-title":"The Log-structured Merge-tree (LSM-tree)","volume":"33","author":"O'Neil Patrick","year":"1996","unstructured":"Patrick O'Neil, Edward Cheng, Dieter Gawlick, and Elizabeth O'Neil. 1996. The Log-structured Merge-tree (LSM-tree). Acta Inf. 33, 4 (June 1996), 351--385.","journal-title":"Acta Inf."},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10766-016-0472-z"},{"key":"e_1_2_1_64_1","volume-title":"19th USENIX Conference on File and Storage Technologies (FAST 21)","author":"Pan Satadru","year":"2021","unstructured":"Satadru Pan, Theano Stavrinos, Yunqiao Zhang, Atul Sikaria, Pavel Zakharov, Abhinav Sharma, Mike Shuey, Richard Wareing, Monika Gangapuram, Guanglei Cao, et al. 2021. Facebook's tectonic filesystem: Efficiency from exascale. In 19th USENIX Conference on File and Storage Technologies (FAST 21). 217--231."},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDEW.2018.00025"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/3329785.3329927"},{"key":"e_1_2_1_67_1","volume-title":"Retrieved","author":"CAP.","year":"2023","unstructured":"PingCAP. 2023. Titan. Retrieved January 18, 2024 from https:\/\/github.com\/tikv\/titan"},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178487.3178498"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.14778\/3151106.3151108"},{"key":"e_1_2_1_70_1","doi-asserted-by":"crossref","unstructured":"Kenneth Salem and Hector Garcia-Molina. 1989. Checkpointing memory-resident databases. In ICDE. 452--462.","DOI":"10.1109\/ICDE.1989.47249"},{"key":"e_1_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3522563"},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00273"},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00097"},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2022.3149003"},{"key":"e_1_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2011.031611.00024"},{"key":"e_1_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.14778\/3529337.3529347"},{"key":"e_1_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1145\/2523616.2523633"},{"key":"e_1_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00279"},{"key":"e_1_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1145\/3600006.3613147"},{"key":"e_1_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196931"},{"key":"e_1_2_1_81_1","volume-title":"Scavenger: Better Space-Time Trade-Offs for Key-Value Separated LSM-trees. In 2024 IEEE 40th International Conference on Data Engineering (ICDE). IEEE, 4072--4085","author":"Zhang Jianshun","year":"2024","unstructured":"Jianshun Zhang, Fang Wang, Sheng Qiu, Yi Wang, Jiaxin Ou, Junxun Huang, Baoquan Li, Peng Fang, and Dan Feng. 2024. Scavenger: Better Space-Time Trade-Offs for Key-Value Separated LSM-trees. In 2024 IEEE 40th International Conference on Data Engineering (ICDE). IEEE, 4072--4085."},{"key":"e_1_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00034"},{"key":"e_1_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1145\/3530903"},{"key":"e_1_2_1_84_1","volume-title":"Retrieved","author":"Zheng Zhiquan","year":"2019","unstructured":"Zhiquan Zheng. 2019. Titan: A RocksDB Plugin to Reduce Write Amplification. Retrieved January 18, 2024 from https:\/\/www.pingcap.com\/blog\/titan-storage-engine-design-and-implementation"},{"key":"e_1_2_1_85_1","volume-title":"REMIX: Efficient Range Query for LSM-trees. In 19th USENIX Conference on File and Storage Technologies (FAST 21)","author":"Zhong Wenshao","year":"2021","unstructured":"Wenshao Zhong, Chen Chen, Xingbo Wu, and Song Jiang. 2021. REMIX: Efficient Range Query for LSM-trees. In 19th USENIX Conference on File and Storage Technologies (FAST 21). 51--64."},{"key":"e_1_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465998.3466002"},{"key":"e_1_2_1_87_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3526187"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3685800.3685807","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T05:33:34Z","timestamp":1735623214000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3685800.3685807"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8]]},"references-count":87,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["10.14778\/3685800.3685807"],"URL":"https:\/\/doi.org\/10.14778\/3685800.3685807","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2024,8]]},"assertion":[{"value":"2024-11-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}