{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:59:50Z","timestamp":1750309190193,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T00:00:00Z","timestamp":1528675200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,6,11]]},"DOI":"10.1145\/3211922.3211926","type":"proceedings-article","created":{"date-parts":[[2018,6,5]],"date-time":"2018-06-05T17:54:00Z","timestamp":1528221240000},"page":"1-3","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Optimistic regular expression matching on FPGAs for near-data processing"],"prefix":"10.1145","author":[{"given":"Andreas","family":"Becher","sequence":"first","affiliation":[{"name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg (FAU), Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Wildermann","sequence":"additional","affiliation":[{"name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg (FAU), Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00fcrgen","family":"Teich","sequence":"additional","affiliation":[{"name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg (FAU), Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2014.55"},{"volume-title":"2015 International Conference on Field Programmable Technology (FPT). 192--195","author":"Becher A.","key":"e_1_3_2_1_2_1","unstructured":"A. Becher , D. Ziener , K. Meyer-Wegener , and J. Teich . 2015. A co-design approach for accelerated SQL query processing via FPGA-based data filtering . In 2015 International Conference on Field Programmable Technology (FPT). 192--195 . A. Becher, D. Ziener, K. Meyer-Wegener, and J. Teich. 2015. A co-design approach for accelerated SQL query processing via FPGA-based data filtering. In 2015 International Conference on Field Programmable Technology (FPT). 192--195."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/VLSIC.2014.6858357"},{"volume-title":"ROM-Based Finite State Machine Implementation in Low Cost FPGAs. In 2007 IEEE International Symposium on Industrial Electronics. 2342--2347","author":"Garcia-Vargas I.","key":"e_1_3_2_1_4_1","unstructured":"I. Garcia-Vargas , R. Senhadji-Navarro , G. Jimenez-Moreno , A. Civit-Balcells , and P. Guerra-Gutierrez . 2007 . ROM-Based Finite State Machine Implementation in Low Cost FPGAs. In 2007 IEEE International Symposium on Industrial Electronics. 2342--2347 . I. Garcia-Vargas, R. Senhadji-Navarro, G. Jimenez-Moreno, A. Civit-Balcells, and P. Guerra-Gutierrez. 2007. ROM-Based Finite State Machine Implementation in Low Cost FPGAs. In 2007 IEEE International Symposium on Industrial Electronics. 2342--2347."},{"volume-title":"2016 49th Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO). 1--12","author":"Gogte V.","key":"e_1_3_2_1_5_1","unstructured":"V. Gogte , A. Kolli , M. J. Cafarella , L. D'Antoni , and T. F. Wenisch . 2016. HARE: Hardware accelerator for regular expressions . In 2016 49th Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO). 1--12 . V. Gogte, A. Kolli, M. J. Cafarella, L. D'Antoni, and T. F. Wenisch. 2016. HARE: Hardware accelerator for regular expressions. In 2016 49th Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO). 1--12."},{"key":"e_1_3_2_1_6_1","volume-title":"Retrieved","author":"Google Inc.","year":"2018","unstructured":"Google Inc. 2018 . RE2 is a fast, safe, thread-friendly alternative to backtracking regular expression engines like those used in PCRE, Perl, and Python. It is a C++ library. (March 2018) . Retrieved March 26, 2018 from https:\/\/github.com\/google\/re2 Google Inc. 2018. RE2 is a fast, safe, thread-friendly alternative to backtracking regular expression engines like those used in PCRE, Perl, and Python. It is a C++ library. (March 2018). Retrieved March 26, 2018 from https:\/\/github.com\/google\/re2"},{"volume-title":"Runtime Parameterizable Regular Expression Operators for Databases. In 2016 IEEE 24th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM). 204--211","author":"Istv\u00e1n Z.","key":"e_1_3_2_1_7_1","unstructured":"Z. Istv\u00e1n , D. Sidler , and G. Alonso . 2016 . Runtime Parameterizable Regular Expression Operators for Databases. In 2016 IEEE 24th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM). 204--211 . Z. Istv\u00e1n, D. Sidler, and G. Alonso. 2016. Runtime Parameterizable Regular Expression Operators for Databases. In 2016 IEEE 24th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM). 204--211."},{"key":"e_1_3_2_1_8_1","volume-title":"Retrieved","author":"Li Heng","year":"2010","unstructured":"Heng Li . 2010 . Benchmark of Regex Libraries. (March 2010) . Retrieved March 26, 2018 from http:\/\/lh3lh3.users.sourceforge.net\/reb.shtml Heng Li. 2010. Benchmark of Regex Libraries. (March 2010). Retrieved March 26, 2018 from http:\/\/lh3lh3.users.sourceforge.net\/reb.shtml"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1058426.1058885"}],"event":{"name":"SIGMOD\/PODS '18: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Houston Texas","acronym":"SIGMOD\/PODS '18"},"container-title":["Proceedings of the 14th International Workshop on Data Management on New Hardware"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3211922.3211926","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3211922.3211926","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:54:17Z","timestamp":1750287257000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3211922.3211926"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,11]]},"references-count":9,"alternative-id":["10.1145\/3211922.3211926","10.1145\/3211922"],"URL":"https:\/\/doi.org\/10.1145\/3211922.3211926","relation":{},"subject":[],"published":{"date-parts":[[2018,6,11]]},"assertion":[{"value":"2018-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}