{"id":"https://openalex.org/W2151113535","doi":"https://doi.org/10.1109/infcom.2009.5061957","title":"Fast Multiset Membership Testing Using Combinatorial Bloom Filters","display_name":"Fast Multiset Membership Testing Using Combinatorial Bloom Filters","publication_year":2009,"publication_date":"2009-04-01","ids":{"openalex":"https://openalex.org/W2151113535","doi":"https://doi.org/10.1109/infcom.2009.5061957","mag":"2151113535"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2009.5061957","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2009.5061957","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2009","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100611635","display_name":"Feng Hao","orcid":"https://orcid.org/0000-0002-8664-5074"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"F. Hao","raw_affiliation_strings":["Bell Labs., Alcatel Lucent, Holmdel, NJ","Bell Laboratories, Alcatel-Lucent, Holmdel, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bell Labs., Alcatel Lucent, Holmdel, NJ","institution_ids":[]},{"raw_affiliation_string":"Bell Laboratories, Alcatel-Lucent, Holmdel, NJ, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108507325","display_name":"Murali Kodialam","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. Kodialam","raw_affiliation_strings":["Bell Labs., Alcatel Lucent, Holmdel, NJ","Bell Laboratories, Alcatel-Lucent, Holmdel, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bell Labs., Alcatel Lucent, Holmdel, NJ","institution_ids":[]},{"raw_affiliation_string":"Bell Laboratories, Alcatel-Lucent, Holmdel, NJ, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079816803","display_name":"T. V. Lakshman","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"T. V. Lakshman","raw_affiliation_strings":["Bell Labs., Alcatel Lucent, Holmdel, NJ","Bell Laboratories, Alcatel-Lucent, Holmdel, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bell Labs., Alcatel Lucent, Holmdel, NJ","institution_ids":[]},{"raw_affiliation_string":"Bell Laboratories, Alcatel-Lucent, Holmdel, NJ, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026896241","display_name":"Haoyu Song","orcid":"https://orcid.org/0000-0001-5377-6628"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"H. Song","raw_affiliation_strings":["Bell Labs., Alcatel Lucent, Holmdel, NJ","Bell Laboratories, Alcatel-Lucent, Holmdel, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bell Labs., Alcatel Lucent, Holmdel, NJ","institution_ids":[]},{"raw_affiliation_string":"Bell Laboratories, Alcatel-Lucent, Holmdel, NJ, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"513","last_page":"521"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.993399977684021,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bloom-filter","display_name":"Bloom filter","score":0.9691903591156006},{"id":"https://openalex.org/keywords/multiset","display_name":"Multiset","score":0.8158488273620605},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.7812398672103882},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.741999089717865},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.6601359844207764},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.5431318879127502},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5364027619361877},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5008180141448975},{"id":"https://openalex.org/keywords/filter","display_name":"Filter (signal processing)","score":0.4662180542945862},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.4476904273033142},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44391068816185},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17344319820404053}],"concepts":[{"id":"https://openalex.org/C147224247","wikidata":"https://www.wikidata.org/wiki/Q885373","display_name":"Bloom filter","level":2,"score":0.9691903591156006},{"id":"https://openalex.org/C2779623528","wikidata":"https://www.wikidata.org/wiki/Q864377","display_name":"Multiset","level":2,"score":0.8158488273620605},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.7812398672103882},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.741999089717865},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.6601359844207764},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.5431318879127502},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5364027619361877},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5008180141448975},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.4662180542945862},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.4476904273033142},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44391068816185},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17344319820404053},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infcom.2009.5061957","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2009.5061957","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2009","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W73090597","https://openalex.org/W2069074882","https://openalex.org/W2077229436","https://openalex.org/W2077439570","https://openalex.org/W2101349595","https://openalex.org/W2102778622","https://openalex.org/W2104076828","https://openalex.org/W2117140035","https://openalex.org/W2136385615","https://openalex.org/W2154829922","https://openalex.org/W2158900125","https://openalex.org/W2169100094","https://openalex.org/W4240091567","https://openalex.org/W4285719527","https://openalex.org/W6602966321","https://openalex.org/W6634856661","https://openalex.org/W6668015197"],"related_works":["https://openalex.org/W2227807207","https://openalex.org/W2556892980","https://openalex.org/W2370014100","https://openalex.org/W3137108924","https://openalex.org/W1852009617","https://openalex.org/W4287264924","https://openalex.org/W2042819006","https://openalex.org/W2170165007","https://openalex.org/W1979110442","https://openalex.org/W2156660460"],"abstract_inverted_index":{"In":[0],"this":[1,45,183],"paper":[2],"we":[3,180],"consider":[4],"the":[5,32,60,71,92,111,114,117,125,128,140,148,172,173],"problem":[6,46],"of":[7,31,59,62,86,110,113,127,150,160,176,196],"designing":[8],"a":[9,28,56,76,97,107,194],"data":[10,33,129,152,184,188],"structure":[11,34,130],"that":[12,179],"can":[13],"perform":[14],"fast":[15],"multiset":[16],"membership":[17],"testing":[18],"in":[19,64,67],"deterministic":[20],"time.":[21],"Our":[22],"primary":[23],"goal":[24],"is":[25,101,191],"to":[26,43,69,89,123,170,193],"develop":[27],"hardware":[29,167],"implementation":[30],"which":[35],"uses":[36],"only":[37],"embedded":[38],"memory":[39],"blocks.":[40],"Prior":[41],"efforts":[42],"solve":[44],"involve":[47],"hashing":[48],"into":[49],"multiple":[50,84],"bloom":[51,72,78,99],"filters.":[52],"Such":[53],"approach":[54,81,169],"needs":[55],"priori":[57,108],"knowledge":[58,109],"number":[61,159,175],"elements":[63,115],"each":[65],"set":[66,93],"order":[68],"size":[70],"filter.":[73],"We":[74,120,162],"use":[75,83],"single":[77,98],"filter":[79,100],"based":[80,168],"and":[82],"sets":[85],"hash":[87,177],"functions":[88,178],"code":[90],"for":[91,138,182],"(group)":[94],"id.":[95,142],"Since":[96],"used,":[102],"it":[103],"does":[104],"not":[105],"need":[106,181],"distribution":[112],"across":[116],"different":[118],"sets.":[119,161],"show":[121],"how":[122],"improve":[124],"performance":[126,149],"by":[131],"using":[132],"constant":[133],"weight":[134],"error":[135,144],"correcting":[136,145],"codes":[137,146],"coding":[139],"group":[141],"Using":[143],"improves":[147],"these":[151],"structures":[153],"especially":[154],"when":[155],"there":[156],"are":[157],"large":[158,174],"also":[163],"outline":[164],"an":[165],"efficient":[166],"generate":[171],"structure.":[185],"The":[186],"resulting":[187],"structure,":[189],"COMB,":[190],"amenable":[192],"variety":[195],"time-critical":[197],"network":[198],"applications.":[199]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}