{"id":"https://openalex.org/W2083002627","doi":"https://doi.org/10.1109/tnet.2014.2309014","title":"Bypassing Space Explosion in High-Speed Regular Expression Matching","display_name":"Bypassing Space Explosion in High-Speed Regular Expression Matching","publication_year":2014,"publication_date":"2014-04-29","ids":{"openalex":"https://openalex.org/W2083002627","doi":"https://doi.org/10.1109/tnet.2014.2309014","mag":"2083002627"},"language":"en","primary_location":{"id":"doi:10.1109/tnet.2014.2309014","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2014.2309014","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"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/ACM Transactions on Networking","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/A5005413059","display_name":"Jignesh Patel","orcid":null},"institutions":[{"id":"https://openalex.org/I87216513","display_name":"Michigan State University","ror":"https://ror.org/05hs6h993","country_code":"US","type":"education","lineage":["https://openalex.org/I87216513"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jignesh Patel","raw_affiliation_strings":["Department of Computer Science and Engineering, Michigan State University, East Lansing, MI","Dept. of Computer Science & Eng., Michigan State University, East Lansing, MI#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Michigan State University, East Lansing, MI","institution_ids":["https://openalex.org/I87216513"]},{"raw_affiliation_string":"Dept. of Computer Science & Eng., Michigan State University, East Lansing, MI#TAB#","institution_ids":["https://openalex.org/I87216513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008787905","display_name":"Alex X. Liu","orcid":"https://orcid.org/0000-0002-6916-1326"},"institutions":[{"id":"https://openalex.org/I87216513","display_name":"Michigan State University","ror":"https://ror.org/05hs6h993","country_code":"US","type":"education","lineage":["https://openalex.org/I87216513"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alex X. Liu","raw_affiliation_strings":["Department of Computer Science and Engineering, Michigan State University, East Lansing, MI","Dept. of Computer Science & Eng., Michigan State University, East Lansing, MI#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Michigan State University, East Lansing, MI","institution_ids":["https://openalex.org/I87216513"]},{"raw_affiliation_string":"Dept. of Computer Science & Eng., Michigan State University, East Lansing, MI#TAB#","institution_ids":["https://openalex.org/I87216513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027040066","display_name":"Eric Torng","orcid":"https://orcid.org/0000-0002-1400-0840"},"institutions":[{"id":"https://openalex.org/I87216513","display_name":"Michigan State University","ror":"https://ror.org/05hs6h993","country_code":"US","type":"education","lineage":["https://openalex.org/I87216513"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eric Torng","raw_affiliation_strings":["Department of Computer Science and Engineering, Michigan State University, East Lansing, MI","Dept. of Computer Science & Eng., Michigan State University, East Lansing, MI#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Michigan State University, East Lansing, MI","institution_ids":["https://openalex.org/I87216513"]},{"raw_affiliation_string":"Dept. of Computer Science & Eng., Michigan State University, East Lansing, MI#TAB#","institution_ids":["https://openalex.org/I87216513"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I87216513"],"apc_list":null,"apc_paid":null,"fwci":3.3883,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.92524844,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"22","issue":"6","first_page":"1701","last_page":"1714"},"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/T10400","display_name":"Network Security and Intrusion Detection","score":0.995199978351593,"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/T11441","display_name":"Organoboron and organosilicon chemistry","score":0.9902999997138977,"subfield":{"id":"https://openalex.org/subfields/1605","display_name":"Organic Chemistry"},"field":{"id":"https://openalex.org/fields/16","display_name":"Chemistry"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/regular-expression","display_name":"Regular expression","score":0.8540486693382263},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.7754753232002258},{"id":"https://openalex.org/keywords/dfa-minimization","display_name":"DFA minimization","score":0.7153056859970093},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6951504945755005},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.6879072785377502},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.673811137676239},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.6161121726036072},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.5900151133537292},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5255362391471863},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.4786847233772278},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4687291085720062},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4380437135696411},{"id":"https://openalex.org/keywords/\u03c9-automaton","display_name":"\u03c9-automaton","score":0.4207388162612915},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.41368716955184937},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40712183713912964},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.3942255675792694},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.3504211902618408},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22861969470977783},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12054160237312317}],"concepts":[{"id":"https://openalex.org/C121329065","wikidata":"https://www.wikidata.org/wiki/Q185612","display_name":"Regular expression","level":2,"score":0.8540486693382263},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.7754753232002258},{"id":"https://openalex.org/C65753522","wikidata":"https://www.wikidata.org/wiki/Q5204896","display_name":"DFA minimization","level":5,"score":0.7153056859970093},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6951504945755005},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.6879072785377502},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.673811137676239},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.6161121726036072},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.5900151133537292},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5255362391471863},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.4786847233772278},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4687291085720062},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4380437135696411},{"id":"https://openalex.org/C92710233","wikidata":"https://www.wikidata.org/wiki/Q291256","display_name":"\u03c9-automaton","level":5,"score":0.4207388162612915},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.41368716955184937},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40712183713912964},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.3942255675792694},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.3504211902618408},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22861969470977783},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12054160237312317},{"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/tnet.2014.2309014","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2014.2309014","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"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/ACM Transactions on Networking","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.697.8772","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.697.8772","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.msu.edu/%7Etorng/Research/Pubs/D2FAconstructionToN2014.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.717.3838","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.717.3838","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.msu.edu/%7Ealexliu/publications/D2FAconstruction/D2FAconstruction_ToN.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.44999998807907104}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W1516506771","https://openalex.org/W1531610435","https://openalex.org/W1655192411","https://openalex.org/W1674877186","https://openalex.org/W1707172707","https://openalex.org/W1802290782","https://openalex.org/W1891233321","https://openalex.org/W1911613893","https://openalex.org/W1960511147","https://openalex.org/W2002089154","https://openalex.org/W2006508099","https://openalex.org/W2027627461","https://openalex.org/W2030102079","https://openalex.org/W2038810743","https://openalex.org/W2063109203","https://openalex.org/W2076238443","https://openalex.org/W2096474000","https://openalex.org/W2099964107","https://openalex.org/W2106062486","https://openalex.org/W2106160659","https://openalex.org/W2108962885","https://openalex.org/W2111990320","https://openalex.org/W2113422425","https://openalex.org/W2113425091","https://openalex.org/W2119423764","https://openalex.org/W2122493035","https://openalex.org/W2122820686","https://openalex.org/W2134684274","https://openalex.org/W2139418336","https://openalex.org/W2149375166","https://openalex.org/W2149695592","https://openalex.org/W2153122359","https://openalex.org/W2153244370","https://openalex.org/W2167971042","https://openalex.org/W2168085026","https://openalex.org/W2395512663","https://openalex.org/W4240018668","https://openalex.org/W4247093768","https://openalex.org/W4302339081","https://openalex.org/W6631793881","https://openalex.org/W6637096788","https://openalex.org/W6637452973","https://openalex.org/W6638277145","https://openalex.org/W6675572914","https://openalex.org/W6676122042","https://openalex.org/W6712056307"],"related_works":["https://openalex.org/W4205935260","https://openalex.org/W2537940722","https://openalex.org/W2368684504","https://openalex.org/W1975910189","https://openalex.org/W2030569822","https://openalex.org/W2079577017","https://openalex.org/W3143588635","https://openalex.org/W2560779797","https://openalex.org/W2060871291","https://openalex.org/W9554130"],"abstract_inverted_index":{"Network":[0],"intrusion":[1],"detection":[2],"and":[3,78,236,267],"prevention":[4],"systems":[5],"commonly":[6],"use":[7],"regular":[8],"expression":[9],"(RE)":[10],"signatures":[11],"to":[12,36,46,133,140,183,230,281],"represent":[13],"individual":[14],"security":[15],"threats.":[16],"While":[17],"the":[18,32,37,63,66,96,100,120,152,169,177,203],"corresponding":[19,97,153],"deterministic":[20],"finite":[21,75,137],"state":[22],"automata":[23,59,76,90,103,121,138,200],"(DFA)":[24],"for":[25,122,196,239],"any":[26],"one":[27],"RE":[28,124],"is":[29,42,165,180,233],"typically":[30,92],"small,":[31],"DFA":[33,81,141,155,164],"that":[34,61,168,211],"corresponds":[35],"entire":[38],"set":[39],"of":[40,57,65,299],"REs":[41],"usually":[43],"too":[44],"large":[45,147,154,167],"be":[47,173,184],"constructed":[48,174],"or":[49],"deployed.":[50,185],"To":[51],"address":[52],"this":[53,163,187],"issue,":[54],"a":[55,114,145,191,234,249,283],"variety":[56],"alternative":[58,199],"implementations":[60],"compress":[62],"size":[64],"final":[67,89,170,178,218],"automaton":[68,171,179],"have":[69],"been":[70],"proposed":[71,102],"such":[72],"as":[73,156],"extended":[74],"(XFA)":[77],"delayed":[79],"input":[80],"(D":[82],"<sup":[83,205,220,244,252,285],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[84,206,221,245,253,286],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[85,207,222,246,254,287],"FA).":[86],"The":[87,228],"resulting":[88],"are":[91,125,279],"much":[93],"smaller":[94],"than":[95,273],"DFA.":[98],"However,":[99],"previously":[101],"construction":[104,143],"algorithms":[105],"do":[106],"suffer":[107],"from":[108],"some":[109,161],"drawbacks.":[110],"First,":[111],"most":[112,150],"employ":[113],"\u201cUnion":[115],"then":[116,193],"Minimize\u201d":[117],"framework":[118,195],"where":[119],"each":[123],"first":[126],"joined":[127],"before":[128],"minimization":[129],"occurs.":[130],"This":[131],"leads":[132],"an":[134,157,215],"expensive":[135],"nondeterministic":[136],"(NFA)":[139],"subset":[142],"on":[144,202,262],"relatively":[146],"NFA.":[148],"Second,":[149],"construct":[151,214,282],"intermediate":[158,226],"step.":[159],"In":[160,186,256],"cases,":[162],"so":[166],"cannot":[172],"even":[175],"though":[176],"small":[181,225],"enough":[182],"paper,":[188],"we":[189,212,278],"propose":[190],"\u201cMinimize":[192],"Union\u201d":[194],"constructing":[197],"compact":[198,242,250],"focusing":[201],"D":[204,219,243,251,284],"FA.":[208,255],"We":[209],"show":[210],"can":[213],"almost":[216],"optimal":[217],"FA":[223,247,288],"with":[224,289],"parsers.":[227],"key":[229],"our":[231,257,259],"approach":[232],"space-":[235],"time-efficient":[237],"routine":[238],"merging":[240],"two":[241],"into":[248],"experiments,":[258],"algorithm":[260],"runs":[261],"average":[263],"155":[264],"times":[265,270],"faster":[266],"uses":[268],"1500":[269],"less":[271],"memory":[272,301],"previous":[274],"algorithms.":[275],"For":[276],"example,":[277],"able":[280],"over":[290],"80":[291],"000":[292,293],"states":[294],"using":[295],"only":[296,303],"1":[297],"GB":[298],"main":[300],"in":[302],"77":[304],"min.":[305]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}