{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T00:00:40Z","timestamp":1770336040267,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":49,"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"}],"funder":[{"name":"Natural Science Basic Research Plan in Zhejiang Province of China","award":["LGG18F020016"],"award-info":[{"award-number":["LGG18F020016"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61922067, U1736205, 61902305"],"award-info":[{"award-number":["61922067, U1736205, 61902305"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shenzhen Basic Research Grant","award":["JCYJ20170816100819428"],"award-info":[{"award-number":["JCYJ20170816100819428"]}]},{"name":"MoE-CMCC ``Artifical Intelligence' Project","award":["MCM20190701"],"award-info":[{"award-number":["MCM20190701"]}]},{"name":"Natural Science Basic Research Plan in Shaanxi Province of China","award":["2019JM-159"],"award-info":[{"award-number":["2019JM-159"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,9]]},"DOI":"10.1145\/3448016.3452829","type":"proceedings-article","created":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T17:22:39Z","timestamp":1624036959000},"page":"1077-1089","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["Building Fast and Compact Sketches for Approximately Multi-Set Multi-Membership Querying"],"prefix":"10.1145","author":[{"given":"Rundong","family":"Li","sequence":"first","affiliation":[{"name":"Xi'an Jiaotong University, Xi'an, China"}]},{"given":"Pinghui","family":"Wang","sequence":"additional","affiliation":[{"name":"Xi'an Jiaotong University, Xi'an, China"}]},{"given":"Jiongli","family":"Zhu","sequence":"additional","affiliation":[{"name":"Xi'an Jiaotong University, Xi'an, China"}]},{"given":"Junzhou","family":"Zhao","sequence":"additional","affiliation":[{"name":"Xi'an Jiaotong University, Xi'an, China"}]},{"given":"Jia","family":"Di","sequence":"additional","affiliation":[{"name":"Xi'an Jiaotong University, Xi'an, China"}]},{"given":"Xiaofei","family":"Yang","sequence":"additional","affiliation":[{"name":"Xi'an Jiaotong University, Xi'an, China"}]},{"given":"Kai","family":"Ye","sequence":"additional","affiliation":[{"name":"Xi'an Jiaotong University, Xi'an, China"}]}],"member":"320","published-online":{"date-parts":[[2021,6,18]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1224252.1224501"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350275"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_2_4_1","volume-title":"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. 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."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/3213880.3213884"},{"key":"e_1_3_2_2_6_1","volume-title":"Network applications of bloom filters: A survey. Internet mathematics","author":"Broder Andrei","year":"2004","unstructured":"Andrei Broder and Michael Mitzenmacher . 2004. Network applications of bloom filters: A survey. Internet mathematics , Vol. 1 , 4 ( 2004 ), 485--509. Andrei Broder and Michael Mitzenmacher. 2004. Network applications of bloom filters: A survey. Internet mathematics , Vol. 1, 4 (2004), 485--509."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1365815.1365816"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354643"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2017.8117563"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.07.024"},{"key":"e_1_3_2_2_11_1","volume-title":"Nucleic acids research","author":"Clark Karen","year":"2015","unstructured":"Karen Clark , Ilene Karsch-Mizrachi , David J Lipman , James Ostell , and Eric W Sayers . 2015. GenBank. Nucleic acids research , Vol. 44 , D1 ( 2015 ), D67--D72. Karen Clark, Ilene Karsch-Mizrachi, David J Lipman, James Ostell, and Eric W Sayers. 2015. GenBank. Nucleic acids research , Vol. 44, D1 (2015), D67--D72."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872787"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2896377.2901451"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142477"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2674005.2674994"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/285237.285287"},{"key":"e_1_3_2_2_18_1","volume-title":"2019 a. RAMBO: Repeated And Merged Bloom Filter for Multiple Set Membership Testing (MSMT) in Sub-linear time. arXiv preprint arXiv:1910.02611","author":"Gupta Gaurav","year":"2019","unstructured":"Gaurav Gupta , Benjamin Coleman , Tharun Medini , Vijai Mohan , and Anshumali Shrivastava . 2019 a. RAMBO: Repeated And Merged Bloom Filter for Multiple Set Membership Testing (MSMT) in Sub-linear time. arXiv preprint arXiv:1910.02611 ( 2019 ). Gaurav Gupta, Benjamin Coleman, Tharun Medini, Vijai Mohan, and Anshumali Shrivastava. 2019 a. RAMBO: Repeated And Merged Bloom Filter for Multiple Set Membership Testing (MSMT) in Sub-linear time. arXiv preprint arXiv:1910.02611 (2019)."},{"key":"e_1_3_2_2_19_1","volume-title":"2019 b. Sub-linear sequence search via a Repeated And Merged Bloom Filter (RAMBO): indexing 170 TB data in 14 hours. arXiv","author":"Gupta Gaurav","year":"2019","unstructured":"Gaurav Gupta , Minghao Yan , Benjamin Coleman , RA Elworth , Todd Treangen , and Anshumali Shrivastava . 2019 b. Sub-linear sequence search via a Repeated And Merged Bloom Filter (RAMBO): indexing 170 TB data in 14 hours. arXiv ( 2019 ), arXiv--1910. Gaurav Gupta, Minghao Yan, Benjamin Coleman, RA Elworth, Todd Treangen, and Anshumali Shrivastava. 2019 b. Sub-linear sequence search via a Repeated And Merged Bloom Filter (RAMBO): indexing 170 TB data in 14 hours. arXiv (2019), arXiv--1910."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5061957"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196909"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1773912.1773922"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2018.2889329"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766462.2767755"},{"key":"e_1_3_2_2_25_1","unstructured":"Michael Mitzenmacher. 2018. A model for learned bloom filters and optimizing by sandwiching. In Advances in Neural Information Processing Systems. 464--473.  Michael Mitzenmacher. 2018. A model for learned bloom filters and optimizing by sandwiching. In Advances in Neural Information Processing Systems. 464--473."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975055.4"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/358161.358167"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623651"},{"key":"e_1_3_2_2_29_1","volume-title":"NCBI reference sequences (RefSeq): a curated non-redundant sequence database of genomes, transcripts and proteins. Nucleic acids research","author":"Pruitt Kim D","year":"2006","unstructured":"Kim D Pruitt , Tatiana Tatusova , and Donna R Maglott . 2006. NCBI reference sequences (RefSeq): a curated non-redundant sequence database of genomes, transcripts and proteins. Nucleic acids research , Vol. 35 , suppl_1 ( 2006 ), D61--D65. Kim D Pruitt, Tatiana Tatusova, and Donna R Maglott. 2006. NCBI reference sequences (RefSeq): a curated non-redundant sequence database of genomes, transcripts and proteins. Nucleic acids research , Vol. 35, suppl_1 (2006), D61--D65."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72845-0_9"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2536618"},{"key":"e_1_3_2_2_32_1","volume-title":"Meta-Learning Neural Bloom Filters. In International Conference on Machine Learning . 5271--5280","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 . 5271--5280 . Jack Rae, Sergey Bartunov, and Timothy Lillicrap. 2019. Meta-Learning Neural Bloom Filters. In International Conference on Machine Learning . 5271--5280."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-020-00116-2"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2010.06.100344"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2272604"},{"key":"e_1_3_2_2_36_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--302. Brad Solomon and Carl Kingsford. 2016. Fast search of thousands of short-read sequencing experiments. Nature biotechnology , Vol. 34, 3 (2016), 300--302."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56970-3_16"},{"key":"e_1_3_2_2_38_1","volume-title":"Magic Cube Bloom Filter: Answering Membership Queries for Multiple Sets. In 2019 IEEE International Conference on Big Data and Smart Computing (BigComp). IEEE, 1--8.","author":"Sun Zhouyi","year":"2019","unstructured":"Zhouyi Sun , Siang Gao , Bingqing Liu , Yufei Wang , Tong Yang , and Bin Cui . 2019 . Magic Cube Bloom Filter: Answering Membership Queries for Multiple Sets. In 2019 IEEE International Conference on Big Data and Smart Computing (BigComp). IEEE, 1--8. Zhouyi Sun, Siang Gao, Bingqing Liu, Yufei Wang, Tong Yang, and Bin Cui. 2019. Magic Cube Bloom Filter: Answering Membership Queries for Multiple Sets. In 2019 IEEE International Conference on Big Data and Smart Computing (BigComp). IEEE, 1--8."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00105"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.14778\/3364324.3364333"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2873319"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485858"},{"key":"e_1_3_2_2_43_1","volume-title":"Data Mining: Practical machine learning tools and techniques .Morgan Kaufmann.","author":"Witten Ian H","year":"2016","unstructured":"Ian H Witten , Eibe Frank , Mark A Hall , and Christopher J Pal . 2016 . Data Mining: Practical machine learning tools and techniques .Morgan Kaufmann. Ian H Witten, Eibe Frank, Mark A Hall, and Christopher J Pal. 2016. Data Mining: Practical machine learning tools and techniques .Morgan Kaufmann."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPADS.2017.00035"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2017.2730227"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.14778\/2876473.2876476"},{"key":"e_1_3_2_2_47_1","first-page":"134","article-title":"Aging bloom filter with two active buffers for dynamic sets","volume":"1","author":"Yoon MyungKeun","year":"2009","unstructured":"MyungKeun Yoon . 2009 . Aging bloom filter with two active buffers for dynamic sets . IEEE Transactions on Knowledge & Data Engineering 1 (2009), 134 -- 138 . MyungKeun Yoon. 2009. Aging bloom filter with two active buffers for dynamic sets. IEEE Transactions on Knowledge & Data Engineering 1 (2009), 134--138.","journal-title":"IEEE Transactions on Knowledge & Data Engineering"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848077"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1658939.1658975"}],"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.3452829","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3448016.3452829","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:28:05Z","timestamp":1750195685000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3452829"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,9]]},"references-count":49,"alternative-id":["10.1145\/3448016.3452829","10.1145\/3448016"],"URL":"https:\/\/doi.org\/10.1145\/3448016.3452829","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"}}]}}