{"id":"https://openalex.org/W2160191859","doi":"https://doi.org/10.1109/tvlsi.2008.2012011","title":"Realizing a Sub-Linear Time String-Matching Algorithm With a Hardware Accelerator Using Bloom Filters","display_name":"Realizing a Sub-Linear Time String-Matching Algorithm With a Hardware Accelerator Using Bloom Filters","publication_year":2009,"publication_date":"2009-04-24","ids":{"openalex":"https://openalex.org/W2160191859","doi":"https://doi.org/10.1109/tvlsi.2008.2012011","mag":"2160191859"},"language":"en","primary_location":{"id":"doi:10.1109/tvlsi.2008.2012011","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tvlsi.2008.2012011","pdf_url":null,"source":{"id":"https://openalex.org/S37538908","display_name":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","issn_l":"1063-8210","issn":["1063-8210","1557-9999"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","raw_type":"journal-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/A5084330488","display_name":"Po\u2010Ching Lin","orcid":"https://orcid.org/0000-0001-8294-5857"},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Po-Ching Lin","raw_affiliation_strings":["Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan","institution_ids":["https://openalex.org/I148366613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006801243","display_name":"Yin-Dar Lin","orcid":null},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Yin-Dar Lin","raw_affiliation_strings":["Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan","institution_ids":["https://openalex.org/I148366613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066406411","display_name":"Yuan-Cheng Lai","orcid":null},"institutions":[{"id":"https://openalex.org/I154864474","display_name":"National Taiwan University of Science and Technology","ror":"https://ror.org/00q09pe49","country_code":"TW","type":"education","lineage":["https://openalex.org/I154864474"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Yuan-Cheng Lai","raw_affiliation_strings":["Department of Information Management, National Taiwan University of Science and Technology, Taipei, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Management, National Taiwan University of Science and Technology, Taipei, Taiwan","institution_ids":["https://openalex.org/I154864474"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023540085","display_name":"Yijun Zheng","orcid":"https://orcid.org/0000-0001-7135-8438"},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Yi-Jun Zheng","raw_affiliation_strings":["Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan","institution_ids":["https://openalex.org/I148366613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016035252","display_name":"Tsern\u2010Huei Lee","orcid":"https://orcid.org/0000-0001-9456-1252"},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Tsern-Huei Lee","raw_affiliation_strings":["Department of Communication Engineering, National Chiao Tung University, Hsinchu, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Communication Engineering, National Chiao Tung University, Hsinchu, Taiwan","institution_ids":["https://openalex.org/I148366613"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0723,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.79806964,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"17","issue":"8","first_page":"1008","last_page":"1020"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.9998999834060669,"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/T11478","display_name":"Caching and Content Delivery","score":0.9993000030517578,"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/T10400","display_name":"Network Security and Intrusion Detection","score":0.9933000206947327,"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/computer-science","display_name":"Computer science","score":0.7573957443237305},{"id":"https://openalex.org/keywords/bloom-filter","display_name":"Bloom filter","score":0.7060574293136597},{"id":"https://openalex.org/keywords/string-searching-algorithm","display_name":"String searching algorithm","score":0.6489694714546204},{"id":"https://openalex.org/keywords/executable","display_name":"Executable","score":0.642960250377655},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6093021631240845},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.5613493919372559},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5200597643852234},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5122691988945007},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5098873376846313},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4880918264389038},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4783582091331482},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47462284564971924},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.46588224172592163},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.46399471163749695},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4571916460990906},{"id":"https://openalex.org/keywords/computer-engineering","display_name":"Computer engineering","score":0.45393550395965576},{"id":"https://openalex.org/keywords/computer-hardware","display_name":"Computer hardware","score":0.44948655366897583},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.3899802565574646},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.3385927081108093},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.21112793684005737},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11080911755561829},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10375446081161499}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7573957443237305},{"id":"https://openalex.org/C147224247","wikidata":"https://www.wikidata.org/wiki/Q885373","display_name":"Bloom filter","level":2,"score":0.7060574293136597},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.6489694714546204},{"id":"https://openalex.org/C160145156","wikidata":"https://www.wikidata.org/wiki/Q778586","display_name":"Executable","level":2,"score":0.642960250377655},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6093021631240845},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.5613493919372559},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5200597643852234},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5122691988945007},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5098873376846313},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4880918264389038},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4783582091331482},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47462284564971924},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.46588224172592163},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.46399471163749695},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4571916460990906},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.45393550395965576},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.44948655366897583},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.3899802565574646},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.3385927081108093},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.21112793684005737},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11080911755561829},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10375446081161499},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tvlsi.2008.2012011","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tvlsi.2008.2012011","pdf_url":null,"source":{"id":"https://openalex.org/S37538908","display_name":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","issn_l":"1063-8210","issn":["1063-8210","1557-9999"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.160.4443","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.160.4443","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://speed.cis.nctu.edu.tw/~ydlin/pdf/Realizing_a_sub_linear_time_string_matching_algorithm_with_a_hardware_accelerator_Using_bloom_filters.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.901.6535","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.901.6535","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://ir.nctu.edu.tw:443/bitstream/11536/6887/1/000268282700004.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.44999998807907104,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W118606128","https://openalex.org/W124244495","https://openalex.org/W1503562643","https://openalex.org/W1515839227","https://openalex.org/W1569514888","https://openalex.org/W1614476484","https://openalex.org/W1834037038","https://openalex.org/W1891233321","https://openalex.org/W1911613893","https://openalex.org/W1973272384","https://openalex.org/W1976716770","https://openalex.org/W2003530056","https://openalex.org/W2030102079","https://openalex.org/W2086923710","https://openalex.org/W2089302579","https://openalex.org/W2097030928","https://openalex.org/W2099290142","https://openalex.org/W2099964107","https://openalex.org/W2115025779","https://openalex.org/W2116563953","https://openalex.org/W2116967744","https://openalex.org/W2119335436","https://openalex.org/W2123845384","https://openalex.org/W2132845419","https://openalex.org/W2133560322","https://openalex.org/W2134684274","https://openalex.org/W2134826720","https://openalex.org/W2136955387","https://openalex.org/W2138756088","https://openalex.org/W2146052712","https://openalex.org/W2148310801","https://openalex.org/W2149375166","https://openalex.org/W2149695592","https://openalex.org/W2157867464","https://openalex.org/W2169855483","https://openalex.org/W3144157896","https://openalex.org/W4210951666","https://openalex.org/W6604840509","https://openalex.org/W6630245695","https://openalex.org/W6639982511","https://openalex.org/W6674603171","https://openalex.org/W6680909274"],"related_works":["https://openalex.org/W2150210843","https://openalex.org/W3145288231","https://openalex.org/W2371263218","https://openalex.org/W2092552144","https://openalex.org/W2354196777","https://openalex.org/W2965473297","https://openalex.org/W2108265183","https://openalex.org/W2257399947","https://openalex.org/W2248278495","https://openalex.org/W2386746909"],"abstract_inverted_index":{"Many":[0],"network":[1],"security":[2],"applications":[3],"rely":[4],"on":[5,47,93],"string":[6,41],"matching":[7,42],"to":[8,28,39,55,85,112,118],"detect":[9],"intrusions,":[10],"viruses,":[11],"spam,":[12],"and":[13,74,108,132],"so":[14],"on.":[15],"Since":[16],"software":[17],"implementation":[18],"may":[19],"not":[20,67],"keep":[21],"pace":[22],"with":[23,126],"the":[24,72,87,98,115,144,162,169],"high-speed":[25],"demand,":[26],"turning":[27],"hardware-based":[29],"solutions":[30],"becomes":[31],"promising.":[32],"This":[33,122],"work":[34],"presents":[35],"an":[36],"innovative":[37],"architecture":[38,123],"realize":[40],"in":[43,68,71,75,81,130,135],"sub-linear":[44],"time":[45,106],"based":[46],"algorithmic":[48],"heuristics,":[49],"which":[50],"come":[51],"from":[52],"parallel":[53],"queries":[54],"a":[56,69,103,109,119],"set":[57],"of":[58,89,146],"space-efficient":[59],"Bloom":[60],"filters.":[61],"The":[62,83,140],"algorithm":[63],"allows":[64],"skipping":[65],"characters":[66,80],"match":[70],"text,":[73],"turn":[76],"simultaneously":[77],"inspect":[78],"multiple":[79],"effect.":[82],"techniques":[84],"reduce":[86],"impact":[88],"certain":[90],"bad":[91],"situations":[92],"performance":[94,164],"are":[95,171],"also":[96],"proposed:":[97],"<i":[99],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[100],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">bad-block</i>":[101],"heuristic,":[102],"linear":[104],"worst-case":[105,163],"method":[107],"non-blocking":[110],"interface":[111],"hand":[113],"over":[114],"verification":[116,120],"job":[117],"module.":[121],"is":[124,165],"simulated":[125],"both":[127],"behavior":[128],"simulation":[129,134,141],"C":[131],"timing":[133],"HDL":[136],"for":[137,151],"antivirus":[138],"applications.":[139],"shows":[142],"that":[143],"throughput":[145],"scanning":[147],"Windows":[148],"executable":[149],"files":[150],"more":[152],"than":[153],"10000":[154],"virus":[155],"signatures":[156,170],"can":[157],"achieve":[158],"5.64":[159],"Gb/s,":[160],"while":[161],"1.2":[166],"Gb/s":[167],"if":[168],"properly":[172],"specified.":[173]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}
