{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T08:56:27Z","timestamp":1773392187981,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T00:00:00Z","timestamp":1650844800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Natural Science Foundation of China","award":["No. 61872178, No. 61832005, No. 61672276, NO. 62072230, U1811461"],"award-info":[{"award-number":["No. 61872178, No. 61832005, No. 61672276, NO. 62072230, U1811461"]}]},{"name":"Key Research and Development Project of Jiangsu Province","award":["No. BE2015154 and BE2016120"],"award-info":[{"award-number":["No. BE2015154 and BE2016120"]}]},{"DOI":"10.13039\/501100018541","name":"Natural Science Foundation of Jiangsu Province for Distinguished Young Scholars","doi-asserted-by":"publisher","award":["No. BK20181251"],"award-info":[{"award-number":["No. BK20181251"]}],"id":[{"id":"10.13039\/501100018541","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,4,25]]},"DOI":"10.1145\/3485447.3511996","type":"proceedings-article","created":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T05:13:07Z","timestamp":1650863587000},"page":"2759-2767","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Seesaw Counting Filter: An Efficient Guardian for Vulnerable Negative Keys During Dynamic Filtering"],"prefix":"10.1145","author":[{"given":"Meng","family":"Li","sequence":"first","affiliation":[{"name":"Nanjing University, China"}]},{"given":"Deyi","family":"Chen","sequence":"additional","affiliation":[{"name":"Nanjing University, China"}]},{"given":"Haipeng","family":"Dai","sequence":"additional","affiliation":[{"name":"Nanjing University, China"}]},{"given":"Rongbiao","family":"Xie","sequence":"additional","affiliation":[{"name":"Nanjing University, China"}]},{"given":"Siqiang","family":"Luo","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, China"}]},{"given":"Rong","family":"Gu","sequence":"additional","affiliation":[{"name":"Nanjing University, China"}]},{"given":"Tong","family":"Yang","sequence":"additional","affiliation":[{"name":"Peaking University, China"}]},{"given":"Guihai","family":"Chen","sequence":"additional","affiliation":[{"name":"Nanjing University, China"}]}],"member":"320","published-online":{"date-parts":[[2022,4,25]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"[1] [n.d.]. https:\/\/bitcoinops.org\/en\/newsletters\/2019\/08\/21\/#bitcoin-core-16248."},{"key":"e_1_3_2_1_2_1","unstructured":"2021. SSCF Source Code. https:\/\/anonymous.4open.science\/r\/SSCF-7505."},{"key":"e_1_3_2_1_3_1","unstructured":"Parvez Anandam. 2019. Network Access Control using Bloom filters. https:\/\/courses.cs.washington.edu\/courses\/csep521\/07wi\/prj\/parvez.pdf."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_61"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261978"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87744-8_22"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_3_2_1_9_1","volume-title":"Adaptive learned Bloom filter (Ada-BF): Efficient utilization of the classifier. arXiv preprint","author":"Dai Zhenwei","year":"2019","unstructured":"Zhenwei Dai and Anshumali Shrivastava. 2019. Adaptive learned Bloom filter (Ada-BF): Efficient utilization of the classifier. arXiv preprint (2019)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/3436905.3436919"},{"key":"e_1_3_2_1_11_1","unstructured":"Facebook. 2013. A facebook fork of leveldb which is optimized for flash and big memory machines. https:\/\/rocksdb.org\/."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.851975"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Sanjay Ghemawat Howard Gobioff and Shun-Tak Leung. 2003. The Google File System. ACM 29\u201343.","DOI":"10.1145\/1165389.945450"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080789"},{"key":"e_1_3_2_1_15_1","unstructured":"Google. 2011. LevelDB. A fast and lightweight key\/value database library. http:\/\/code.google.com\/p\/leveldb\/."},{"key":"e_1_3_2_1_16_1","unstructured":"Shalla Secure\u00a0Services KG. 2021. Shalla\u2019s Blacklists. http:\/\/www.shallalist.de\/index.html."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196909"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261567"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389731"},{"key":"e_1_3_2_1_20_1","volume-title":"Advances in Neural Information Processing Systems. Curran Associates","author":"Mitzenmacher Michael","unstructured":"Michael Mitzenmacher. 2018. A model for learned Bloom filters and optimizing by sandwiching. In Advances in Neural Information Processing Systems. Curran Associates, Inc., 464\u2013473."},{"key":"e_1_3_2_1_21_1","unstructured":"Palo\u00a0Alto Networks. 2019. Palo Alto Networks Malicious IP Address Feeds. https:\/\/docs.paloaltonetworks.com\/pan-os\/8-1\/pan-os-admin\/policy\/use-an-external-dynamic-list-in-policy\/palo-alto-networks-malicious-ip-address-feeds."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2015.11.002"},{"key":"e_1_3_2_1_23_1","volume-title":"New methods in language processing and computational natural language learning","author":"Powers MW","unstructured":"David\u00a0MW Powers. 1998. Applications and explanations of Zipf\u2019s law. In New methods in language processing and computational natural language learning. Association for Computational Linguistics."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3267809.3267834"},{"key":"e_1_3_2_1_25_1","unstructured":"Karan Singhal and Philip Weiss. 2020. DeepBloom. https:\/\/github.com\/karan1149\/DeepBloom\/tree\/master\/data."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00061"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196931"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400751.1400798"}],"event":{"name":"WWW '22: The ACM Web Conference 2022","location":"Virtual Event, Lyon France","acronym":"WWW '22","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2022"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3485447.3511996","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3485447.3511996","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:10Z","timestamp":1750191130000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3485447.3511996"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,25]]},"references-count":28,"alternative-id":["10.1145\/3485447.3511996","10.1145\/3485447"],"URL":"https:\/\/doi.org\/10.1145\/3485447.3511996","relation":{},"subject":[],"published":{"date-parts":[[2022,4,25]]},"assertion":[{"value":"2022-04-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}