{"id":"https://openalex.org/W2851238970","doi":"https://doi.org/10.1145/3199478.3199509","title":"Exploring Efficient NFA Data Structures to Accelerate DFA Generation","display_name":"Exploring Efficient NFA Data Structures to Accelerate DFA Generation","publication_year":2018,"publication_date":"2018-03-16","ids":{"openalex":"https://openalex.org/W2851238970","doi":"https://doi.org/10.1145/3199478.3199509","mag":"2851238970"},"language":"en","primary_location":{"id":"doi:10.1145/3199478.3199509","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3199478.3199509","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2nd International Conference on Cryptography, Security and Privacy","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/A5000214108","display_name":"Chengcheng Xu","orcid":"https://orcid.org/0000-0003-2417-434X"},"institutions":[{"id":"https://openalex.org/I170215575","display_name":"National University of Defense Technology","ror":"https://ror.org/05d2yfz11","country_code":"CN","type":"education","lineage":["https://openalex.org/I170215575"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chengcheng Xu","raw_affiliation_strings":["College of Compute, National University of Defense Technology, Changsha, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Compute, National University of Defense Technology, Changsha, China","institution_ids":["https://openalex.org/I170215575"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055375948","display_name":"Jinshu Su","orcid":"https://orcid.org/0000-0001-9273-616X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jinshu Su","raw_affiliation_strings":["National Key Laboratory of Parallel and Distributed Processing, Changsha, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Key Laboratory of Parallel and Distributed Processing, Changsha, China","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053674695","display_name":"Shuhui Chen","orcid":"https://orcid.org/0000-0001-7413-8174"},"institutions":[{"id":"https://openalex.org/I170215575","display_name":"National University of Defense Technology","ror":"https://ror.org/05d2yfz11","country_code":"CN","type":"education","lineage":["https://openalex.org/I170215575"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shuhui Chen","raw_affiliation_strings":["College of Compute, National University of Defense Technology, Changsha, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Compute, National University of Defense Technology, Changsha, China","institution_ids":["https://openalex.org/I170215575"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2203,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.3510042,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"56","last_page":"61"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":1.0,"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":1.0,"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/T11269","display_name":"Algorithms and Data Compression","score":0.995199978351593,"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"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9904000163078308,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.8057149052619934},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.7806569337844849},{"id":"https://openalex.org/keywords/trie","display_name":"Trie","score":0.6298801898956299},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.6084991097450256},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5941661596298218},{"id":"https://openalex.org/keywords/regular-expression","display_name":"Regular expression","score":0.5820565819740295},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4965837597846985},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.45402461290359497},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.4207285940647125},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.4152792692184448},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4145750105381012},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37652328610420227},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.3582988977432251}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8057149052619934},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.7806569337844849},{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.6298801898956299},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.6084991097450256},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5941661596298218},{"id":"https://openalex.org/C121329065","wikidata":"https://www.wikidata.org/wiki/Q185612","display_name":"Regular expression","level":2,"score":0.5820565819740295},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4965837597846985},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.45402461290359497},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.4207285940647125},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.4152792692184448},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4145750105381012},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37652328610420227},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.3582988977432251},{"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.1145/3199478.3199509","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3199478.3199509","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2nd International Conference on Cryptography, Security and Privacy","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":26,"referenced_works":["https://openalex.org/W795327029","https://openalex.org/W1491178396","https://openalex.org/W2002089154","https://openalex.org/W2008175851","https://openalex.org/W2030102079","https://openalex.org/W2038810743","https://openalex.org/W2067889717","https://openalex.org/W2072607050","https://openalex.org/W2083002627","https://openalex.org/W2096474000","https://openalex.org/W2108962885","https://openalex.org/W2113422425","https://openalex.org/W2113425091","https://openalex.org/W2115345034","https://openalex.org/W2115419634","https://openalex.org/W2122820686","https://openalex.org/W2134006796","https://openalex.org/W2134684274","https://openalex.org/W2139418336","https://openalex.org/W2153244370","https://openalex.org/W2167971042","https://openalex.org/W2168085026","https://openalex.org/W2241770856","https://openalex.org/W2292420471","https://openalex.org/W2413014272","https://openalex.org/W2498461899"],"related_works":["https://openalex.org/W2355522437","https://openalex.org/W1428391281","https://openalex.org/W2113425091","https://openalex.org/W1999162684","https://openalex.org/W3143588635","https://openalex.org/W2160879187","https://openalex.org/W1677349152","https://openalex.org/W2146605784","https://openalex.org/W2111868903","https://openalex.org/W4388152937"],"abstract_inverted_index":{"Deterministic":[0],"finite":[1],"automata":[2],"(DFA)":[3],"is":[4,26,62],"widely":[5],"employed":[6],"in":[7],"regular":[8,33],"expression":[9],"matching":[10],"for":[11,44,77,108,120],"content-aware":[12],"applications,":[13],"such":[14],"as":[15],"protocol":[16],"identification,":[17],"NIDS,":[18],"load":[19],"balancing,":[20],"traffic":[21],"billing,":[22],"etc.":[23],"Subset":[24,49],"construction":[25,50],"the":[27,36,66,71,78,89,93,99,104,109,121,126,131,138,142,146,161,173],"most":[28],"time-consuming":[29],"process":[30],"when":[31],"converting":[32],"expressions":[34],"to":[35,144,170,182],"corresponding":[37],"DFA,":[38],"which":[39],"brings":[40],"a":[41,166,178],"great":[42],"challenge":[43],"fast":[45],"update":[46],"application":[47],"scenarios.":[48],"mainly":[51,101],"consists":[52],"of":[53,84,141,168,180],"subset":[54,57,60,72,152,162],"computation":[55,73,163],"and":[56,80,92,130,172],"comparison.":[58],"The":[59],"comparison":[61],"efficiently":[63],"processed":[64],"with":[65],"trie":[67],"tree":[68],"structure,":[69],"but":[70],"still":[74],"remains":[75],"inefficient":[76],"massive":[79],"repetitive":[81],"memory":[82,149],"accesses":[83,150],"NFA":[85,110,122],"state":[86,111,123],"transitions.":[87,112],"Through":[88],"theoretical":[90],"analysis":[91],"example":[94],"demonstration,":[95],"we":[96,114],"prove":[97],"that":[98,160],"inefficiency":[100],"originates":[102],"from":[103],"traditional":[105],"list":[106,128],"structures":[107,119,136],"Then,":[113],"proposed":[115],"two":[116],"improved":[117],"data":[118],"transitions,":[124],"namely":[125],"ordered":[127,132],"structure":[129],"array":[133],"structure.":[134],"These":[135],"leverage":[137],"alphabetical":[139],"order":[140],"transitions":[143],"avoid":[145],"huge":[147],"irrelevant":[148],"during":[151],"computation.":[153],"Experiments":[154],"on":[155],"practical":[156],"rule":[157],"sets":[158],"demonstrate":[159],"procedure":[164],"achieves":[165,177],"speedup":[167,179],"6x":[169],"8x":[171],"total":[174],"DFA":[175],"generation":[176],"2x":[181],"4x.":[183]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}