{"id":"https://openalex.org/W2807616588","doi":"https://doi.org/10.1145/3211922.3211926","title":"Optimistic regular expression matching on FPGAs for near-data processing","display_name":"Optimistic regular expression matching on FPGAs for near-data processing","publication_year":2018,"publication_date":"2018-06-05","ids":{"openalex":"https://openalex.org/W2807616588","doi":"https://doi.org/10.1145/3211922.3211926","mag":"2807616588"},"language":"en","primary_location":{"id":"doi:10.1145/3211922.3211926","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3211922.3211926","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 14th International Workshop on Data Management on New Hardware","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/A5054355703","display_name":"Andreas Becher","orcid":"https://orcid.org/0000-0003-2750-7349"},"institutions":[{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andreas Becher","raw_affiliation_strings":["Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg (FAU), Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg (FAU), Germany","institution_ids":["https://openalex.org/I181369854"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036056755","display_name":"Stefan Wildermann","orcid":"https://orcid.org/0000-0002-4324-2187"},"institutions":[{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Stefan Wildermann","raw_affiliation_strings":["Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg (FAU), Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg (FAU), Germany","institution_ids":["https://openalex.org/I181369854"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076672029","display_name":"J\u00fcrgen Teich","orcid":"https://orcid.org/0000-0001-6285-5862"},"institutions":[{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"J\u00fcrgen Teich","raw_affiliation_strings":["Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg (FAU), Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg (FAU), Germany","institution_ids":["https://openalex.org/I181369854"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4751,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.62125058,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"3"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9975000023841858,"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/regular-expression","display_name":"Regular expression","score":0.9659282565116882},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7776511311531067},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.719323992729187},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.6850221157073975},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.6796234250068665},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.6355845332145691},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.6183499693870544},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5560547113418579},{"id":"https://openalex.org/keywords/field-programmable-gate-array","display_name":"Field-programmable gate array","score":0.5203146934509277},{"id":"https://openalex.org/keywords/expression","display_name":"Expression (computer science)","score":0.49144184589385986},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.48535600304603577},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.47880086302757263},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4290025234222412},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3652808964252472},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.2657766342163086},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2388441264629364},{"id":"https://openalex.org/keywords/computer-hardware","display_name":"Computer hardware","score":0.1679147481918335},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13985097408294678}],"concepts":[{"id":"https://openalex.org/C121329065","wikidata":"https://www.wikidata.org/wiki/Q185612","display_name":"Regular expression","level":2,"score":0.9659282565116882},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7776511311531067},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.719323992729187},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.6850221157073975},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.6796234250068665},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.6355845332145691},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.6183499693870544},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5560547113418579},{"id":"https://openalex.org/C42935608","wikidata":"https://www.wikidata.org/wiki/Q190411","display_name":"Field-programmable gate array","level":2,"score":0.5203146934509277},{"id":"https://openalex.org/C90559484","wikidata":"https://www.wikidata.org/wiki/Q778379","display_name":"Expression (computer science)","level":2,"score":0.49144184589385986},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.48535600304603577},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47880086302757263},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4290025234222412},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3652808964252472},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.2657766342163086},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2388441264629364},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.1679147481918335},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13985097408294678},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3211922.3211926","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3211922.3211926","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 14th International Workshop on Data Management on New Hardware","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":9,"referenced_works":["https://openalex.org/W1707172707","https://openalex.org/W2048466306","https://openalex.org/W2127470500","https://openalex.org/W2148089006","https://openalex.org/W2276268482","https://openalex.org/W2507744471","https://openalex.org/W2567435594","https://openalex.org/W4245287157","https://openalex.org/W4251828973"],"related_works":["https://openalex.org/W3143588635","https://openalex.org/W4249650827","https://openalex.org/W2115419634","https://openalex.org/W2090734721","https://openalex.org/W2160879187","https://openalex.org/W2603910788","https://openalex.org/W2394954760","https://openalex.org/W2281054049","https://openalex.org/W2167032348","https://openalex.org/W2113629662"],"abstract_inverted_index":{"Regular":[0],"expressions":[1,87],"(regex)":[2],"are":[3],"the":[4,13,37,59,67,70,82],"main":[5],"means":[6],"to":[7,40,45],"search":[8],"for":[9],"specific":[10],"patterns":[11],"in":[12],"vast":[14],"amount":[15,76],"of":[16,25,66,75,77,81],"stored":[17],"textual":[18],"information.":[19],"As":[20],"a":[21,46],"consequence,":[22],"different":[23],"designs":[24],"hardware":[26,60,64],"accelerators":[27],"have":[28],"been":[29],"proposed":[30],"that":[31],"enable":[32],"memory-bound":[33],"regex":[34],"processing.":[35],"Here,":[36],"regular":[38,86],"expression":[39],"be":[41,89],"evaluated":[42],"is":[43,55],"translated":[44],"non-deterministic":[47],"(NFA)":[48],"or":[49],"deterministic":[50],"finite":[51],"automaton":[52],"(DFA)":[53],"which":[54],"then":[56],"mapped":[57],"onto":[58],"design.":[61],"The":[62],"available":[63],"resources":[65],"design":[68],"imply":[69],"maximum":[71],"size":[72],"(in":[73],"terms":[74],"states":[78],"and":[79],"transitions)":[80],"supported":[83],"automata.":[84],"However,":[85],"may":[88],"arbitrarily":[90],"complex.":[91]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}