{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T09:02:55Z","timestamp":1775638975883,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":99,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T00:00:00Z","timestamp":1623196800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,9]]},"DOI":"10.1145\/3448016.3457273","type":"proceedings-article","created":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T17:22:39Z","timestamp":1624036959000},"page":"365-378","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":51,"title":["Chucky: A Succinct Cuckoo Filter for LSM-Tree"],"prefix":"10.1145","author":[{"given":"Niv","family":"Dayan","sequence":"first","affiliation":[{"name":"Pliops, Ramat Gan, Israel"}]},{"given":"Moshe","family":"Twitto","sequence":"additional","affiliation":[{"name":"Pliops, Ramat Gan, Israel"}]}],"member":"320","published-online":{"date-parts":[[2021,6,18]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.14778\/2757807.2757810"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733096"},{"key":"e_1_3_2_2_3_1","unstructured":"Apache. Cassandra. http:\/\/cassandra.apache.org.  Apache. Cassandra. http:\/\/cassandra.apache.org."},{"key":"e_1_3_2_2_4_1","unstructured":"Apache. HBase. http:\/\/hbase.apache.org\/.  Apache. HBase. http:\/\/hbase.apache.org\/."},{"key":"e_1_3_2_2_5_1","volume-title":"Design Tradeoffs of Data Access Methods. SIGMOD","author":"Athanassoulis M.","year":"2016","unstructured":"Athanassoulis , M. , and Idreos , S . Design Tradeoffs of Data Access Methods. SIGMOD ( 2016 ). Athanassoulis, M., and Idreos, S. Design Tradeoffs of Data Access Methods. SIGMOD (2016)."},{"key":"e_1_3_2_2_6_1","volume-title":"Designing Access Methods: The RUM Conjecture. EDBT","author":"Athanassoulis M.","year":"2016","unstructured":"Athanassoulis , M. , Kester , M. S. , Maas , L. M. , Stoica , R. , Idreos , S. , Ailamaki , A. , and Callaghan , M . Designing Access Methods: The RUM Conjecture. EDBT ( 2016 ). Athanassoulis, M., Kester, M. S., Maas, L. M., Stoica, R., Idreos, S., Ailamaki, A., and Callaghan, M. Designing Access Methods: The RUM Conjecture. EDBT (2016)."},{"key":"e_1_3_2_2_7_1","volume-title":"TRIAD: Creating Synergies Between Memory, Disk and Log in Log Structured Key-Value Stores. USENIX ATC","author":"Balmau O.","year":"2017","unstructured":"Balmau , O. , Didona , D. , Guerraoui , R. , Zwaenepoel , W. , Yuan , H. , Arora , A. , Gupta , K. , and Konka , P . TRIAD: Creating Synergies Between Memory, Disk and Log in Log Structured Key-Value Stores. USENIX ATC ( 2017 ). Balmau, O., Didona, D., Guerraoui, R., Zwaenepoel, W., Yuan, H., Arora, A., Gupta, K., and Konka, P. TRIAD: Creating Synergies Between Memory, Disk and Log in Log Structured Key-Value Stores. USENIX ATC (2017)."},{"key":"e_1_3_2_2_8_1","volume-title":"USENIX ATC","author":"Balmau O.","year":"2019","unstructured":"Balmau , O. , Dinu , F. , Zwaenepoel , W. , Gupta , K. , Chandhiramoorthi , R. , and Didona , D . $$SILK$$: Preventing latency spikes in log-structured merge key-value stores . In USENIX ATC ( 2019 ). Balmau, O., Dinu, F., Zwaenepoel, W., Gupta, K., Chandhiramoorthi, R., and Didona, D. $$SILK$$: Preventing latency spikes in log-structured merge key-value stores. In USENIX ATC (2019)."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350275"},{"key":"e_1_3_2_2_10_1","volume-title":"The Necessary Death of the Block Device Interface. CIDR","author":"Bj\u00f8rling M.","year":"2013","unstructured":"Bj\u00f8rling , M. , Bonnet , P. , Bouganim , L. , and Dayan , N . The Necessary Death of the Block Device Interface. CIDR ( 2013 ). Bj\u00f8rling, M., Bonnet, P., Bouganim, L., and Dayan, N. The Necessary Death of the Block Device Interface. CIDR (2013)."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_2_12_1","volume-title":"Solid-state storage device flash translation layer","author":"Bonnet P.","year":"2017","unstructured":"Bonnet , P. , and Dayan , N . Solid-state storage device flash translation layer , 2017 . US Patent App . 15\/056,381. Bonnet, P., and Dayan, N. Solid-state storage device flash translation layer, 2017. US Patent App. 15\/056,381."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_61"},{"key":"e_1_3_2_2_14_1","first-page":"12","article-title":"Accordion","volume":"11","author":"Bortnikov E.","year":"2018","unstructured":"Bortnikov , E. , Braginsky , A. , Hillel , E. , Keidar , I. , and Sheffi , G . Accordion : Better Memory Organization for LSM Key-Value Stores. PVLDB 11 , 12 ( 2018 ), 1863--1875. Bortnikov, E., Braginsky, A., Hillel, E., Keidar, I., and Sheffi, G. Accordion: Better Memory Organization for LSM Key-Value Stores. PVLDB 11, 12 (2018), 1863--1875.","journal-title":"Better Memory Organization for LSM Key-Value Stores. PVLDB"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/3213880.3213884"},{"key":"e_1_3_2_2_16_1","first-page":"636","volume":"1","author":"Broder A. Z.","year":"2002","unstructured":"Broder , A. Z. , and Mitzenmacher , M . Network Applications of Bloom Filters: A Survey. Internet Mathematics 1 ( 2002 ), 636 -- 646 . Broder, A. Z., and Mitzenmacher, M. Network Applications of Bloom Filters: A Survey. Internet Mathematics 1 (2002), 636--646.","journal-title":"Network Applications of Bloom Filters: A Survey. Internet Mathematics"},{"key":"e_1_3_2_2_17_1","first-page":"1","volume":"3","author":"Canim M.","year":"2010","unstructured":"Canim , M. , Mihaila , G. A. , Bhattacharjee , B. , Ross , K. A. , and Lang , C. A . SSD Bufferpool Extensions for Database Systems. PVLDB 3 , 1 -- 2 ( 2010 ), 1435--1446. Canim, M., Mihaila, G. A., Bhattacharjee, B., Ross, K. A., and Lang, C. A. SSD Bufferpool Extensions for Database Systems. PVLDB 3, 1--2 (2010), 1435--1446.","journal-title":"SSD Bufferpool Extensions for Database Systems. PVLDB"},{"key":"e_1_3_2_2_18_1","volume-title":"HashKV: Enabling Efficient Updates in KV Storage via Hashing. ATC","author":"Chan H. H. W.","year":"2018","unstructured":"Chan , H. H. W. , Li , Y. , Lee , P. P. C. , and Xu , Y . HashKV: Enabling Efficient Updates in KV Storage via Hashing. ATC ( 2018 ). Chan, H. H. W., Li, Y., Lee, P. P. C., and Xu, Y. HashKV: Enabling Efficient Updates in KV Storage via Hashing. ATC (2018)."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87744-8_22"},{"key":"e_1_3_2_2_20_1","volume-title":"Symposium on Discrete Algorithms","author":"Chazelle B.","year":"2004","unstructured":"Chazelle , B. , Kilian , J. , Rubinfeld , R. , and Tal , A . The bloomier filter: an efficient data structure for static support lookup tables . In Symposium on Discrete Algorithms ( 2004 ). Chazelle, B., Kilian, J., Rubinfeld, R., and Tal, A. The bloomier filter: an efficient data structure for static support lookup tables. In Symposium on Discrete Algorithms (2004)."},{"key":"e_1_3_2_2_21_1","volume-title":"J. L., Iyer, S., Jaiswal, A., Lei, R., Simha, N., Wang, W., Wilfong, K., Williamson, T., and Yilmaz, S. Realtime data processing at facebook. In SIGMOD","author":"Chen G. J.","year":"2016","unstructured":"Chen , G. J. , Wiener , J. L., Iyer, S., Jaiswal, A., Lei, R., Simha, N., Wang, W., Wilfong, K., Williamson, T., and Yilmaz, S. Realtime data processing at facebook. In SIGMOD ( 2016 ). Chen, G. J., Wiener, J. L., Iyer, S., Jaiswal, A., Lei, R., Simha, N., Wang, W., Wilfong, K., Williamson, T., and Yilmaz, S. Realtime data processing at facebook. In SIGMOD (2016)."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2017.8117563"},{"key":"e_1_3_2_2_23_1","volume-title":"Benchmarking cloud serving systems with YCSB. SoCC","author":"Cooper B. F.","year":"2010","unstructured":"Cooper , B. F. , Silberstein , A. , Tam , E. , Ramakrishnan , R. , and Sears , R . Benchmarking cloud serving systems with YCSB. SoCC ( 2010 ). Cooper, B. F., Silberstein, A., Tam, E., Ramakrishnan, R., and Sears, R. Benchmarking cloud serving systems with YCSB. SoCC (2010)."},{"key":"e_1_3_2_2_24_1","volume-title":"USENIX OSDI","author":"Dai Y.","year":"2020","unstructured":"Dai , Y. , Xu , Y. , Ganesan , A. , Alagappan , R. , Kroth , B. , Arpaci-Dusseau , A. , and Arpaci-Dusseau , R. From wisckey to bourbon: A learned index for log-structured merge trees . In USENIX OSDI ( 2020 ). Dai, Y., Xu, Y., Ganesan, A., Alagappan, R., Kroth, B., Arpaci-Dusseau, A., and Arpaci-Dusseau, R. From wisckey to bourbon: A learned index for log-structured merge trees. In USENIX OSDI (2020)."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064054"},{"key":"e_1_3_2_2_26_1","first-page":"4","volume":"43","author":"Dayan N.","year":"2018","unstructured":"Dayan , N. , Athanassoulis , M. , and Idreos , S . Optimal Bloom Filters and Adaptive Merging for LSM-Trees. TODS 43 , 4 ( 2018 ), 16:1--16:48. Dayan, N., Athanassoulis, M., and Idreos, S. Optimal Bloom Filters and Adaptive Merging for LSM-Trees. TODS 43, 4 (2018), 16:1--16:48.","journal-title":"Optimal Bloom Filters and Adaptive Merging for LSM-Trees. TODS"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915219"},{"key":"e_1_3_2_2_28_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 N.","year":"2018","unstructured":"Dayan , N. , and Idreos , S . Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging. SIGMOD ( 2018 ). Dayan, N., and Idreos, S. Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging. SIGMOD (2018)."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319903"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536274.2536298"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2011.44"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/3436905.3436919"},{"key":"e_1_3_2_2_33_1","volume-title":"Bloom Filters in Probabilistic Verification. Formal Methods in Computer-Aided Design","author":"Dillinger P. C.","year":"2004","unstructured":"Dillinger , P. C. , and Manolios , P . Bloom Filters in Probabilistic Verification. Formal Methods in Computer-Aided Design ( 2004 ). Dillinger, P. C., and Manolios, P. Bloom Filters in Probabilistic Verification. Formal Methods in Computer-Aided Design (2004)."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064033"},{"key":"e_1_3_2_2_35_1","volume-title":"Optimizing Space Amplification in RocksDB. CIDR","author":"Dong S.","year":"2017","unstructured":"Dong , S. , Callaghan , M. , Galanis , L. , Borthakur , D. , Savor , T. , and Strum , M . Optimizing Space Amplification in RocksDB. CIDR ( 2017 ). Dong, S., Callaghan, M., Galanis, L., Borthakur, D., Savor, T., and Strum, M. Optimizing Space Amplification in RocksDB. CIDR (2017)."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/PCS.2015.7170048"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3190508.3190524"},{"key":"e_1_3_2_2_38_1","unstructured":"Facebook. RocksDB. https:\/\/github.com\/facebook\/rocksdb.  Facebook. RocksDB. https:\/\/github.com\/facebook\/rocksdb."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2674005.2674994"},{"key":"e_1_3_2_2_40_1","first-page":"3","article-title":"Summary cache: A scalable wide-area Web cache sharing protocol","volume":"8","author":"Fan L.","year":"2000","unstructured":"Fan , L. , Cao , P. , Almeida , J. , and Broder , A. Z . Summary cache: A scalable wide-area Web cache sharing protocol . IEEE\/ACM Transactions on Networking 8 , 3 ( 2000 ), 281--293. Fan, L., Cao, P., Almeida, J., and Broder, A. Z. Summary cache: A scalable wide-area Web cache sharing protocol. IEEE\/ACM Transactions on Networking 8, 3 (2000), 281--293.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3342195.3387523"},{"key":"e_1_3_2_2_42_1","volume-title":"Scaling Concurrent Log-Structured Data Stores. EuroSys","author":"Golan-Gueta G.","year":"2015","unstructured":"Golan-Gueta , G. , Bortnikov , E. , Hillel , E. , and Keidar , I . Scaling Concurrent Log-Structured Data Stores. EuroSys ( 2015 ). Golan-Gueta, G., Bortnikov, E., Hillel, E., and Keidar, I. Scaling Concurrent Log-Structured Data Stores. EuroSys (2015)."},{"key":"e_1_3_2_2_43_1","volume-title":"Run-length encodings","author":"Golomb S.","year":"1966","unstructured":"Golomb , S. Run-length encodings . IEEE transactions on information theory ( 1966 ). Golomb, S. Run-length encodings. IEEE transactions on information theory (1966)."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3376122"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3314041"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"e_1_3_2_2_47_1","volume-title":"Real-Time Business Intelligence and Analytics","author":"Idreos S.","year":"2015","unstructured":"Idreos , S. , Athanassoulis , M. , Dayan , N. , Guo , D. , Kester , M. S. , Maas , L. , and Zoumpatianos , K . Past and future steps for adaptive storage data systems: From shallow to deep adaptivity . In Real-Time Business Intelligence and Analytics . Springer , 2015 . Idreos, S., Athanassoulis, M., Dayan, N., Guo, D., Kester, M. S., Maas, L., and Zoumpatianos, K. Past and future steps for adaptive storage data systems: From shallow to deep adaptivity. In Real-Time Business Intelligence and Analytics. Springer, 2015."},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3383133"},{"key":"e_1_3_2_2_49_1","volume-title":"File management with log-structured merge bush","author":"Idreos S.","year":"2020","unstructured":"Idreos , S. , and Dayan , N . File management with log-structured merge bush , 2020 . US Patent App . 16\/963,411. Idreos, S., and Dayan, N. File management with log-structured merge bush, 2020. US Patent App. 16\/963,411."},{"key":"e_1_3_2_2_50_1","volume-title":"Key-value stores with optimized merge policies and optimized lsm-tree structures","author":"Idreos S.","year":"2020","unstructured":"Idreos , S. , and Dayan , N . Key-value stores with optimized merge policies and optimized lsm-tree structures , 2020 . US Patent App . 16\/963,411. Idreos, S., and Dayan, N. Key-value stores with optimized merge policies and optimized lsm-tree structures, 2020. US Patent App. 16\/963,411."},{"key":"e_1_3_2_2_51_1","volume-title":"Optimized navigable key-value store","author":"Idreos S.","year":"2020","unstructured":"Idreos , S. , Dayan , N. , and Athanassoulis , M . Optimized navigable key-value store , 2020 . US Patent App . 16\/433,075. Idreos, S., Dayan, N., and Athanassoulis, M. Optimized navigable key-value store, 2020. US Patent App. 16\/433,075."},{"key":"e_1_3_2_2_52_1","volume-title":"Learning key-value store design. arXiv preprint arXiv:1907.05443","author":"Idreos S.","year":"2019","unstructured":"Idreos , S. , Dayan , N. , Qin , W. , Akmanalp , M. , Hilgard , S. , Ross , A. , Lennon , J. , Jain , V. , Gupta , H. , Li , D. , Learning key-value store design. arXiv preprint arXiv:1907.05443 ( 2019 ). Idreos, S., Dayan, N., Qin, W., Akmanalp, M., Hilgard, S., Ross, A., Lennon, J., Jain, V., Gupta, H., Li, D., et al. Learning key-value store design. arXiv preprint arXiv:1907.05443 (2019)."},{"key":"e_1_3_2_2_53_1","volume-title":"CIDR","author":"Idreos S.","year":"2019","unstructured":"Idreos , S. , Dayan , N. , Qin , W. , Akmanalp , M. , Hilgard , S. , Ross , A. , Lennon , J. , Jain , V. , Gupta , H. , Li , D. , and Zhu , Z . Design continuums and the path toward self-designing key-value stores that know and learn . In CIDR ( 2019 ). Idreos, S., Dayan, N., Qin, W., Akmanalp, M., Hilgard, S., Ross, A., Lennon, J., Jain, V., Gupta, H., Li, D., and Zhu, Z. Design continuums and the path toward self-designing key-value stores that know and learn. In CIDR (2019)."},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3314034"},{"key":"e_1_3_2_2_55_1","first-page":"3","volume":"41","author":"Idreos S.","year":"2018","unstructured":"Idreos , S. , Zoumpatianos , K. , Athanassoulis , M. , Dayan , N. , Hentschel , B. , Kester , M. S. , Guo , D. , Maas , L. M. , Qin , W. , Wasay , A. , and Sun , Y . The Periodic Table of Data Structures. IEEE DEBULL 41 , 3 ( 2018 ), 64--75. Idreos, S., Zoumpatianos, K., Athanassoulis, M., Dayan, N., Hentschel, B., Kester, M. S., Guo, D., Maas, L. M., Qin, W., Wasay, A., and Sun, Y. The Periodic Table of Data Structures. IEEE DEBULL 41, 3 (2018), 64--75.","journal-title":"The Periodic Table of Data Structures. IEEE DEBULL"},{"key":"e_1_3_2_2_56_1","volume-title":"Learning data structure alchemy","author":"Idreos S.","year":"2019","unstructured":"Idreos , S. , Zoumpatianos , K. , Chatterjee , S. , Qin , W. , Wasay , A. , Hentschel , B. , Kester , M. , Dayan , N. , Guo , D. , Kang , M. , Learning data structure alchemy . IEEE DEBULL ( 2019 ). Idreos, S., Zoumpatianos, K., Chatterjee, S., Qin, W., Wasay, A., Hentschel, B., Kester, M., Dayan, N., Guo, D., Kang, M., et al. Learning data structure alchemy. IEEE DEBULL (2019)."},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3199671"},{"key":"e_1_3_2_2_58_1","volume-title":"USENIX ATC","author":"Im J.","year":"2020","unstructured":"Im , J. , Bae , J. , Chung , C. , Lee , S. , Pink: High-speed in-storage key-value store with bounded tails . In USENIX ATC ( 2020 ). Im, J., Bae, J., Chung, C., Lee, S., et al. Pink: High-speed in-storage key-value store with bounded tails. In USENIX ATC (2020)."},{"key":"e_1_3_2_2_59_1","volume-title":"Incremental Organization for Data Recording and Warehousing. VLDB","author":"Jagadish H. V.","year":"1997","unstructured":"Jagadish , H. V. , Narayan , P. P. S. , Seshadri , S. , Sudarshan , S. , and Kanneganti , R . Incremental Organization for Data Recording and Warehousing. VLDB ( 1997 ). Jagadish, H. V., Narayan, P. P. S., Seshadri, S., Sudarshan, S., and Kanneganti, R. Incremental Organization for Data Recording and Warehousing. VLDB (1997)."},{"key":"e_1_3_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20208"},{"key":"e_1_3_2_2_61_1","first-page":"6","article-title":"Coconut: A scalable bottom-up approach for building data series indexes","volume":"11","author":"Kondylakis H.","year":"2018","unstructured":"Kondylakis , H. , Dayan , N. , Zoumpatianos , K. , and Palpanas , T . Coconut: A scalable bottom-up approach for building data series indexes . VLDB 11 , 6 ( 2018 ), 677--690. Kondylakis, H., Dayan, N., Zoumpatianos, K., and Palpanas, T. Coconut: A scalable bottom-up approach for building data series indexes. VLDB 11, 6 (2018), 677--690.","journal-title":"VLDB"},{"key":"e_1_3_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3320233"},{"key":"e_1_3_2_2_63_1","volume-title":"Coconut: sortable summarizations for scalable indexes over static and streaming data series. VLDBJ","author":"Kondylakis H.","year":"2019","unstructured":"Kondylakis , H. , Dayan , N. , Zoumpatianos , K. , and Palpanas , T . Coconut: sortable summarizations for scalable indexes over static and streaming data series. VLDBJ ( 2019 ). Kondylakis, H., Dayan, N., Zoumpatianos, K., and Palpanas, T. Coconut: sortable summarizations for scalable indexes over static and streaming data series. VLDBJ (2019)."},{"key":"e_1_3_2_2_65_1","volume-title":"The Case for Learned Index Structures. SIGMOD","author":"Kraska T.","year":"2018","unstructured":"Kraska , T. , Beutel , A. , Chi , E. H. , Dean , J. , and Polyzotis , N . The Case for Learned Index Structures. SIGMOD ( 2018 ). Kraska, T., Beutel, A., Chi, E. H., Dean, J., and Polyzotis, N. The Case for Learned Index Structures. SIGMOD (2018)."},{"key":"e_1_3_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.14778\/3303753.3303757"},{"key":"e_1_3_2_2_67_1","volume-title":"A Forest-structured Bloom Filter with flash memory. MSST","author":"Lu G.","year":"2011","unstructured":"Lu , G. , Debnath , B. , and Du , D. H. C . A Forest-structured Bloom Filter with flash memory. MSST ( 2011 ). Lu, G., Debnath, B., and Du, D. H. C. A Forest-structured Bloom Filter with flash memory. MSST (2011)."},{"key":"e_1_3_2_2_68_1","volume-title":"WiscKey: Separating Keys from Values in SSD-conscious Storage. FAST","author":"Lu L.","year":"2016","unstructured":"Lu , L. , Pillai , T. S. , Arpaci-Dusseau , A. C. , and Arpaci-Dusseau , R. H. WiscKey: Separating Keys from Values in SSD-conscious Storage. FAST ( 2016 ). Lu, L., Pillai, T. S., Arpaci-Dusseau, A. C., and Arpaci-Dusseau, R. H. WiscKey: Separating Keys from Values in SSD-conscious Storage. FAST (2016)."},{"key":"e_1_3_2_2_69_1","doi-asserted-by":"publisher","DOI":"10.14778\/3372716.3372719"},{"key":"e_1_3_2_2_70_1","volume-title":"Lsm-based storage techniques: a survey. The VLDB Journal","author":"Luo C.","year":"2020","unstructured":"Luo , C. , and Carey , M. J . Lsm-based storage techniques: a survey. The VLDB Journal ( 2020 ). Luo, C., and Carey, M. J. Lsm-based storage techniques: a survey. The VLDB Journal (2020)."},{"key":"e_1_3_2_2_71_1","volume-title":"EDBT","author":"Luo C.","year":"2019","unstructured":"Luo , C. , T\u00f6z\u00fcn , P. , Tian , Y. , Barber , R. , Raman , V. , and Sidle , R . Umzi: Unified multi-zone indexing for large-scale htap . In EDBT ( 2019 ). Luo, C., T\u00f6z\u00fcn, P., Tian, Y., Barber, R., Raman, V., and Sidle, R. Umzi: Unified multi-zone indexing for large-scale htap. In EDBT (2019)."},{"key":"e_1_3_2_2_72_1","volume-title":"Optimizing bloom filter: Challenges, solutions, and comparisons","author":"Luo L.","year":"2018","unstructured":"Luo , L. , Guo , D. , Ma , R. T. , Rottenstreich , O. , and Luo , X . Optimizing bloom filter: Challenges, solutions, and comparisons . IEEE Commun. Surv. Tutor . ( 2018 ). Luo, L., Guo, D., Ma, R. T., Rottenstreich, O., and Luo, X. Optimizing bloom filter: Challenges, solutions, and comparisons. IEEE Commun. Surv. Tutor. (2018)."},{"key":"e_1_3_2_2_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389731"},{"key":"e_1_3_2_2_74_1","doi-asserted-by":"publisher","DOI":"10.14778\/3415478.3415546"},{"key":"e_1_3_2_2_75_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1956.1056818"},{"key":"e_1_3_2_2_76_1","doi-asserted-by":"publisher","DOI":"10.1145\/3267809.3267829"},{"key":"e_1_3_2_2_77_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.803864"},{"key":"e_1_3_2_2_78_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975055.4"},{"key":"e_1_3_2_2_79_1","first-page":"4","article-title":"The log-structured merge-tree (LSM-tree)","volume":"33","author":"O'Neil P. E.","year":"1996","unstructured":"O'Neil , P. E. , Cheng , E. , Gawlick , D. , and O'Neil , E. J . The log-structured merge-tree (LSM-tree) . Acta Informatica 33 , 4 ( 1996 ), 351--385. O'Neil, P. E., Cheng, E., Gawlick, D., and O'Neil, E. J. The log-structured merge-tree (LSM-tree). Acta Informatica 33, 4 (1996), 351--385.","journal-title":"Acta Informatica"},{"key":"e_1_3_2_2_80_1","volume-title":"SODA","author":"Pagh A.","year":"2005","unstructured":"Pagh , A. , Pagh , R. , and Rao , S. S . An optimal bloom filter replacement . In SODA ( 2005 ). Pagh, A., Pagh, R., and Rao, S. S. An optimal bloom filter replacement. In SODA (2005)."},{"key":"e_1_3_2_2_81_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035963"},{"key":"e_1_3_2_2_83_1","volume-title":"Vectorized Bloom filters for advanced SIMD processors. DAMON","author":"Polychroniou O.","year":"2014","unstructured":"Polychroniou , O. , and Ross , K. A . Vectorized Bloom filters for advanced SIMD processors. DAMON ( 2014 ). Polychroniou, O., and Ross, K. A. Vectorized Bloom filters for advanced SIMD processors. DAMON (2014)."},{"key":"e_1_3_2_2_84_1","volume-title":"Cache-, hash-, and space-efficient bloom filters. Journal of Experimental Algorithmics (JEA)","author":"Putze F.","year":"2010","unstructured":"Putze , F. , Sanders , P. , and Singler , J . Cache-, hash-, and space-efficient bloom filters. Journal of Experimental Algorithmics (JEA) ( 2010 ). Putze, F., Sanders, P., and Singler, J. Cache-, hash-, and space-efficient bloom filters. Journal of Experimental Algorithmics (JEA) (2010)."},{"key":"e_1_3_2_2_85_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132765"},{"key":"e_1_3_2_2_86_1","doi-asserted-by":"publisher","DOI":"10.14778\/3151106.3151108"},{"key":"e_1_3_2_2_87_1","volume-title":"Arithmetic coding. IBM Journal of research and development","author":"Rissanen J.","year":"1979","unstructured":"Rissanen , J. , and Langdon , G. G . Arithmetic coding. IBM Journal of research and development ( 1979 ). Rissanen, J., and Langdon, G. G. Arithmetic coding. IBM Journal of research and development (1979)."},{"key":"e_1_3_2_2_88_1","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2010.06.100344"},{"key":"e_1_3_2_2_89_1","volume-title":"The variable-increment counting bloom filter","author":"Rottenstreich O.","year":"2013","unstructured":"Rottenstreich , O. , Kanizo , Y. , and Keslassy , I . The variable-increment counting bloom filter . IEEE\/ACM Transactions on Networking ( 2013 ). Rottenstreich, O., Kanizo, Y., and Keslassy, I. The variable-increment counting bloom filter. IEEE\/ACM Transactions on Networking (2013)."},{"key":"e_1_3_2_2_90_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389757"},{"key":"e_1_3_2_2_91_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213862"},{"key":"e_1_3_2_2_92_1","volume-title":"Building Workload-Independent Storage with VT-trees. FAST","author":"Shetty P.","year":"2013","unstructured":"Shetty , P. , Spillane , R. P. , Malpani , R. , Andrews , B. , Seyster , J. , and Zadok , E . Building Workload-Independent Storage with VT-trees. FAST ( 2013 ). Shetty, P., Spillane, R. P., Malpani, R., Andrews, B., Seyster, J., and Zadok, E. Building Workload-Independent Storage with VT-trees. FAST (2013)."},{"key":"e_1_3_2_2_93_1","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2011.031611.00024"},{"key":"e_1_3_2_2_94_1","volume-title":"On Log-Structured Merge for Solid-State Drives. ICDE","author":"Thonangi R.","year":"2017","unstructured":"Thonangi , R. , and Yang , J . On Log-Structured Merge for Solid-State Drives. ICDE ( 2017 ). Thonangi, R., and Yang, J. On Log-Structured Merge for Solid-State Drives. ICDE (2017)."},{"key":"e_1_3_2_2_95_1","volume-title":"EDBT","author":"Vincc","year":"2018","unstructured":"Vincc on, T., Hardock , S. , Riegger , C. , Oppermann , J. , Koch , A. , and Petrov , I . Noftl-kv: Tackling write-amplification on kv-stores with native storage management . In EDBT ( 2018 ). Vincc on, T., Hardock, S., Riegger, C., Oppermann, J., Koch, A., and Petrov, I. Noftl-kv: Tackling write-amplification on kv-stores with native storage management. In EDBT (2018)."},{"key":"e_1_3_2_2_96_1","doi-asserted-by":"publisher","DOI":"10.14778\/3364324.3364333"},{"key":"e_1_3_2_2_97_1","volume-title":"An Efficient Design and Implementation of LSM-Tree based Key-Value Store on Open-Channel SSD. EuroSys","author":"Wang P.","year":"2014","unstructured":"Wang , P. , Sun , G. , Jiang , S. , Ouyang , J. , Lin , S. , Zhang , C. , and Cong , J . An Efficient Design and Implementation of LSM-Tree based Key-Value Store on Open-Channel SSD. EuroSys ( 2014 ). Wang, P., Sun, G., Jiang, S., Ouyang, J., Lin, S., Zhang, C., and Cong, J. An Efficient Design and Implementation of LSM-Tree based Key-Value Store on Open-Channel SSD. EuroSys (2014)."},{"key":"e_1_3_2_2_98_1","volume-title":"LSM-trie: An LSM-tree-based Ultra-Large Key-Value Store for Small Data Items. USENIX ATC","author":"Wu X.","year":"2015","unstructured":"Wu , X. , Xu , Y. , Shao , Z. , and Jiang , S . LSM-trie: An LSM-tree-based Ultra-Large Key-Value Store for Small Data Items. USENIX ATC ( 2015 ). Wu, X., Xu, Y., Shao, Z., and Jiang, S. LSM-trie: An LSM-tree-based Ultra-Large Key-Value Store for Small Data Items. USENIX ATC (2015)."},{"key":"e_1_3_2_2_99_1","doi-asserted-by":"publisher","DOI":"10.1145\/3139922"},{"key":"e_1_3_2_2_100_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196931"},{"key":"e_1_3_2_2_101_1","volume-title":"USENIX FAST","author":"Zhang T.","year":"2020","unstructured":"Zhang , T. , Wang , J. , Cheng , X. , Xu , H. , Yu , N. , Huang , G. , Zhang , T. , He , D. , Li , F. , Cao , W. , Fpga-accelerated compactions for lsm-based key-value store . In USENIX FAST ( 2020 ). Zhang, T., Wang, J., Cheng, X., Xu, H., Yu, N., Huang, G., Zhang, T., He, D., Li, F., Cao, W., et al. Fpga-accelerated compactions for lsm-based key-value store. In USENIX FAST (2020)."}],"event":{"name":"SIGMOD\/PODS '21: International Conference on Management of Data","location":"Virtual Event China","acronym":"SIGMOD\/PODS '21","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2021 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3457273","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3448016.3457273","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:28:06Z","timestamp":1750195686000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3457273"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,9]]},"references-count":99,"alternative-id":["10.1145\/3448016.3457273","10.1145\/3448016"],"URL":"https:\/\/doi.org\/10.1145\/3448016.3457273","relation":{},"subject":[],"published":{"date-parts":[[2021,6,9]]},"assertion":[{"value":"2021-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}