A regular expression grouping algorithm based on partitioning method

Owing to the strong character expressive power, regular expressions gradually replace explicit string and become the first choice of patterns describing method. In the current network security products, huge amount of patterns lead to dramatic increase of the DFA storage space and affect the efficiency of matching. This paper presents a regular expression grouping algorithm based on partitioning method. It reduces the total number of DFA states and improves the matching performance which is also suitable for multi-core processor.