Invention Grant
US09305116B2 Dual DFA decomposition for large scale regular expression matching
有权
用于大规模正则表达式匹配的双DFA分解
- Patent Title: Dual DFA decomposition for large scale regular expression matching
- Patent Title (中): 用于大规模正则表达式匹配的双DFA分解
-
Application No.: US12763510Application Date: 2010-04-20
-
Publication No.: US09305116B2Publication Date: 2016-04-05
- Inventor: Virat Agarwal , Davide Pasetto , Fabrizio Petrini
- Applicant: Virat Agarwal , Davide Pasetto , Fabrizio Petrini
- Applicant Address: US NY Armonk
- Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
- Current Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
- Current Assignee Address: US NY Armonk
- Agency: F. Chau & Associates, LLC
- Main IPC: G06F7/00
- IPC: G06F7/00 ; G06F17/30 ; G06F17/27

Abstract:
An apparatus includes a data processing system for matching a first input string with a first regular expression set. The data processing system includes a processor, a memory storing a computer program, a processor configured to execute the computer program. The computer program includes instructions for performing mapping at least two related symbols of the first regular expression set to a unique symbol, generating a second input string by replacing each instance of the at least two related symbols in the first input string with the unique symbol, and operating a first state machine on the input string and a second state machine on the second input string to determine whether the first input string matches with the first regular expression set.
Public/Granted literature
- US20110258210A1 DUAL DFA DECOMPOSITION FOR LARGE SCALE REGULAR EXPRESSION MATCHING Public/Granted day:2011-10-20
Information query