{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,26]],"date-time":"2026-07-26T05:12:04Z","timestamp":1785042724588,"version":"3.55.0"},"reference-count":159,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772544"],"award-info":[{"award-number":["61772544"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Hunan Provincial Natural Science Fund for Distinguished Young Scholars","award":["2016JJ1002"],"award-info":[{"award-number":["2016JJ1002"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Commun. Surv. Tutorials"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/comst.2018.2889329","type":"journal-article","created":{"date-parts":[[2018,12,24]],"date-time":"2018-12-24T23:11:52Z","timestamp":1545693112000},"page":"1912-1949","source":"Crossref","is-referenced-by-count":192,"title":["Optimizing Bloom Filter: Challenges, Solutions, and Comparisons"],"prefix":"10.1109","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2731-9666","authenticated-orcid":false,"given":"Lailong","family":"Luo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4894-5540","authenticated-orcid":false,"given":"Deke","family":"Guo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Richard T. B.","family":"Ma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ori","family":"Rottenstreich","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xueshan","family":"Luo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.17485\/ijst\/2016\/v9i48\/107972"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/PIMRC.2005.1651679"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/358161.358167"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/358628.358632"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2013.09.003"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129096"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/PAAP.2012.9"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/90.851975"},{"key":"ref35","author":"graham","year":"1994","journal-title":"Concrete Mathematics"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.05.018"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2013.2242884"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2014.767"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2011.031611.00024"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2618006"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610528"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120248"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.215"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2849997"},{"key":"ref101","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_61"},{"key":"ref26","first-page":"1","article-title":"When a Bloom filter is a doom filter: Security assessment of a novel iris biometric template protection system","author":"hermans","year":"2014","journal-title":"Proc BIOSIG"},{"key":"ref100","doi-asserted-by":"publisher","DOI":"10.1109\/CIC.2016.048"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.14778\/2536354.2536359"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/ICISIP.2006.4286065"},{"key":"ref51","first-page":"1","article-title":"CBRF: Bloom filter routing with gradual forgetting for tree-structured wireless sensor networks with mobile nodes","author":"reinhardt","year":"2012","journal-title":"Proc IEEE WoWMoM"},{"key":"ref154","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2017.8117563"},{"key":"ref153","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975055.4"},{"key":"ref156","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035963"},{"key":"ref155","article-title":"The consistent Cuckoo filter","author":"luo","year":"2019","journal-title":"Proc IEEE InfoCom"},{"key":"ref150","doi-asserted-by":"publisher","DOI":"10.1145\/2674005.2674994"},{"key":"ref152","first-page":"1","article-title":"Cuckoo filter: Simplification and analysis","author":"eppstein","year":"2016","journal-title":"Proc SWAT"},{"key":"ref151","article-title":"Don’t thrash: How to cache your hash on flash","author":"bender","year":"2011","journal-title":"Proc USENIX HotStorage"},{"key":"ref146","doi-asserted-by":"publisher","DOI":"10.1109\/DFT.2015.7315140"},{"key":"ref147","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2017.2702174"},{"key":"ref148","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196909"},{"key":"ref149","article-title":"A model for learned Bloom filters and related structures","author":"mitzenmacher","year":"2018","journal-title":"ArXiv Preprint"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2017.2747598"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2017.2749508"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-20810-7_15"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2016.7564969"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2349916"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1049\/iet-bmt.2013.0049"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TCCN.2017.2702163"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/WSCNIS.2015.7368280"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2012.193"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195596"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2011.6089061"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.11"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2015.05.002"},{"key":"ref159","volume":"3","author":"knuth","year":"1973","journal-title":"The Art of Computer Programming Sorting and Searching"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2009.10.002"},{"key":"ref49","article-title":"Hint-based routing in WSNs using scope decay Bloom filters","author":"li","year":"2006","journal-title":"Proceedings of IEEE NAS"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2018.2798668"},{"key":"ref157","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.002"},{"key":"ref158","first-page":"371","article-title":"MemC3: Compact and concurrent Memcache with dumber caching and smarter hashing","author":"fan","year":"2013","journal-title":"Proc USENIX NSDI"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195533"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21560-5_36"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2013.112413.132231"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2018.2840123"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2014.05.016"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2010.12.005"},{"key":"ref41","first-page":"1","article-title":"An enhanced Bloom filter for longest prefix matching","author":"park","year":"2013","journal-title":"Proc IEEE\/ACM IWQoS"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6566742"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2342155"},{"key":"ref127","doi-asserted-by":"publisher","DOI":"10.1145\/1236360.1236412"},{"key":"ref126","doi-asserted-by":"publisher","DOI":"10.1145\/1275986.1275991"},{"key":"ref125","first-page":"205","article-title":"Bigtable: A distributed storage system for structured data","author":"chang","year":"2006","journal-title":"Proc USENIX OSDI"},{"key":"ref124","year":"2017","journal-title":"The Redis website"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2015.2478462"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.12785\/amis\/080445"},{"key":"ref129","doi-asserted-by":"publisher","DOI":"10.1186\/gb-2014-15-3-r46"},{"key":"ref71","first-page":"249","article-title":"On reducing false positives of a Bloom filter in trie-based algorithms","author":"ju","year":"2014","journal-title":"Proc ACM\/IEEE ANCS"},{"key":"ref128","first-page":"433","article-title":"Cheap and large CAMs for high performance data-intensive networked systems","author":"anand","year":"2010","journal-title":"Proc USENIX NSDI"},{"key":"ref70","article-title":"Publish\/subscribe for Internet: PSIRP perspective","author":"lagutin","year":"2010","journal-title":"Towards the Future Internet-Emerging Trends from European Research"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2010.12.025"},{"key":"ref130","doi-asserted-by":"publisher","DOI":"10.1101\/gr.074492.107"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2013.51"},{"key":"ref74","article-title":"Yes–no Bloom filter: A way of representing sets with fewer false positives","author":"carrea","year":"2016","journal-title":"arXiv preprint arXiv 1603 02895"},{"key":"ref75","article-title":"Retouched Bloom filters: Allowing networked applications to trade off selected false positives against false negatives","author":"chazelle","year":"2006","journal-title":"Proc ACM CoNEXT"},{"key":"ref133","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2010.06.100344"},{"key":"ref134","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2624286"},{"key":"ref131","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2016.0155"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2007.10129136"},{"key":"ref132","doi-asserted-by":"publisher","DOI":"10.1186\/s13015-016-0066-8"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1145\/1254882.1254916"},{"key":"ref136","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.54"},{"key":"ref135","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142477"},{"key":"ref138","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.136"},{"key":"ref137","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354643"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2018.2798280"},{"key":"ref139","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-016-0567-8"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2018.2818623"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2018.2842460"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2015.2467385"},{"key":"ref64","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1016\/j.pmcj.2017.07.006","article-title":"Decentralised peer-to-peer data dissemination in wireless sensor networks","volume":"40","author":"cisse","year":"2017","journal-title":"Pervasive Mobile Comput"},{"key":"ref140","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"ref65","first-page":"1851","article-title":"Robust Bloom filters for large multilabel classification tasks","author":"carbajo","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref141","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2015.2418767"},{"key":"ref142","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2015.2401011"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2013.09.002"},{"key":"ref143","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972863.4"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2012.6503540"},{"key":"ref144","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2011.108"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2248361.2248369"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2013.6655118"},{"key":"ref145","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1145\/2043164.2018462","article-title":"What’s the difference? Efficient set reconciliation without prior context","author":"eppstein","year":"2011","journal-title":"Proc ACM Sigcomm"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"ref109","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2008.081176"},{"key":"ref95","first-page":"30","article-title":"The Bloomier filter: An efficient data structure for static support lookup tables","author":"chazelle","year":"2004","journal-title":"Proc ACM-SIAM"},{"key":"ref108","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2006.1603387"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2009.39"},{"key":"ref107","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2006.255126"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2535286"},{"key":"ref106","first-page":"1","article-title":"A forest-structured Bloom filter with flash memory","author":"lu","year":"2011","journal-title":"Proc IEEE MSST"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.46"},{"key":"ref105","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261567"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1177\/1094342015618452"},{"key":"ref104","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916641"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOTS.2011.36"},{"key":"ref103","doi-asserted-by":"publisher","DOI":"10.1109\/CIT.2011.61"},{"key":"ref102","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2008.ECP.476"},{"key":"ref111","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2008.2000244"},{"key":"ref112","doi-asserted-by":"publisher","DOI":"10.1145\/872785.872787"},{"key":"ref110","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2012.6364449"},{"key":"ref98","doi-asserted-by":"publisher","DOI":"10.1109\/IWQoS.2017.7969125"},{"key":"ref99","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.803864"},{"key":"ref96","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062180"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5061957"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2363458"},{"key":"ref11","first-page":"311","article-title":"FlowRadar: A better NetFlow for data centers","author":"li","year":"2016","journal-title":"Proc USENIX NSDI"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.91"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.87"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2805789.2805800"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2015.7417863"},{"key":"ref118","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.10.007"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.39"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1142\/SAM"},{"key":"ref117","first-page":"1006","article-title":"Bloom filters: Design innovations and novel applications","author":"lu","year":"2005","journal-title":"Proc Annu Allerton Conf Commun Control Comput"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2015.06.011"},{"key":"ref81","author":"pei","year":"1996","journal-title":"Chinese Remainder Theorem Applications in Computing Coding Cryptography"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2012.6232390"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2015.11.002"},{"key":"ref119","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261978"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848046"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195563"},{"key":"ref114","doi-asserted-by":"publisher","DOI":"10.1093\/ietisy\/e91-d.5.1292"},{"key":"ref113","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2014.2343997"},{"key":"ref116","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39658-1_55"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8486415"},{"key":"ref115","doi-asserted-by":"publisher","DOI":"10.14778\/2876473.2876476"},{"key":"ref120","doi-asserted-by":"publisher","DOI":"10.1145\/1400751.1400798"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.57"},{"key":"ref121","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294281"},{"key":"ref122","year":"2017","journal-title":"Memcached Website"},{"key":"ref123","year":"2017","journal-title":"Cassandra Website"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20208"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1109\/IWQoS.2015.7404748"},{"key":"ref87","first-page":"456","article-title":"Building a better Bloom filter","author":"kirsch","year":"2005","journal-title":"Proc European Symp Algorithms"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1145\/948205.948226"}],"container-title":["IEEE Communications Surveys & Tutorials"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9739\/8727625\/08586915.pdf?arnumber=8586915","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T02:54:40Z","timestamp":1657853680000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8586915\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":159,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/comst.2018.2889329","relation":{},"ISSN":["1553-877X","2373-745X"],"issn-type":[{"value":"1553-877X","type":"electronic"},{"value":"2373-745X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}