Method and system for space-efficient multi-pattern matching

Abstract

The invention relates to a method and a system for space-efficient multi-pattern matching. Firstly, a novel data structure HashTrie for storing pattern string is proposed, in which an original pattern string matrix is stored in the form of one-dimensional table by using a bit vector table, thus avoiding the problem of state transition matrix of conventional method memory automations; resolving the special bit vector table by using the method of recursive Hash function so as to save memory space; in the process of calculating the Hash function, converting the Hash function into a simple and efficient bit operation by using bit operation; the adoption the Rank technology in HashTrie construction and key word searching increases space and time efficiency of search. The method and system herein markedly reduce memory overhead and pretreatment time, can meet the need of timelessness as required by a real-time intrusion detection system as for when rules come into effect, and is more suitable for handling multi-pattern real-time matching which features in comparatively large scale of pattern string collection and comparatively short length of pattern string.

Description

technical field [0001] The invention relates to the fields of information filtering, information retrieval, computational biology and the like, in particular to a space-efficient multi-pattern string matching method and system. Background technique [0002] In recent years, with the development of broadband technology and the popularity of multimedia applications, Internet technology has been greatly popularized and developed. With the rapid growth of network users, the attack patterns are also rapidly increasing, and the demand for intrusion detection systems is also increasing. In the face of the increasingly serious network security problems such as the current Internet protocol design flaws, computer system vulnerabilities, and network intrusion attacks, the storage space and computing speed of existing algorithms have been difficult to meet the application requirements for real-time matching of feature strings in high-speed network environments. Therefore, it is of gre...

AI Technical Summary

Problems solved by technology

Although the above method is relatively efficient in one aspect (time or space), according to the current increasing information security requirements, better space-time efficient multi-pattern string matching technology still needs further research

Images