{"id":"https://openalex.org/W2168371416","doi":"https://doi.org/10.1109/infcom.2011.5934972","title":"One memory access bloom filters and their generalization","display_name":"One memory access bloom filters and their generalization","publication_year":2011,"publication_date":"2011-04-01","ids":{"openalex":"https://openalex.org/W2168371416","doi":"https://doi.org/10.1109/infcom.2011.5934972","mag":"2168371416"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2011.5934972","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2011.5934972","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Proceedings IEEE INFOCOM","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/A5052243076","display_name":"Qiao Yan","orcid":"https://orcid.org/0000-0003-0412-0416"},"institutions":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yan Qiao","raw_affiliation_strings":["Department of Computer & Information Science & Engineering, University of Florida, Gainesville, FL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer & Information Science & Engineering, University of Florida, Gainesville, FL, USA","institution_ids":["https://openalex.org/I33213144"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100455308","display_name":"Tao Li","orcid":"https://orcid.org/0000-0002-5024-0198"},"institutions":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tao Li","raw_affiliation_strings":["Department of Computer & Information Science & Engineering, University of Florida, Gainesville, FL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer & Information Science & Engineering, University of Florida, Gainesville, FL, USA","institution_ids":["https://openalex.org/I33213144"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006184530","display_name":"Shigang Chen","orcid":"https://orcid.org/0000-0001-7867-7765"},"institutions":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shigang Chen","raw_affiliation_strings":["Department of Computer & Information Science & Engineering, University of Florida, Gainesville, FL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer & Information Science & Engineering, University of Florida, Gainesville, FL, USA","institution_ids":["https://openalex.org/I33213144"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I33213144"],"apc_list":null,"apc_paid":null,"fwci":6.0063,"has_fulltext":false,"cited_by_count":61,"citation_normalized_percentile":{"value":0.97558072,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1745","last_page":"1753"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":1.0,"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":1.0,"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/T12038","display_name":"Covalent Organic Framework Applications","score":0.9919000267982483,"subfield":{"id":"https://openalex.org/subfields/2505","display_name":"Materials Chemistry"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11342","display_name":"Carbon and Quantum Dots Applications","score":0.984000027179718,"subfield":{"id":"https://openalex.org/subfields/2505","display_name":"Materials Chemistry"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials 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.9947906732559204},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.757144570350647},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.7544788718223572},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.7290886640548706},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.610761821269989},{"id":"https://openalex.org/keywords/bloom","display_name":"Bloom","score":0.5717743039131165},{"id":"https://openalex.org/keywords/memory-management","display_name":"Memory management","score":0.4531928300857544},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.42698296904563904},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4202617108821869},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30037468671798706},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16214072704315186},{"id":"https://openalex.org/keywords/computer-hardware","display_name":"Computer hardware","score":0.11630627512931824},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.10221269726753235},{"id":"https://openalex.org/keywords/semiconductor-memory","display_name":"Semiconductor memory","score":0.09146761894226074},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.07622408866882324}],"concepts":[{"id":"https://openalex.org/C147224247","wikidata":"https://www.wikidata.org/wiki/Q885373","display_name":"Bloom filter","level":2,"score":0.9947906732559204},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.757144570350647},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.7544788718223572},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.7290886640548706},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.610761821269989},{"id":"https://openalex.org/C155567681","wikidata":"https://www.wikidata.org/wiki/Q2987425","display_name":"Bloom","level":2,"score":0.5717743039131165},{"id":"https://openalex.org/C176649486","wikidata":"https://www.wikidata.org/wiki/Q2308807","display_name":"Memory management","level":3,"score":0.4531928300857544},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.42698296904563904},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4202617108821869},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30037468671798706},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16214072704315186},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.11630627512931824},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.10221269726753235},{"id":"https://openalex.org/C98986596","wikidata":"https://www.wikidata.org/wiki/Q1143031","display_name":"Semiconductor memory","level":2,"score":0.09146761894226074},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.07622408866882324},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infcom.2011.5934972","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2011.5934972","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Proceedings IEEE INFOCOM","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":19,"referenced_works":["https://openalex.org/W1555974269","https://openalex.org/W1831086767","https://openalex.org/W1993284846","https://openalex.org/W2017005873","https://openalex.org/W2020110631","https://openalex.org/W2059739152","https://openalex.org/W2063544484","https://openalex.org/W2097719921","https://openalex.org/W2123845384","https://openalex.org/W2125770033","https://openalex.org/W2126540423","https://openalex.org/W2132212054","https://openalex.org/W2142808699","https://openalex.org/W2151823597","https://openalex.org/W2156660460","https://openalex.org/W2159068020","https://openalex.org/W4236444653","https://openalex.org/W6654448592","https://openalex.org/W6682963947"],"related_works":["https://openalex.org/W2227807207","https://openalex.org/W2370014100","https://openalex.org/W4287264924","https://openalex.org/W3137108924","https://openalex.org/W1852009617","https://openalex.org/W2051000928","https://openalex.org/W2042819006","https://openalex.org/W2170165007","https://openalex.org/W1979110442","https://openalex.org/W2156660460"],"abstract_inverted_index":{"The":[0],"Bloom":[1,36,78,118],"filters":[2,37,119],"have":[3,40],"been":[4],"extensively":[5],"applied":[6],"in":[7,43,63,102,143],"many":[8,44],"network":[9],"functions.":[10],"Their":[11],"performance":[12,34,87],"is":[13],"judged":[14],"by":[15],"three":[16],"criteria:":[17],"processing":[18],"overhead,":[19,21],"space":[20],"and":[22,93,108,135,138],"false":[23,94,140],"positive":[24,95,141],"ratio.":[25,96],"Due":[26],"to":[27,32,84,115,156],"wide":[28],"applicability,":[29],"any":[30],"improvement":[31],"the":[33,71,100,117],"of":[35,46,75,106,124,132],"can":[38,112],"potentially":[39],"broad":[41],"impact":[42],"areas":[45],"networking":[47],"research.":[48],"In":[49],"this":[50,103],"paper,":[51],"we":[52],"propose":[53],"Bloom-1,":[54],"a":[55,76,121,127,136,152],"new":[56,104,159],"data":[57],"structure":[58],"that":[59,110],"performs":[60],"membership":[61,90],"check":[62],"one":[64],"memory":[65,73,125],"access,":[66],"which":[67],"compares":[68],"favorably":[69],"with":[70,120],"k":[72],"accesses":[74],"classical":[77],"filter.":[79],"We":[80,97,146],"also":[81,147],"generalize":[82],"Bloom-1":[83],"Bloom-g,":[85],"allowing":[86],"tradeoff":[88],"between":[89],"query":[91],"overhead":[92],"thoroughly":[98],"examine":[99],"variants":[101],"family":[105],"filters,":[107],"show":[109],"they":[111],"be":[113],"configured":[114],"outperform":[116],"smaller":[122,128,137],"number":[123,131],"accesses,":[126],"or":[129],"equal":[130],"hash":[133],"bits,":[134],"comparable":[139],"ratio":[142],"practical":[144],"scenarios.":[145],"perform":[148],"experiments":[149],"based":[150],"on":[151],"real":[153],"traffic":[154],"trace":[155],"support":[157],"our":[158],"filter":[160],"design.":[161]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":9}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}