Research on pattern matching performance scheme has been conducted in the Information Science Faculty of
In the Information Security Technology and Language Processing section, the pattern matching sector is highly cost-effective, and many research efforts have been made to improve their performance.
The paper shows how to convert the pattern DB into the q-gram index structure with the 'next byte range' and how to filter the data item (e.g. packet) using this structure. We indexed the patterns of the given DB as 6byte-part to raise the speed of matching and the utilization of memory. In this paper, we aimed to largely decrease the full-pattern matching system's load(the number of the input data item) and improve the performance of pattern matching by using 'SigArrg', 'next byte range' and 'Bloom Filter'. We made an algorithm so that you can apply it easily to the fields connected with pattern matching, and the experiment result shows that our proposed method speeds up pattern matching.
The results were published in the "International Conference on Electronic Information Engineering and Computer Science"(20 April 2023) under the title of "A study of a pattern matching performance scheme using q-gram index with next byte range"(https://doi.org/10.1117/12.2668080).
