{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T07:14:35Z","timestamp":1784099675243,"version":"3.55.0"},"reference-count":95,"publisher":"Association for Computing Machinery (ACM)","issue":"11","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2022,7]]},"abstract":"<jats:p>\n            Modern storage engines and key-value stores have come to rely on the log-structured merge-tree (LSM-tree) as their core data structure. LSM-tree operates by gradually merge-sorting data across levels of exponentially increasing capacities in storage. A crucial design dimension of LSM-tree is its compaction granularity. Some designs perform\n            <jats:italic>Full Merge<\/jats:italic>\n            , whereby entire levels get compacted at once. Others perform\n            <jats:italic>Partial Merge<\/jats:italic>\n            , whereby smaller groups of files with overlapping key ranges are compacted independently. This paper shows that both strategies exhibit serious flaws. With Full Merge, space-amplification is exorbitant. The reason is that while compacting the LSM-tree's largest level, there must be at least twice as much storage space as data to store both the original and new files until the compaction is finished. On the other hand, Partial Merge exhibits excessive write-amplification. The reason is twofold. (1) The files getting compacted typically do not have perfectly overlapping key ranges, and so some non-overlapping data is superfluously rewritten in each compaction. (2) Files with different lifetimes become interspersed within the SSD leading to high SSD garbage-collection overheads. As the data size grows, these problems grow in magnitude.\n          <\/jats:p>\n          <jats:p>We introduce Spooky, a novel compaction granulation method to address these problems. Spooky partitions data at the largest level into equally sized files, and it partitions data at smaller levels based on the file boundaries at the largest level. This allows merging one group of perfectly overlapping files at a time to limit space-amplification and compaction overheads. At the same time, Spooky writes larger though fewer files simultaneously so that files with different lifetimes do not become as interspersed within the SSD. This cheapens garbage-collection. We show empirically that Spooky achieves &gt;2x lower space-amplification than Full Merge and &gt;2x lower write-amplification than Partial Merge at the same time.<\/jats:p>","DOI":"10.14778\/3551793.3551853","type":"journal-article","created":{"date-parts":[[2022,9,29]],"date-time":"2022-09-29T22:25:03Z","timestamp":1664490303000},"page":"3071-3084","source":"Crossref","is-referenced-by-count":52,"title":["Spooky"],"prefix":"10.14778","volume":"15","author":[{"given":"Niv","family":"Dayan","sequence":"first","affiliation":[{"name":"University of Toronto"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tamar","family":"Weiss","sequence":"additional","affiliation":[{"name":"Pliops"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shmuel","family":"Dashevsky","sequence":"additional","affiliation":[{"name":"Pliops"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Pan","sequence":"additional","affiliation":[{"name":"Pliops"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Edward","family":"Bortnikov","sequence":"additional","affiliation":[{"name":"Pliops"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Moshe","family":"Twitto","sequence":"additional","affiliation":[{"name":"Pliops"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,9,29]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Design Tradeoffs for SSD Performance. ATC","author":"Agrawal Nitin","year":"2008","unstructured":"Nitin Agrawal , Vijayan Prabhakaran , Ted Wobber , John D. Davis , Mark Manasse , and Rina Panigrahy . 2008. Design Tradeoffs for SSD Performance. ATC ( 2008 ). Nitin Agrawal, Vijayan Prabhakaran, Ted Wobber, John D. Davis, Mark Manasse, and Rina Panigrahy. 2008. Design Tradeoffs for SSD Performance. ATC (2008)."},{"key":"e_1_2_1_2_1","volume-title":"Compaction management in distributed key-value datastores. PVLDB","author":"Ahmad Muhammad Yousuf","year":"2015","unstructured":"Muhammad Yousuf Ahmad and Bettina Kemme . 2015. Compaction management in distributed key-value datastores. PVLDB ( 2015 ). Muhammad Yousuf Ahmad and Bettina Kemme. 2015. Compaction management in distributed key-value datastores. PVLDB (2015)."},{"key":"e_1_2_1_3_1","volume-title":"http:\/\/cassandra.apache.org","year":"2022","unstructured":"Apache. 2022. Cassandra. http:\/\/cassandra.apache.org ( 2022 ). Apache. 2022. Cassandra. http:\/\/cassandra.apache.org (2022)."},{"key":"e_1_2_1_4_1","volume-title":"http:\/\/hbase.apache.org\/","year":"2022","unstructured":"Apache. 2022. HBase. http:\/\/hbase.apache.org\/ ( 2022 ). Apache. 2022. HBase. http:\/\/hbase.apache.org\/ (2022)."},{"key":"e_1_2_1_5_1","volume-title":"GPU LSM: A dynamic dictionary data structure for the GPU","author":"Ashkiani Saman","year":"2018","unstructured":"Saman Ashkiani , Shengren Li , Martin Farach-Colton , Nina Amenta , and John D Owens . 2018 . GPU LSM: A dynamic dictionary data structure for the GPU . In IEEE IPDPS. IEEE. Saman Ashkiani, Shengren Li, Martin Farach-Colton, Nina Amenta, and John D Owens. 2018. GPU LSM: A dynamic dictionary data structure for the GPU. In IEEE IPDPS. IEEE."},{"key":"e_1_2_1_6_1","volume-title":"Designing Access Methods: The RUM Conjecture. EDBT","author":"Athanassoulis Manos","year":"2016","unstructured":"Manos Athanassoulis , Michael S. Kester , Lukas M. Maas , Radu Stoica , Stratos Idreos , Anastasia Ailamaki , and Mark Callaghan . 2016. Designing Access Methods: The RUM Conjecture. EDBT ( 2016 ). Manos Athanassoulis, Michael S. Kester, Lukas M. Maas, Radu Stoica, Stratos Idreos, Anastasia Ailamaki, and Mark Callaghan. 2016. Designing Access Methods: The RUM Conjecture. EDBT (2016)."},{"key":"e_1_2_1_7_1","volume-title":"TRIAD: Creating Synergies Between Memory, Disk and Log in Log Structured Key-Value Stores. USENIX ATC","author":"Balmau Oana","year":"2017","unstructured":"Oana Balmau , Diego Didona , Rachid Guerraoui , Willy Zwaenepoel , Huapeng Yuan , Aashray Arora , Karan Gupta , and Pavan Konka . 2017 . TRIAD: Creating Synergies Between Memory, Disk and Log in Log Structured Key-Value Stores. USENIX ATC (2017). Oana Balmau, Diego Didona, Rachid Guerraoui, Willy Zwaenepoel, Huapeng Yuan, Aashray Arora, Karan Gupta, and Pavan Konka. 2017. TRIAD: Creating Synergies Between Memory, Disk and Log in Log Structured Key-Value Stores. USENIX ATC (2017)."},{"key":"e_1_2_1_8_1","volume-title":"SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores. In USENIX ATC.","author":"Balmau Oana","year":"2019","unstructured":"Oana Balmau , Florin Dinu , Willy Zwaenepoel , Karan Gupta , Ravishankar Chandhiramoorthi , and Diego Didona . 2019 . SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores. In USENIX ATC. Oana Balmau, Florin Dinu, Willy Zwaenepoel, Karan Gupta, Ravishankar Chandhiramoorthi, and Diego Didona. 2019. SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores. In USENIX ATC."},{"key":"e_1_2_1_9_1","unstructured":"Oana Balmau Florin Dinu Willy Zwaenepoel Karan Gupta Ravishankar Chandhiramoorthi and Diego Didona. 2020. Silk+ preventing latency spikes in log-structured merge key-value stores running heterogeneous workloads. TOCS (2020).  Oana Balmau Florin Dinu Willy Zwaenepoel Karan Gupta Ravishankar Chandhiramoorthi and Diego Didona. 2020. Silk+ preventing latency spikes in log-structured merge key-value stores running heterogeneous workloads. TOCS (2020)."},{"key":"e_1_2_1_10_1","volume-title":"Cache-Oblivious Streaming B-trees. SPAA","author":"Bender Michael A.","year":"2007","unstructured":"Michael A. Bender , Martin Farach-Colton , Jeremy T. Fineman , Yonatan R. Fogel , Bradley C. Kuszmaul , and Jelani Nelson . 2007. Cache-Oblivious Streaming B-trees. SPAA ( 2007 ). Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Yonatan R. Fogel, Bradley C. Kuszmaul, and Jelani Nelson. 2007. Cache-Oblivious Streaming B-trees. SPAA (2007)."},{"key":"e_1_2_1_11_1","volume-title":"Gregory R Ganger, and George Amvrosiadis.","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 . 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."},{"key":"e_1_2_1_12_1","volume-title":"The Necessary Death of the Block Device Interface. CIDR","author":"Bj\u00f8rling Matias","year":"2013","unstructured":"Matias Bj\u00f8rling , Philippe Bonnet , Luc Bouganim , and Niv Dayan . 2013. The Necessary Death of the Block Device Interface. CIDR ( 2013 ). Matias Bj\u00f8rling, Philippe Bonnet, Luc Bouganim, and Niv Dayan. 2013. The Necessary Death of the Block Device Interface. CIDR (2013)."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/3229863.3229873"},{"key":"e_1_2_1_15_1","volume-title":"Patrick P C Lee, and Yinlong Xu","author":"Chan Helen H W","year":"2018","unstructured":"Helen H W Chan , Yongkun Li , Patrick P C Lee, and Yinlong Xu . 2018 . HashKV: Enabling Efficient Updates in KV Storage via Hashing. ATC ( 2018). Helen H W Chan, Yongkun Li, Patrick P C Lee, and Yinlong Xu. 2018. HashKV: Enabling Efficient Updates in KV Storage via Hashing. ATC (2018)."},{"key":"e_1_2_1_16_1","volume-title":"Shridhar Iyer, Anshul Jaiswal, Ran Lei, Nikhil Simha, Wei Wang, Kevin Wilfong, Tim Williamson, and Serhat Yilmaz.","author":"Chen Guoqiang Jerry","year":"2016","unstructured":"Guoqiang Jerry Chen , Janet L Wiener , Shridhar Iyer, Anshul Jaiswal, Ran Lei, Nikhil Simha, Wei Wang, Kevin Wilfong, Tim Williamson, and Serhat Yilmaz. 2016 . Realtime data processing at facebook. In SIGMOD. Guoqiang Jerry Chen, Janet L Wiener, Shridhar Iyer, Anshul Jaiswal, Ran Lei, Nikhil Simha, Wei Wang, Kevin Wilfong, Tim Williamson, and Serhat Yilmaz. 2016. Realtime data processing at facebook. In SIGMOD."},{"key":"e_1_2_1_17_1","unstructured":"Gunhee Choi Kwanghee Lee Myunghoon Oh Jongmoo Choi Jhuyeong Jhin and Yongseok Oh. 2020. A New LSM-style Garbage Collection Scheme for ZNS SSDs. In USENIX HotStorage.  Gunhee Choi Kwanghee Lee Myunghoon Oh Jongmoo Choi Jhuyeong Jhin and Yongseok Oh. 2020. A New LSM-style Garbage Collection Scheme for ZNS SSDs. In USENIX HotStorage."},{"key":"e_1_2_1_18_1","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 USENIX OSDI.  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 USENIX OSDI."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064054"},{"key":"e_1_2_1_20_1","volume-title":"Optimal Bloom Filters and Adaptive Merging for LSM-Trees. TODS","author":"Dayan Niv","year":"2018","unstructured":"Niv Dayan , Manos Athanassoulis , and Stratos Idreos . 2018. Optimal Bloom Filters and Adaptive Merging for LSM-Trees. TODS ( 2018 ). Niv Dayan, Manos Athanassoulis, and Stratos Idreos. 2018. Optimal Bloom Filters and Adaptive Merging for LSM-Trees. TODS (2018)."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915219"},{"key":"e_1_2_1_22_1","volume-title":"Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging. SIGMOD","author":"Dayan Niv","year":"2018","unstructured":"Niv Dayan and Stratos Idreos . 2018 . Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging. SIGMOD (2018). Niv Dayan and Stratos Idreos. 2018. Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging. SIGMOD (2018)."},{"key":"e_1_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Niv Dayan and Stratos Idreos. 2019. The Log-Structured Merge-Bush & the Wacky Continuum. In SIGMOD.  Niv Dayan and Stratos Idreos. 2019. The Log-Structured Merge-Bush & the Wacky Continuum. In SIGMOD.","DOI":"10.1145\/3299869.3319903"},{"key":"e_1_2_1_24_1","volume-title":"Matias Bjorling, Philippe Bonnet, and Luc Bouganim.","author":"Dayan Niv","year":"2013","unstructured":"Niv Dayan , Martin Kj\u00e6r Svendsen , Matias Bjorling, Philippe Bonnet, and Luc Bouganim. 2013 . EagleTree: exploring the design space of SSD-based algorithms. VLDB ( 2013). Niv Dayan, Martin Kj\u00e6r Svendsen, Matias Bjorling, Philippe Bonnet, and Luc Bouganim. 2013. EagleTree: exploring the design space of SSD-based algorithms. VLDB (2013)."},{"key":"e_1_2_1_25_1","volume-title":"Chucky: A Succinct Cuckoo Filter for LSM-Tree. In SIGMOD.","author":"Dayan Niv","year":"2021","unstructured":"Niv Dayan and Moshe Twitto . 2021 . Chucky: A Succinct Cuckoo Filter for LSM-Tree. In SIGMOD. Niv Dayan and Moshe Twitto. 2021. Chucky: A Succinct Cuckoo Filter for LSM-Tree. In SIGMOD."},{"key":"e_1_2_1_26_1","volume-title":"Edward Bortnikov, Shmuel Dashevsky, Ofer Frishman, Evgeni Ginzburg, Igal Maly, et al.","author":"Dayan Niv","year":"2021","unstructured":"Niv Dayan , Moshe Twitto , Yuval Rochman , Uri Beitler , Itai Ben Zion , Edward Bortnikov, Shmuel Dashevsky, Ofer Frishman, Evgeni Ginzburg, Igal Maly, et al. 2021 . The end of Moore's law and the rise of the data processor. PVLDB ( 2021). Niv Dayan, Moshe Twitto, Yuval Rochman, Uri Beitler, Itai Ben Zion, Edward Bortnikov, Shmuel Dashevsky, Ofer Frishman, Evgeni Ginzburg, Igal Maly, et al. 2021. The end of Moore's law and the rise of the data processor. PVLDB (2021)."},{"key":"e_1_2_1_27_1","volume-title":"Analytic models of SSD write performance. ACM TOS","author":"Desnoyers Peter","year":"2014","unstructured":"Peter Desnoyers . 2014. Analytic models of SSD write performance. ACM TOS ( 2014 ). Peter Desnoyers. 2014. Analytic models of SSD write performance. ACM TOS (2014)."},{"key":"e_1_2_1_28_1","volume-title":"Toward a better understanding and evaluation of tree structures on flash ssds. VLDB","author":"Didona Diego","year":"2021","unstructured":"Diego Didona , Nikolas Ioannou , Radu Stoica , and Kornilios Kourtis . 2021. Toward a better understanding and evaluation of tree structures on flash ssds. VLDB ( 2021 ). Diego Didona, Nikolas Ioannou, Radu Stoica, and Kornilios Kourtis. 2021. Toward a better understanding and evaluation of tree structures on flash ssds. VLDB (2021)."},{"key":"e_1_2_1_29_1","volume-title":"Dillinger and Stefan Walzer","author":"Peter","year":"2021","unstructured":"Peter C. Dillinger and Stefan Walzer . 2021 . Ribbon filter: practically smaller than Bloom and Xor. CoRR ( 2021). Peter C. Dillinger and Stefan Walzer. 2021. Ribbon filter: practically smaller than Bloom and Xor. CoRR (2021)."},{"key":"e_1_2_1_30_1","volume-title":"Beng Chin Ooi, and Kian-Lee Tan","author":"Anh Dinh Tien Tuan","year":"2017","unstructured":"Tien Tuan Anh Dinh , Ji Wang , Gang Chen , Rui Liu , Beng Chin Ooi, and Kian-Lee Tan . 2017 . Blockbench : A framework for analyzing private blockchains. In SIGMOD. Tien Tuan Anh Dinh, Ji Wang, Gang Chen, Rui Liu, Beng Chin Ooi, and Kian-Lee Tan. 2017. Blockbench: A framework for analyzing private blockchains. In SIGMOD."},{"key":"e_1_2_1_31_1","volume-title":"Optimizing Space Amplification in RocksDB. CIDR","author":"Dong Siying","year":"2017","unstructured":"Siying Dong , Mark Callaghan , Leonidas Galanis , Dhruba Borthakur , Tony Savor , and Michael Strum . 2017. Optimizing Space Amplification in RocksDB. CIDR ( 2017 ). Siying Dong, Mark Callaghan, Leonidas Galanis, Dhruba Borthakur, Tony Savor, and Michael Strum. 2017. Optimizing Space Amplification in RocksDB. CIDR (2017)."},{"key":"e_1_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Siying Dong Andrew Kryczka Yanqin Jin and Michael Stumm. 2021. Evolution of Development Priorities in Key-value Stores Serving Large-scale Applications: The RocksDB Experience. In USENIX FAST.  Siying Dong Andrew Kryczka Yanqin Jin and Michael Stumm. 2021. Evolution of Development Priorities in Key-value Stores Serving Large-scale Applications: The RocksDB Experience. In USENIX FAST.","DOI":"10.1145\/3483840"},{"key":"e_1_2_1_33_1","volume-title":"https:\/\/github.com\/facebook\/rocksdb","author":"DB.","year":"2022","unstructured":"Facebook. 2022. Rocks DB. https:\/\/github.com\/facebook\/rocksdb ( 2022 ). Facebook. 2022. RocksDB. https:\/\/github.com\/facebook\/rocksdb (2022)."},{"key":"e_1_2_1_34_1","volume-title":"Scaling Concurrent Log-Structured Data Stores. EuroSys","author":"Golan-Gueta Guy","year":"2015","unstructured":"Guy Golan-Gueta , Edward Bortnikov , Eshcar Hillel , and Idit Keidar . 2015. Scaling Concurrent Log-Structured Data Stores. EuroSys ( 2015 ). Guy Golan-Gueta, Edward Bortnikov, Eshcar Hillel, and Idit Keidar. 2015. Scaling Concurrent Log-Structured Data Stores. EuroSys (2015)."},{"key":"e_1_2_1_35_1","volume-title":"https:\/\/github.com\/google\/leveldb\/","author":"DB.","year":"2022","unstructured":"Google. 2022. Level DB. https:\/\/github.com\/google\/leveldb\/ ( 2022 ). Google. 2022. LevelDB. https:\/\/github.com\/google\/leveldb\/ (2022)."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1508244.1508271"},{"key":"e_1_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Gui Huang Xuntao Cheng Jianying Wang Yujie Wang Dengcheng He Tieying Zhang Feifei Li Sheng Wang Wei Cao and Qiang Li. 2019. X-Engine: An optimized storage engine for large-scale E-commerce transaction processing. In SIGMOD.  Gui Huang Xuntao Cheng Jianying Wang Yujie Wang Dengcheng He Tieying Zhang Feifei Li Sheng Wang Wei Cao and Qiang Li. 2019. X-Engine: An optimized storage engine for large-scale E-commerce transaction processing. In SIGMOD.","DOI":"10.1145\/3299869.3314041"},{"key":"e_1_2_1_38_1","volume-title":"Real-Time Business Intelligence and Analytics","author":"Idreos Stratos","unstructured":"Stratos Idreos , Manos Athanassoulis , Niv Dayan , Demi Guo , Mike S Kester , Lukas Maas , and Kostas Zoumpatianos . 2015. Past and future steps for adaptive storage data systems: From shallow to deep adaptivity . In Real-Time Business Intelligence and Analytics . Springer . Stratos Idreos, Manos Athanassoulis, Niv Dayan, Demi Guo, Mike S Kester, Lukas Maas, and Kostas Zoumpatianos. 2015. Past and future steps for adaptive storage data systems: From shallow to deep adaptivity. In Real-Time Business Intelligence and Analytics. Springer."},{"key":"e_1_2_1_39_1","unstructured":"Stratos Idreos Niv Dayan Wilson Qin Mali Akmanalp Sophie Hilgard Andrew Ross James Lennon Varun Jain Harshita Gupta David Li etal 2019. Learning Key-Value Store Design. arXiv preprint arXiv:1907.05443 (2019).  Stratos Idreos Niv Dayan Wilson Qin Mali Akmanalp Sophie Hilgard Andrew Ross James Lennon Varun Jain Harshita Gupta David Li et al. 2019. Learning Key-Value Store Design. arXiv preprint arXiv:1907.05443 (2019)."},{"key":"e_1_2_1_40_1","unstructured":"Stratos Idreos Niv Dayan Wilson Qin Mali Akmanalp Sophie Hilgard Andrew Ross James Lennon Varun Jain Harshita Gupta David Li and Zichen Zhu. 2019. Design Continuums and the Path Toward Self-Designing Key-Value Stores that Know and Learn. In CIDR.  Stratos Idreos Niv Dayan Wilson Qin Mali Akmanalp Sophie Hilgard Andrew Ross James Lennon Varun Jain Harshita Gupta David Li and Zichen Zhu. 2019. Design Continuums and the Path Toward Self-Designing Key-Value Stores that Know and Learn. In CIDR."},{"key":"e_1_2_1_41_1","first-page":"64","article-title":"The Periodic Table of Data Structures","volume":"41","author":"Idreos Stratos","year":"2018","unstructured":"Stratos Idreos , Kostas Zoumpatianos , Manos Athanassoulis , Niv Dayan , Brian Hentschel , Michael S. Kester , Demi Guo , Lukas M. Maas , Wilson Qin , Abdul Wasay , and Yiyou Sun . 2018 . The Periodic Table of Data Structures . IEEE DEBULL 41 , 3 (2018), 64 -- 75 . Stratos Idreos, Kostas Zoumpatianos, Manos Athanassoulis, Niv Dayan, Brian Hentschel, Michael S. Kester, Demi Guo, Lukas M. Maas, Wilson Qin, Abdul Wasay, and Yiyou Sun. 2018. The Periodic Table of Data Structures. IEEE DEBULL 41, 3 (2018), 64--75.","journal-title":"IEEE DEBULL"},{"key":"e_1_2_1_42_1","unstructured":"Stratos Idreos Kostas Zoumpatianos Subarna Chatterjee Wilson Qin Abdul Wasay Brian Hentschel Mike Kester Niv Dayan Demi Guo Minseo Kang etal 2019. Learning data structure alchemy. IEEE DEBULL (2019).  Stratos Idreos Kostas Zoumpatianos Subarna Chatterjee Wilson Qin Abdul Wasay Brian Hentschel Mike Kester Niv Dayan Demi Guo Minseo Kang et al. 2019. Learning data structure alchemy. IEEE DEBULL (2019)."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3199671"},{"key":"e_1_2_1_44_1","unstructured":"Junsu Im Jinwook Bae Chanwoo Chung Sungjin Lee etal 2020. PinK: Highspeed In-storage Key-value Store with Bounded Tails. In USENIX ATC.  Junsu Im Jinwook Bae Chanwoo Chung Sungjin Lee et al. 2020. PinK: Highspeed In-storage Key-value Store with Bounded Tails. In USENIX ATC."},{"key":"e_1_2_1_45_1","volume-title":"Incremental Organization for Data Recording and Warehousing. VLDB","author":"Jagadish H. V.","year":"1997","unstructured":"H. V. Jagadish , P. P. S. Narayan , Sridhar Seshadri , S. Sudarshan , and Rama Kanneganti . 1997. Incremental Organization for Data Recording and Warehousing. VLDB ( 1997 ). H. V. Jagadish, P. P. S. Narayan, Sridhar Seshadri, S. Sudarshan, and Rama Kanneganti. 1997. Incremental Organization for Data Recording and Warehousing. VLDB (1997)."},{"key":"e_1_2_1_46_1","volume-title":"The Partitioned Exponential File for Database Storage Management. VLDBJ","author":"Jermaine Christopher","year":"2007","unstructured":"Christopher Jermaine , Edward Omiecinski , and Wai Gen Yee . 2007. The Partitioned Exponential File for Database Storage Management. VLDBJ ( 2007 ). Christopher Jermaine, Edward Omiecinski, and Wai Gen Yee. 2007. The Partitioned Exponential File for Database Storage Management. VLDBJ (2007)."},{"key":"e_1_2_1_47_1","volume-title":"DLC: A New Compaction Scheme for LSM-tree with High Stability and Low Latency. In EDBT.","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. Peiquan Jin, Jianchuan Li, and Hai Long. 2021. DLC: A New Compaction Scheme for LSM-tree with High Stability and Low Latency. In EDBT."},{"key":"e_1_2_1_48_1","unstructured":"Sudarsun Kannan Nitish Bhat Ada Gavrilovska Andrea Arpaci-Dusseau and Remzi Arpaci-Dusseau. 2018. Redesigning LSMs for nonvolatile memory with NoveLSM. In USENIX ATC.  Sudarsun Kannan Nitish Bhat Ada Gavrilovska Andrea Arpaci-Dusseau and Remzi Arpaci-Dusseau. 2018. Redesigning LSMs for nonvolatile memory with NoveLSM. In USENIX ATC."},{"key":"e_1_2_1_49_1","volume-title":"Coconut: A scalable bottom-up approach for building data series indexes. PVLDB","author":"Kondylakis Haridimos","year":"2018","unstructured":"Haridimos Kondylakis , Niv Dayan , Kostas Zoumpatianos , and Themis Palpanas . 2018 . Coconut: A scalable bottom-up approach for building data series indexes. PVLDB (2018). Haridimos Kondylakis, Niv Dayan, Kostas Zoumpatianos, and Themis Palpanas. 2018. Coconut: A scalable bottom-up approach for building data series indexes. PVLDB (2018)."},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3320233"},{"key":"e_1_2_1_51_1","volume-title":"Coconut: sortable summarizations for scalable indexes over static and streaming data series. VLDBJ","author":"Kondylakis Haridimos","year":"2019","unstructured":"Haridimos Kondylakis , Niv Dayan , Kostas Zoumpatianos , and Themis Palpanas . 2019. Coconut: sortable summarizations for scalable indexes over static and streaming data series. VLDBJ ( 2019 ). Haridimos Kondylakis, Niv Dayan, Kostas Zoumpatianos, and Themis Palpanas. 2019. Coconut: sortable summarizations for scalable indexes over static and streaming data series. VLDBJ (2019)."},{"key":"e_1_2_1_52_1","volume-title":"Cost-effective, LSM-tree-based KV Store. ACM TOS","author":"Li Cheng","year":"2021","unstructured":"Cheng Li , Hao Chen , Chaoyi Ruan , Xiaosong Ma , and Yinlong Xu. 2021. Leveraging NVMe SSDs for Building a Fast , Cost-effective, LSM-tree-based KV Store. ACM TOS ( 2021 ). Cheng Li, Hao Chen, Chaoyi Ruan, Xiaosong Ma, and Yinlong Xu. 2021. Leveraging NVMe SSDs for Building a Fast, Cost-effective, LSM-tree-based KV Store. ACM TOS (2021)."},{"key":"e_1_2_1_53_1","unstructured":"Jianchuan Li Peiquan Jin Yuanjin Lin Ming Zhao Yi Wang and Kuankuan Guo. 2021. Elastic and Stable Compaction for LSM-tree: A FaaS-Based Approach on TerarkDB. In CIKM.  Jianchuan Li Peiquan Jin Yuanjin Lin Ming Zhao Yi Wang and Kuankuan Guo. 2021. Elastic and Stable Compaction for LSM-tree: A FaaS-Based Approach on TerarkDB. In CIKM."},{"key":"e_1_2_1_54_1","first-page":"1","article-title":"Tree Indexing on Solid State Drives","volume":"3","author":"Li Yinan","year":"2010","unstructured":"Yinan Li , Bingsheng He , Jun Yang , Qiong Luo , Ke Yi , and Robin Jun Yang . 2010 . Tree Indexing on Solid State Drives . PVLDB 3 , 1 -- 2 (2010), 1195--1206. Yinan Li, Bingsheng He, Jun Yang, Qiong Luo, Ke Yi, and Robin Jun Yang. 2010. Tree Indexing on Solid State Drives. PVLDB 3, 1--2 (2010), 1195--1206.","journal-title":"PVLDB"},{"key":"e_1_2_1_55_1","unstructured":"Yongkun Li Zhen Liu Patrick P. C. 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 USENIX ATC.  Yongkun Li Zhen Liu Patrick P. C. 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 USENIX ATC."},{"key":"e_1_2_1_56_1","doi-asserted-by":"crossref","unstructured":"Junkai Liang and Yunpeng Chai. 2021. CruiseDB: An LSM-Tree Key-Value Store with Both Better Tail Throughput and Tail Latency. In ICDE.  Junkai Liang and Yunpeng Chai. 2021. CruiseDB: An LSM-Tree Key-Value Store with Both Better Tail Throughput and Tail Latency. In ICDE.","DOI":"10.1109\/ICDE51399.2021.00094"},{"key":"e_1_2_1_57_1","volume-title":"Towards Accurate and Fast Evaluation of Multi-Stage Log-structured Designs. FAST","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. FAST ( 2016 ). Hyeontaek Lim, David G. Andersen, and Michael Kaminsky. 2016. Towards Accurate and Fast Evaluation of Multi-Stage Log-structured Designs. FAST (2016)."},{"key":"e_1_2_1_58_1","volume-title":"Andrea C. Arpaci-Dusseau, and Remzi H. Arpaci-Dusseau.","author":"Lu Lanyue","year":"2016","unstructured":"Lanyue Lu , Thanumalayan Sankaranarayana Pillai , Andrea C. Arpaci-Dusseau, and Remzi H. Arpaci-Dusseau. 2016 . WiscKey: Separating Keys from Values in SSD-conscious Storage. FAST ( 2016). Lanyue Lu, Thanumalayan Sankaranarayana Pillai, Andrea C. Arpaci-Dusseau, and Remzi H. Arpaci-Dusseau. 2016. WiscKey: Separating Keys from Values in SSD-conscious Storage. FAST (2016)."},{"key":"e_1_2_1_59_1","volume-title":"On performance stability in LSM-based storage systems (extended version). VLDB","author":"Luo Chen","year":"2019","unstructured":"Chen Luo and Michael J Carey . 2019. On performance stability in LSM-based storage systems (extended version). VLDB ( 2019 ). Chen Luo and Michael J Carey. 2019. On performance stability in LSM-based storage systems (extended version). VLDB (2019)."},{"key":"e_1_2_1_60_1","volume-title":"LSM-based storage techniques: a survey. The VLDB Journal","author":"Luo Chen","year":"2020","unstructured":"Chen Luo and Michael J Carey . 2020. LSM-based storage techniques: a survey. The VLDB Journal ( 2020 ). Chen Luo and Michael J Carey. 2020. LSM-based storage techniques: a survey. The VLDB Journal (2020)."},{"key":"e_1_2_1_61_1","volume-title":"Umzi: Unified Multi-Zone Indexing for Large-Scale HTAP. In EDBT.","author":"Luo Chen","year":"2019","unstructured":"Chen Luo , Pinar T\u00f6z\u00fcn , Yuanyuan Tian , Ronald Barber , Vijayshankar Raman , and Richard Sidle . 2019 . Umzi: Unified Multi-Zone Indexing for Large-Scale HTAP. In EDBT. Chen Luo, Pinar T\u00f6z\u00fcn, Yuanyuan Tian, Ronald Barber, Vijayshankar Raman, and Richard Sidle. 2019. Umzi: Unified Multi-Zone Indexing for Large-Scale HTAP. In EDBT."},{"key":"e_1_2_1_62_1","volume-title":"Rosetta: A Robust Space-Time Optimized Range Filter for Key-Value Stores. In SIGMOD.","author":"Luo Siqiang","year":"2020","unstructured":"Siqiang Luo , Subarna Chatterjee , Rafael Ketsetsidis , Niv Dayan , Wilson Qin , and Stratos Idreos . 2020 . Rosetta: A Robust Space-Time Optimized Range Filter for Key-Value Stores. In SIGMOD. Siqiang Luo, Subarna Chatterjee, Rafael Ketsetsidis, Niv Dayan, Wilson Qin, and Stratos Idreos. 2020. Rosetta: A Robust Space-Time Optimized Range Filter for Key-Value Stores. In SIGMOD."},{"key":"e_1_2_1_63_1","volume-title":"Comparison and evaluation of state-of-the-art LSM merge policies. VLDB Journal","author":"Mao Qizhong","year":"2021","unstructured":"Qizhong Mao , Steven Jacobs , Waleed Amjad , Vagelis Hristidis , Vassilis J Tsotras , and Neal E Young . 2021. Comparison and evaluation of state-of-the-art LSM merge policies. VLDB Journal ( 2021 ). Qizhong Mao, Steven Jacobs, Waleed Amjad, Vagelis Hristidis, Vassilis J Tsotras, and Neal E Young. 2021. Comparison and evaluation of state-of-the-art LSM merge policies. VLDB Journal (2021)."},{"key":"e_1_2_1_64_1","volume-title":"Bigtable merge compaction. arXiv preprint arXiv:1407.3008","author":"Mathieu Claire","year":"2014","unstructured":"Claire Mathieu , Carl Staelin , Neal E Young , and Arman Yousefi . 2014. Bigtable merge compaction. arXiv preprint arXiv:1407.3008 ( 2014 ). Claire Mathieu, Carl Staelin, Neal E Young, and Arman Yousefi. 2014. Bigtable merge compaction. arXiv preprint arXiv:1407.3008 (2014)."},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.14778\/3415478.3415546"},{"key":"e_1_2_1_66_1","doi-asserted-by":"crossref","unstructured":"Fei Mei Qiang Cao Hong Jiang and Jingjun Li. 2018. SifrDB: A unified solution for write-optimized key-value stores in large datacenter. In ACM SOCC.  Fei Mei Qiang Cao Hong Jiang and Jingjun Li. 2018. SifrDB: A unified solution for write-optimized key-value stores in large datacenter. In ACM SOCC.","DOI":"10.1145\/3267809.3267829"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050048"},{"key":"e_1_2_1_68_1","doi-asserted-by":"crossref","unstructured":"Ivan Luiz Picoli Philippe Bonnet and Pinar T\u00f6z\u00fcn. 2019. LSM management on computational storage. In DaMoN.  Ivan Luiz Picoli Philippe Bonnet and Pinar T\u00f6z\u00fcn. 2019. LSM management on computational storage. In DaMoN.","DOI":"10.1145\/3329785.3329927"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132765"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.14778\/3151106.3151108"},{"key":"e_1_2_1_71_1","volume-title":"Dimitris Staratzis, and Manos Athanassoulis.","author":"Sarkar Subhadeep","year":"2020","unstructured":"Subhadeep Sarkar , Tarikul Islam Papon , Dimitris Staratzis, and Manos Athanassoulis. 2020 . Lethe : A Tunable Delete-Aware LSM Engine. In SIGMOD. Subhadeep Sarkar, Tarikul Islam Papon, Dimitris Staratzis, and Manos Athanassoulis. 2020. Lethe: A Tunable Delete-Aware LSM Engine. In SIGMOD."},{"key":"e_1_2_1_72_1","volume-title":"Constructing and Analyzing the LSM Compaction Design Space. VLDB","author":"Sarkar Subhadeep","year":"2021","unstructured":"Subhadeep Sarkar , Dimitris Staratzis , Zichen Zhu , and Manos Athanassoulis . 2021. Constructing and Analyzing the LSM Compaction Design Space. VLDB ( 2021 ). Subhadeep Sarkar, Dimitris Staratzis, Zichen Zhu, and Manos Athanassoulis. 2021. Constructing and Analyzing the LSM Compaction Design Space. VLDB (2021)."},{"key":"e_1_2_1_73_1","volume-title":"https:\/\/github.com\/scylladb\/scylladb","author":"DB.","year":"2022","unstructured":"Scylla DB. 2022. ScyllaDB. https:\/\/github.com\/scylladb\/scylladb ( 2022 ). ScyllaDB. 2022. ScyllaDB. https:\/\/github.com\/scylladb\/scylladb (2022)."},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213862"},{"key":"e_1_2_1_75_1","volume-title":"Improving Flash Write Performance by Using Update Frequency. PVLDB","author":"Stoica Radu","year":"2013","unstructured":"Radu Stoica and Anastasia Ailamaki . 2013. Improving Flash Write Performance by Using Update Frequency. PVLDB ( 2013 ). Radu Stoica and Anastasia Ailamaki. 2013. Improving Flash Write Performance by Using Update Frequency. PVLDB (2013)."},{"key":"e_1_2_1_76_1","volume-title":"On Log-Structured Merge for Solid-State Drives. ICDE","author":"Thonangi Risi","year":"2017","unstructured":"Risi Thonangi and Jun Yang . 2017. On Log-Structured Merge for Solid-State Drives. ICDE ( 2017 ). Risi Thonangi and Jun Yang. 2017. On Log-Structured Merge for Solid-State Drives. ICDE (2017)."},{"key":"e_1_2_1_77_1","unstructured":"Tobias Vin\u00e7on Sergej Hardock Christian Riegger Julian Oppermann Andreas Koch and Ilia Petrov. 2018. NoFTL-KV: Tackling Write-Amplification on KV-Stores with Native Storage Management.. In EDBT.  Tobias Vin\u00e7on Sergej Hardock Christian Riegger Julian Oppermann Andreas Koch and Ilia Petrov. 2018. NoFTL-KV: Tackling Write-Amplification on KV-Stores with Native Storage Management.. In EDBT."},{"key":"e_1_2_1_78_1","volume-title":"An Efficient Design and Implementation of LSM-Tree based Key-Value Store on Open-Channel SSD. EuroSys","author":"Wang Peng","year":"2014","unstructured":"Peng Wang , Guangyu Sun , Song Jiang , Jian Ouyang , Shiding Lin , Chen Zhang , and Jason Cong . 2014. An Efficient Design and Implementation of LSM-Tree based Key-Value Store on Open-Channel SSD. EuroSys ( 2014 ). Peng Wang, Guangyu Sun, Song Jiang, Jian Ouyang, Shiding Lin, Chen Zhang, and Jason Cong. 2014. An Efficient Design and Implementation of LSM-Tree based Key-Value Store on Open-Channel SSD. EuroSys (2014)."},{"key":"e_1_2_1_79_1","unstructured":"Fenggang Wu Ming-Hong Yang Baoquan Zhang and David HC Du. 2020. AC-key: Adaptive caching for LSM-based key-value stores. In USENIX ATC.  Fenggang Wu Ming-Hong Yang Baoquan Zhang and David HC Du. 2020. AC-key: Adaptive caching for LSM-based key-value stores. In USENIX ATC."},{"key":"e_1_2_1_80_1","volume-title":"LSM-trie: An LSM-tree-based Ultra-Large Key-Value Store for Small Data Items. USENIX ATC","author":"Wu Xingbo","year":"2015","unstructured":"Xingbo Wu , Yuehai Xu , Zili Shao , and Song Jiang . 2015. LSM-trie: An LSM-tree-based Ultra-Large Key-Value Store for Small Data Items. USENIX ATC ( 2015 ). Xingbo Wu, Yuehai Xu, Zili Shao, and Song Jiang. 2015. LSM-trie: An LSM-tree-based Ultra-Large Key-Value Store for Small Data Items. USENIX ATC (2015)."},{"key":"e_1_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1145\/3472883.3487012"},{"key":"e_1_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407803"},{"key":"e_1_2_1_83_1","volume-title":"A Light-weight Compaction Tree to Reduce I\/O Amplification toward Efficient Key-Value Stores. MSST","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. MSST ( 2017 ). 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. MSST (2017)."},{"key":"e_1_2_1_84_1","volume-title":"Building Efficient Key-Value Stores via a Lightweight Compaction Tree. TOS","author":"Yao Ting","year":"2017","unstructured":"Ting Yao , Jiguang Wan , Ping Huang , Xubin He , Fei Wu , and Changsheng Xie . 2017. Building Efficient Key-Value Stores via a Lightweight Compaction Tree. TOS ( 2017 ). Ting Yao, Jiguang Wan, Ping Huang, Xubin He, Fei Wu, and Changsheng Xie. 2017. Building Efficient Key-Value Stores via a Lightweight Compaction Tree. TOS (2017)."},{"key":"e_1_2_1_85_1","volume-title":"Geardb: A gc-free key-value store on hm-smr drives with gear compaction. In USENIX FAST.","author":"Yao Ting","year":"2019","unstructured":"Ting Yao , Jiguang Wan , Ping Huang , Yiwen Zhang , Zhiwen Liu , Changsheng Xie , and Xubin He . 2019 . Geardb: A gc-free key-value store on hm-smr drives with gear compaction. In USENIX FAST. Ting Yao, Jiguang Wan, Ping Huang, Yiwen Zhang, Zhiwen Liu, Changsheng Xie, and Xubin He. 2019. Geardb: A gc-free key-value store on hm-smr drives with gear compaction. In USENIX FAST."},{"key":"e_1_2_1_86_1","unstructured":"Ting Yao Yiwen Zhang Jiguang Wan Qiu Cui Liu Tang Hong Jiang Changsheng Xie and Xubin He. 2020. MatrixKV: Reducing Write Stalls and Write Amplification in LSM-tree Based KV Stores with Matrix Container in NVM. In USENIX ATC.  Ting Yao Yiwen Zhang Jiguang Wan Qiu Cui Liu Tang Hong Jiang Changsheng Xie and Xubin He. 2020. MatrixKV: Reducing Write Stalls and Write Amplification in LSM-tree Based KV Stores with Matrix Container in NVM. In USENIX ATC."},{"key":"e_1_2_1_87_1","volume-title":"Steinn E Sigurdarson, Ymir Vigfusson, and Ada Gavrilovska.","author":"Yoon Hobin","year":"2018","unstructured":"Hobin Yoon , Juncheng Yang , Sveinn Fannar Kristjansson , Steinn E Sigurdarson, Ymir Vigfusson, and Ada Gavrilovska. 2018 . Mutant : Balancing storage cost and latency in lsm-tree data stores. In ACM SOCC. Hobin Yoon, Juncheng Yang, Sveinn Fannar Kristjansson, Steinn E Sigurdarson, Ymir Vigfusson, and Ada Gavrilovska. 2018. Mutant: Balancing storage cost and latency in lsm-tree data stores. In ACM SOCC."},{"key":"e_1_2_1_88_1","volume-title":"Building an Efficient Put-Intensive Key-Value Store with Skip-Tree. TPDS","author":"Yue Yinliang","year":"2017","unstructured":"Yinliang Yue , Bingsheng He , Yuzhe Li , and Weiping Wang . 2017. Building an Efficient Put-Intensive Key-Value Store with Skip-Tree. TPDS ( 2017 ). Yinliang Yue, Bingsheng He, Yuzhe Li, and Weiping Wang. 2017. Building an Efficient Put-Intensive Key-Value Store with Skip-Tree. TPDS (2017)."},{"key":"e_1_2_1_89_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600212.2600213"},{"key":"e_1_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196931"},{"key":"e_1_2_1_91_1","unstructured":"Teng Zhang Jianying Wang Xuntao Cheng Hao Xu Nanlong Yu Gui Huang Tieying Zhang Dengcheng He Feifei Li Wei Cao etal 2020. FPGA-Accelerated Compactions for LSM-based Key-Value Store. In USENIX FAST.  Teng Zhang Jianying Wang Xuntao Cheng Hao Xu Nanlong Yu Gui Huang Tieying Zhang Dengcheng He Feifei Li Wei Cao et al. 2020. FPGA-Accelerated Compactions for LSM-based Key-Value Store. In USENIX FAST."},{"key":"e_1_2_1_92_1","volume-title":"Improving write performance of LSMT-based key-value store","author":"Zhang Weitao","unstructured":"Weitao Zhang , Yinlong Xu , Yongkun Li , and Dinglong Li. 2016. Improving write performance of LSMT-based key-value store . In IEEE ICPADS. Weitao Zhang, Yinlong Xu, Yongkun Li, and Dinglong Li. 2016. Improving write performance of LSMT-based key-value store. In IEEE ICPADS."},{"key":"e_1_2_1_93_1","volume-title":"ElasticBF: Fine-grained and Elastic Bloom Filter Towards Efficient Read for LSM-tree-based KV Stores. HotStorage","author":"Zhang Yueming","year":"2018","unstructured":"Yueming Zhang , Yongkun Li , Fan Guo , Cheng Li , and Yinlong Xu. 2018. ElasticBF: Fine-grained and Elastic Bloom Filter Towards Efficient Read for LSM-tree-based KV Stores. HotStorage ( 2018 ). Yueming Zhang, Yongkun Li, Fan Guo, Cheng Li, and Yinlong Xu. 2018. ElasticBF: Fine-grained and Elastic Bloom Filter Towards Efficient Read for LSM-tree-based KV Stores. HotStorage (2018)."},{"key":"e_1_2_1_94_1","volume-title":"REMIX: Efficient Range Query for LSM-trees. In USENIX FAST.","author":"Zhong Wenshao","year":"2021","unstructured":"Wenshao Zhong , Chen Chen , Xingbo Wu , and Song Jiang . 2021 . REMIX: Efficient Range Query for LSM-trees. In USENIX FAST. Wenshao Zhong, Chen Chen, Xingbo Wu, and Song Jiang. 2021. REMIX: Efficient Range Query for LSM-trees. In USENIX FAST."},{"key":"e_1_2_1_95_1","volume-title":"Aneesh Raman, and Manos Athanassoulis.","author":"Zhu Zichen","year":"2021","unstructured":"Zichen Zhu , Ju Hyoung Mun , Aneesh Raman, and Manos Athanassoulis. 2021 . Reducing Bloom Filter CPU Overhead in LSM-Trees on Modern Storage Devices. In DaMoN. Zichen Zhu, Ju Hyoung Mun, Aneesh Raman, and Manos Athanassoulis. 2021. Reducing Bloom Filter CPU Overhead in LSM-Trees on Modern Storage Devices. In DaMoN."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3551793.3551853","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:51:07Z","timestamp":1672224667000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3551793.3551853"}},"subtitle":["granulating LSM-tree compactions correctly"],"short-title":[],"issued":{"date-parts":[[2022,7]]},"references-count":95,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["10.14778\/3551793.3551853"],"URL":"https:\/\/doi.org\/10.14778\/3551793.3551853","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2022,7]]}}}