{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T09:35:20Z","timestamp":1774949720337,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":104,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,9]],"date-time":"2024-06-09T00:00:00Z","timestamp":1717891200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006374","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["OAC 2339521"],"award-info":[{"award-number":["OAC 2339521"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,9]]},"DOI":"10.1145\/3626246.3654681","type":"proceedings-article","created":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T10:26:39Z","timestamp":1716459999000},"page":"636-644","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Beyond Bloom: A Tutorial on Future Feature-Rich Filters"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5576-0320","authenticated-orcid":false,"given":"Prashant","family":"Pandey","sequence":"first","affiliation":[{"name":"University of Utah, Salt Lake City, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3616-7788","authenticated-orcid":false,"given":"Mart\u00edn","family":"Farach-Colton","sequence":"additional","affiliation":[{"name":"New York University, New York, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0314-0167","authenticated-orcid":false,"given":"Niv","family":"Dayan","sequence":"additional","affiliation":[{"name":"University of Toronto, Toronto, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-4821-1558","authenticated-orcid":false,"given":"Huanchen","family":"Zhang","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2024,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556556"},{"key":"e_1_3_2_1_2_1","volume-title":"Nuno Preguicc a, and David Hutchison","author":"Almeida Paulo S\u00e9","year":"2007","unstructured":"Paulo S\u00e9 rgio Almeida, Carlos Baquero, Nuno Preguicc a, and David Hutchison. 2007. Scalable Bloom Filters. Inform. Process. Lett. (2007)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btac142"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17083-7_1"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2019.0322"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732951.2732958"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629577"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.3129"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2254756.2254766"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3470635"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976489.2"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00026"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350275"},{"key":"e_1_3_2_1_14_1","unstructured":"Ioana O Bercea and Guy Even. 2020. Fully-Dynamic Space-Efficient Dictionaries and Filters with Constant Number of Memory Accesses. SWAT."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_61"},{"key":"e_1_3_2_1_17_1","volume-title":"Eduardo PC Rocha, Gil McVean, and Zamin Iqbal.","author":"Bradley Phelim","year":"2019","unstructured":"Phelim Bradley, Henk C Den Bakker, Eduardo PC Rocha, Gil McVean, and Zamin Iqbal. 2019. Ultrafast search of all deposited bacterial and viral genomic data. Nature biotechnology, Vol. 37, 2 (2019), 152--159."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/3213880.3213884"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129096"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/3386691.3386712"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196898"},{"key":"e_1_3_2_1_22_1","volume-title":"Symposium on Discrete Algorithms.","author":"Chazelle Bernard","year":"2004","unstructured":"Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, and Ayellet Tal. 2004 a. The Bloomier filter: an efficient data structure for static support lookup tables. In Symposium on Discrete Algorithms."},{"key":"e_1_3_2_1_23_1","volume-title":"Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, 30--39","author":"Chazelle Bernard","year":"2004","unstructured":"Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, and Ayellet Tal. 2004 b. The Bloomier filter: an efficient data structure for static support lookup tables. In Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, 30--39."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Hanhua Chen Liangyi Liao Hai Jin and Jie Wu. 2017. The Dynamic Cuckoo Filter. In ICNP.","DOI":"10.1109\/ICNP.2017.8117563"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1186\/1748-7188-8-22"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btu558"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872787"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588726"},{"key":"e_1_3_2_1_29_1","volume-title":"ICALP (LIPIcs","volume":"14","author":"Conway Alexander","year":"2018","unstructured":"Alexander Conway, Martin Farach-Colton, and Philip Shilane. 2018. Optimal Hashing in External Memory. In ICALP (LIPIcs, Vol. 107). Schloss Dagstuhl - Leibniz-Zentrum f\u00fc r Informatik, 39:1--39:14."},{"key":"e_1_3_2_1_30_1","volume-title":"2020 USENIX Annual Technical Conference (USENIX ATC 20)","author":"Conway Alexander","year":"2020","unstructured":"Alexander Conway, Abhishek Gupta, Vijay Chidambaram, Martin Farach-Colton, Richard Spillane, Amy Tai, and Rob Johnson. 2020. $$SplinterDB$$: Closing the Bandwidth Gap for $$NVMe$$$$Key-Value$$ Stores. In 2020 USENIX Annual Technical Conference (USENIX ATC 20). 49--63."},{"key":"e_1_3_2_1_31_1","volume-title":"Grafite: Taming Adversarial Queries with Optimal Range Filters. arXiv preprint arXiv:2311.15380","author":"Costa Marco","year":"2023","unstructured":"Marco Costa, Paolo Ferragina, and Giorgio Vinciguerra. 2023. Grafite: Taming Adversarial Queries with Optimal Range Filters. arXiv preprint arXiv:2311.15380 (2023)."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064054"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3276980"},{"key":"e_1_3_2_1_34_1","volume-title":"Aleph Filter: To Infinity in Constant Time. arXiv preprint arXiv:2404.04703","author":"Dayan Niv","year":"2024","unstructured":"Niv Dayan, Ioana Bercea, and Rasmus Pagh. 2024. Aleph Filter: To Infinity in Constant Time. arXiv preprint arXiv:2404.04703 (2024)."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589285"},{"key":"e_1_3_2_1_36_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)."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Niv Dayan and Stratos Idreos. 2019. The Log-Structured Merge-Bush & the Wacky Continuum. In SIGMOD.","DOI":"10.1145\/3299869.3319903"},{"key":"e_1_3_2_1_38_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."},{"key":"e_1_3_2_1_39_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. VLDB (2021)."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2011.44"},{"key":"e_1_3_2_1_41_1","volume-title":"Proceedings of the USENIX Annual Technical Conference (ATC).","author":"Debnath Biplob K","year":"2010","unstructured":"Biplob K Debnath, Sudipta Sengupta, and Jin Li. 2010. ChunkStash: Speeding Up Inline Storage Deduplication Using Flash Memory.. In Proceedings of the USENIX Annual Technical Conference (ATC)."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.14778\/3436905.3436919"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463710"},{"key":"e_1_3_2_1_44_1","volume-title":"Fast Succinct Retrieval and Approximate Membership Using Ribbon. SEA","author":"Dillinger Peter C","year":"2022","unstructured":"Peter C Dillinger, Lorenz H\u00fcbschle-Schneider, Peter Sanders, and Stefan Walzer. 2022. Fast Succinct Retrieval and Approximate Membership Using Ribbon. SEA (2022)."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--642-02652--2_6"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2833312.2833449"},{"key":"e_1_3_2_1_47_1","volume-title":"Proc. 4th USENIX Workshop on Hot Topics in Storage (HotStorage)","author":"Esmet John","unstructured":"John Esmet, Michael A. Bender, Martin Farach-Colton, and Bradley C. Kuszmaul. 2012. The TokuFS Streaming File System. In Proc. 4th USENIX Workshop on Hot Topics in Storage (HotStorage). Boston, MA, USA."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.14778\/3523210.3523211"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2674005.2674994"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1597036.1597040"},{"key":"e_1_3_2_1_51_1","volume-title":"Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms. SIAM, 769--775","author":"Goswami Mayank","year":"2014","unstructured":"Mayank Goswami, Allan Gr\u00f8nlund, Kasper Green Larsen, and Rasmus Pagh. 2014. Approximate range emptiness in constant time and optimal space. In Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms. SIAM, 769--775."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3376122"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"crossref","unstructured":"Deke Guo Jie Wu Honghui Chen and Xueshan Luo. 2006. Theory and Network Applications of Dynamic Bloom Filters. In INFOCOM.","DOI":"10.1109\/INFOCOM.2006.325"},{"key":"e_1_3_2_1_54_1","volume-title":"The Dynamic Bloom Filters","author":"Guo Deke","year":"2009","unstructured":"Deke Guo, Jie Wu, Honghui Chen, Ye Yuan, and Xueshan Luo. 2009. The Dynamic Bloom Filters. IEEE Trans Knowl Data Eng (2009)."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btz662"},{"key":"e_1_3_2_1_56_1","unstructured":"InternetLiveStats.com. 2022. Google search statistics. https:\/\/www.internetlivestats.com\/google-search-statistics\/"},{"key":"e_1_3_2_1_57_1","volume-title":"Golnaz Jahesh, Hamza Khan, Lauren Coombe, Rene L Warren, et al.","author":"Jackman Shaun D","year":"2017","unstructured":"Shaun D Jackman, Benjamin P Vandervalk, Hamid Mohamadi, Justin Chu, Sarah Yeo, S Austin Hammond, Golnaz Jahesh, Hamza Khan, Lauren Coombe, Rene L Warren, et al. 2017. ABySS 2.0: resource-efficient assembly of large genomes using a Bloom filter. Genome research, Vol. 27, 5 (2017), 768--777."},{"key":"e_1_3_2_1_58_1","volume-title":"Proceedings of the 13th USENIX Conference on File and Storage Technologies, FAST 2015","author":"Jannen William","year":"2015","unstructured":"William Jannen, Jun Yuan, Yang Zhan, Amogh Akshintala, John Esmet, Yizheng Jiao, Ankur Mittal, Prashant Pandey, Phaneendra Reddy, Leif Walsh, Michael A. Bender, Martin Farach-Colton, Rob Johnson, Bradley C. Kuszmaul, and Donald E. Porter. 2015a. BetrFS: A Right-Optimized Write-Optimized File System. In Proceedings of the 13th USENIX Conference on File and Storage Technologies, FAST 2015, Santa Clara, CA, USA, February 16--19, 2015, Jiri Schindler and Erez Zadok (Eds.). USENIX Association, 301--315. https:\/\/www.usenix.org\/conference\/fast15\/technical-sessions\/presentation\/jannen"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/2798729"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3526167"},{"key":"e_1_3_2_1_61_1","volume-title":"Jeffrey Dean, and Neoklis Polyzotis.","author":"Kraska Tim","year":"2018","unstructured":"Tim Kraska, Alex Beutel, Ed H Chi, Jeffrey Dean, and Neoklis Polyzotis. 2018. The Case for Learned Index Structures. SIGMOD (2018)."},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"crossref","unstructured":"Harald Lang Thomas Neumann Alfons Kemper and Peter Boncz. 2019. Performance-Optimal Filtering: Bloom Overtakes Cuckoo at High Throughput. In VLDB.","DOI":"10.14778\/3303753.3303757"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ESA.2021.60"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3511996"},{"key":"e_1_3_2_1_65_1","volume-title":"Xueshan Luo, and Bangbang Ren.","author":"Luo Lailong","year":"2019","unstructured":"Lailong Luo, Deke Guo, Ori Rottenstreich, Richard TB Ma, Xueshan Luo, and Bangbang Ren. 2019. The Consistent Cuckoo Filter. In INFOCOM."},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389731"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/3572848.3577507"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/3339504"},{"key":"e_1_3_2_1_69_1","first-page":"131","article-title":"bloomRF: On performing range-queries in Bloom-Filters with piecewise-monotone hash functions and prefix hashing. In Advances in database technology","volume":"26","author":"M\u00f6\u00dfner Bernhard","year":"2023","unstructured":"Bernhard M\u00f6\u00dfner, Christian Riegger, Arthur Bernhardt, and Ilia Petrov. 2023. bloomRF: On performing range-queries in Bloom-Filters with piecewise-monotone hash functions and prefix hashing. In Advances in database technology: Proceedings of the 26th International Conference on Extending database Technology (EDBT), Vol. 26. 131--143.","journal-title":"Proceedings of the 26th International Conference on Extending database Technology (EDBT)"},{"key":"e_1_3_2_1_70_1","volume-title":"O'Neil","author":"O'Neil Patrick E.","year":"1996","unstructured":"Patrick E. O'Neil, Edward Cheng, Dieter Gawlick, and Elizabeth J. O'Neil. 1996. The Log-Structured Merge-Tree (LSM-Tree). Acta Informatica (1996)."},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.5555\/1070432.1070548"},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"crossref","unstructured":"Rasmus Pagh Gil Segev and Udi Wieder. 2013. How to Approximate a Set Without Knowing its Size in Advance. In FOCS.","DOI":"10.1109\/FOCS.2013.17"},{"key":"e_1_3_2_1_73_1","volume-title":"Mantis: A fast, small, and exact large-scale sequence-search index. Cell systems","author":"Pandey Prashant","year":"2018","unstructured":"Prashant Pandey, Fatemeh Almodaresi, Michael A Bender, Michael Ferdman, Rob Johnson, and Rob Patro. 2018. Mantis: A fast, small, and exact large-scale sequence-search index. Cell systems, Vol. 7, 2 (2018), 201--207."},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btx261"},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035963"},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btx636"},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3452841"},{"key":"e_1_3_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1121464109"},{"key":"e_1_3_2_1_79_1","volume-title":"International Conference on Machine Learning.","author":"Rae Jack","year":"2019","unstructured":"Jack Rae, Sergey Bartunov, and Timothy Lillicrap. 2019. Meta-learning neural bloom filters. In International Conference on Machine Learning."},{"key":"e_1_3_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132765"},{"key":"e_1_3_2_1_81_1","volume-title":"Weightless: Lossy weight encoding for deep neural network compression. arXiv preprint arXiv:1711.04686","author":"Reagen Brandon","year":"2017","unstructured":"Brandon Reagen, Udit Gupta, Robert Adolf, Michael M Mitzenmacher, Alexander M Rush, Gu-Yeon Wei, and David Brooks. 2017. Weightless: Lossy weight encoding for deep neural network compression. arXiv preprint arXiv:1711.04686 (2017)."},{"key":"e_1_3_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.14778\/3151106.3151108"},{"key":"e_1_3_2_1_83_1","volume-title":"Dillinger","author":"Reviriego Pedro","year":"2021","unstructured":"Pedro Reviriego, Alfonso S\u00e1nchez-Maci\u00e1n, Stefan Walzer, and Peter C. Dillinger. 2021. Approximate Membership Query Filters with a False Positive Free Set."},{"key":"e_1_3_2_1_84_1","volume-title":"Algorithms in Bioinformatics","author":"Salikhov Kamil","unstructured":"Kamil Salikhov, Gustavo Sacomoto, and Gregory Kucherov. 2013. Using cascading Bloom filters to improve the memory usage for de Brujin graphs. In Algorithms in Bioinformatics. Springer, 364--376."},{"key":"e_1_3_2_1_85_1","doi-asserted-by":"crossref","unstructured":"Subhadeep Sarkar Niv Dayan and Manos Athanassoulis. 2023. The LSM Design Space and its Read Optimizations. In ICDE.","DOI":"10.1109\/ICDE55515.2023.00273"},{"key":"e_1_3_2_1_86_1","unstructured":"Securelist.com. 2022. . https:\/\/securelist.com\/kaspersky-security-bulletin-2021-statistics\/105205\/"},{"key":"e_1_3_2_1_87_1","doi-asserted-by":"crossref","unstructured":"Dimitrios Skarlatos Apostolos Kokolis Tianyin Xu and Josep Torrellas. 2020. Elastic Cuckoo Page Tables: Rethinking Virtual Memory Translation for Parallelism. In ASPLOS.","DOI":"10.1145\/3373376.3378493"},{"key":"e_1_3_2_1_88_1","volume-title":"Fast search of thousands of short-read sequencing experiments. Nature biotechnology","author":"Solomon Brad","year":"2016","unstructured":"Brad Solomon and Carl Kingsford. 2016. Fast search of thousands of short-read sequencing experiments. Nature biotechnology, Vol. 34, 3 (2016), 300."},{"key":"e_1_3_2_1_89_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btq230"},{"key":"e_1_3_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.1587\/transinf.2015ICP0027"},{"key":"e_1_3_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542207.1542232"},{"key":"e_1_3_2_1_92_1","doi-asserted-by":"publisher","DOI":"10.14778\/3529337.3529347"},{"key":"e_1_3_2_1_93_1","volume-title":"GRF: A Global Range Filter for LSM-Trees with Shape Encoding. In SIGMOD.","author":"Wang Hengrui","year":"2024","unstructured":"Hengrui Wang, Tw Guo, Junzhao Yang, and Zhang Huanchen. 2024. GRF: A Global Range Filter for LSM-Trees with Shape Encoding. In SIGMOD."},{"key":"e_1_3_2_1_94_1","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592804"},{"key":"e_1_3_2_1_95_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00158"},{"key":"e_1_3_2_1_96_1","volume-title":"Proceedings of the 2025 International Conference on Management of Data. ACM.","author":"Wen Richard","year":"2025","unstructured":"Richard Wen, Hunter McCoy, David Tench, Guido Tagliavini, Michael Bender, Alex Conway, Martin Farach-Colton, Rob Johnson, and Prashant Pandey. 2025. Adaptive Quotient Filters. In Proceedings of the 2025 International Conference on Management of Data. ACM."},{"key":"e_1_3_2_1_97_1","volume-title":"Elastic Bloom Filter: Deletable and Expandable Filter Using Elastic Fingerprints","author":"Wu Yuhan","year":"2021","unstructured":"Yuhan Wu, Jintao He, Shen Yan, Jianyu Wu, Tong Yang, Olivier Ruas, Gong Zhang, and Bin Cui. 2021. Elastic Bloom Filter: Deletable and Expandable Filter Using Elastic Fingerprints. IEEE Trans Comput (2021)."},{"key":"e_1_3_2_1_98_1","doi-asserted-by":"crossref","unstructured":"Kun Xie Yinghua Min Dafang Zhang Jigang Wen and Gaogang Xie. 2007. A Scalable Bloom Filter for Membership Queries. In GLOBECOM.","DOI":"10.1109\/GLOCOM.2007.107"},{"key":"e_1_3_2_1_99_1","doi-asserted-by":"publisher","DOI":"10.1109\/OJCS.2022.3219631"},{"key":"e_1_3_2_1_100_1","volume-title":"14th USENIX Conference on File and Storage Technologies, FAST 2016","author":"Yuan Jun","year":"2016","unstructured":"Jun Yuan, Yang Zhan, William Jannen, Prashant Pandey, Amogh Akshintala, Kanchan Chandnani, Pooja Deo, Zardosht Kasheff, Leif Walsh, Michael A. Bender, Martin Farach-Colton, Rob Johnson, Bradley C. Kuszmaul, and Donald E. Porter. 2016. Optimizing Every Operation in a Write-optimized File System. In 14th USENIX Conference on File and Storage Technologies, FAST 2016, Santa Clara, CA, USA, February 22--25, 2016, Angela Demke Brown and Florentina I. Popovici (Eds.). USENIX Association, 1--14. https:\/\/www.usenix.org\/conference\/fast16\/technical-sessions\/presentation\/yuan"},{"key":"e_1_3_2_1_101_1","doi-asserted-by":"publisher","DOI":"10.1145\/3032969"},{"key":"e_1_3_2_1_102_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196931"},{"key":"e_1_3_2_1_103_1","doi-asserted-by":"publisher","DOI":"10.1145\/3375660"},{"key":"e_1_3_2_1_104_1","doi-asserted-by":"publisher","DOI":"10.5555\/1364813.1364831"}],"event":{"name":"SIGMOD\/PODS '24: International Conference on Management of Data","location":"Santiago AA Chile","acronym":"SIGMOD\/PODS '24","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Companion of the 2024 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626246.3654681","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3626246.3654681","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T11:32:04Z","timestamp":1755862324000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626246.3654681"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,9]]},"references-count":104,"alternative-id":["10.1145\/3626246.3654681","10.1145\/3626246"],"URL":"https:\/\/doi.org\/10.1145\/3626246.3654681","relation":{},"subject":[],"published":{"date-parts":[[2024,6,9]]},"assertion":[{"value":"2024-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}