{"id":"https://openalex.org/W2150999591","doi":"https://doi.org/10.1109/infocom.2014.6848077","title":"Bloom tree: A search tree based on Bloom filters for multiple-set membership testing","display_name":"Bloom tree: A search tree based on Bloom filters for multiple-set membership testing","publication_year":2014,"publication_date":"2014-04-01","ids":{"openalex":"https://openalex.org/W2150999591","doi":"https://doi.org/10.1109/infocom.2014.6848077","mag":"2150999591"},"language":"en","primary_location":{"id":"doi:10.1109/infocom.2014.6848077","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2014.6848077","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2014 - IEEE Conference on Computer Communications","raw_type":"proceedings-article"},"type":"article","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/A5113643194","display_name":"Myung Keun Yoon","orcid":null},"institutions":[{"id":"https://openalex.org/I110273157","display_name":"Kookmin University","ror":"https://ror.org/0049erg63","country_code":"KR","type":"education","lineage":["https://openalex.org/I110273157"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Myung Keun Yoon","raw_affiliation_strings":["Department of Computer Engineering, Kookmin University, Seoul, Korea of Republic"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Kookmin University, Seoul, Korea of Republic","institution_ids":["https://openalex.org/I110273157"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050021707","display_name":"Jinwoo Son","orcid":"https://orcid.org/0000-0003-4844-5730"},"institutions":[{"id":"https://openalex.org/I110273157","display_name":"Kookmin University","ror":"https://ror.org/0049erg63","country_code":"KR","type":"education","lineage":["https://openalex.org/I110273157"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"JinWoo Son","raw_affiliation_strings":["Department of Computer Engineering, Kookmin University, Seoul, Korea of Republic"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Kookmin University, Seoul, Korea of Republic","institution_ids":["https://openalex.org/I110273157"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051333227","display_name":"Seon-Ho Shin","orcid":null},"institutions":[{"id":"https://openalex.org/I110273157","display_name":"Kookmin University","ror":"https://ror.org/0049erg63","country_code":"KR","type":"education","lineage":["https://openalex.org/I110273157"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Seon-Ho Shin","raw_affiliation_strings":["Department of Computer Engineering, Kookmin University, Seoul, Korea of Republic"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Kookmin University, Seoul, Korea of Republic","institution_ids":["https://openalex.org/I110273157"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5113643194"],"corresponding_institution_ids":["https://openalex.org/I110273157"],"apc_list":null,"apc_paid":null,"fwci":3.4481,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.93450991,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1429","last_page":"1437"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9998999834060669,"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.9998999834060669,"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.9952999949455261,"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/T11598","display_name":"Internet Traffic Analysis and Secure E-voting","score":0.9884999990463257,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9913610219955444},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7454286217689514},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.7323793172836304},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6790575385093689},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6769278049468994},{"id":"https://openalex.org/keywords/bloom","display_name":"Bloom","score":0.589007556438446},{"id":"https://openalex.org/keywords/trie","display_name":"Trie","score":0.4506518840789795},{"id":"https://openalex.org/keywords/data-set","display_name":"Data set","score":0.42416831851005554},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34981226921081543},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3279007375240326},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28496450185775757},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17728278040885925},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1476362943649292},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.07729610800743103}],"concepts":[{"id":"https://openalex.org/C147224247","wikidata":"https://www.wikidata.org/wiki/Q885373","display_name":"Bloom filter","level":2,"score":0.9913610219955444},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7454286217689514},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.7323793172836304},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6790575385093689},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6769278049468994},{"id":"https://openalex.org/C155567681","wikidata":"https://www.wikidata.org/wiki/Q2987425","display_name":"Bloom","level":2,"score":0.589007556438446},{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.4506518840789795},{"id":"https://openalex.org/C58489278","wikidata":"https://www.wikidata.org/wiki/Q1172284","display_name":"Data set","level":2,"score":0.42416831851005554},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34981226921081543},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3279007375240326},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28496450185775757},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17728278040885925},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1476362943649292},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.07729610800743103},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocom.2014.6848077","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2014.6848077","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2014 - IEEE Conference on Computer Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1549352151","https://openalex.org/W1993284846","https://openalex.org/W2051000928","https://openalex.org/W2058658645","https://openalex.org/W2069074882","https://openalex.org/W2088351633","https://openalex.org/W2097719921","https://openalex.org/W2101349595","https://openalex.org/W2103644027","https://openalex.org/W2114312434","https://openalex.org/W2116967744","https://openalex.org/W2122011234","https://openalex.org/W2123845384","https://openalex.org/W2125770033","https://openalex.org/W2126540423","https://openalex.org/W2136385615","https://openalex.org/W2151823597","https://openalex.org/W2156338408","https://openalex.org/W2168371416","https://openalex.org/W2234864826","https://openalex.org/W3136682179","https://openalex.org/W4251360957","https://openalex.org/W6674433126","https://openalex.org/W6684843095","https://openalex.org/W6922273519"],"related_works":["https://openalex.org/W2075698953","https://openalex.org/W1989507269","https://openalex.org/W2212047860","https://openalex.org/W2998324560","https://openalex.org/W2277163753","https://openalex.org/W2773435329","https://openalex.org/W2323304991","https://openalex.org/W2367011915","https://openalex.org/W2407380583","https://openalex.org/W2030942072"],"abstract_inverted_index":{"A":[0,15],"Bloom":[1,17,59,94,116,133],"filter":[2,18],"is":[3,138],"a":[4,36,51,90,93,108,119,124],"compact":[5],"and":[6,85,100,135],"randomized":[7],"data":[8,53,110],"structure":[9,54,111],"popularly":[10],"used":[11],"for":[12,55,89,132],"networking":[13],"applications.":[14],"standard":[16],"only":[19,63,97],"answers":[20],"yes/no":[21],"questions":[22],"about":[23],"membership,":[24],"but":[25,67],"recent":[26],"studies":[27],"have":[28],"improved":[29],"it":[30],"so":[31],"that":[32,112],"the":[33],"value":[34],"of":[35,114],"queried":[37],"item":[38,84],"can":[39],"be":[40],"returned,":[41],"supporting":[42],"multiple-set":[43,56],"membership":[44,57],"testing.":[45],"In":[46],"this":[47],"paper,":[48],"we":[49],"design":[50],"new":[52,109],"testing,":[58],"tree,":[60],"which":[61],"not":[62],"achieves":[64],"space":[65],"compactness,":[66],"also":[68],"operates":[69],"more":[70],"efficiently":[71],"than":[72],"existing":[73,78],"ones.":[74],"For":[75],"example,":[76],"when":[77],"work":[79],"requires":[80,96],"107":[81],"bits":[82,99],"per":[83],"11":[86],"memory":[87,102],"accesses":[88],"search":[91],"operation,":[92],"tree":[95,120],"47":[98],"8":[101],"accesses.":[103],"The":[104],"advantages":[105],"come":[106],"from":[107],"consists":[113],"multiple":[115],"filters":[117],"in":[118],"structure.":[121],"We":[122],"study":[123],"theoretical":[125],"analysis":[126],"model":[127],"to":[128],"find":[129],"optimal":[130],"parameters":[131],"trees,":[134],"its":[136],"effectiveness":[137],"verified":[139],"through":[140],"experiments.":[141]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}