Network conversation packet indexing method based on projection of retrieval information

Abstract

The invention provides a network conversation packet indexing method based on projection of retrieval information. With the method, certain or several pieces of information of the designated network conversation packet is subjected to compression calculation to obtain the retrieval information corresponding to each piece of information. Projection module of the retrieval information can project relevant information of the network conversation packet to the corresponding bit of the index space that stores the retrieval information of such information, and the projected storage bit is marked as being projected during the first projection; the corresponding network conversation packet can be found according to the projection relationship in reading. The method can greatly improve the system performance.

Description

technical field [0001] The invention belongs to the field of data indexing, in particular to a method for indexing network session packets based on retrieval information projection. Background technique [0002] The current index is basically based on the quadruple as the KEY to build the index. Under the massive data traffic, the processing performance and capacity of the HASH table cannot be satisfied. At present, the mainstream HASH processing limit is about 10 million, and the memory size occupied by the index block is not fixed, and it increases with the increase of the data volume. It is impossible to pre-allocate fixed memory, and it needs to endure frequent and invalid memory application release. Contents of the invention [0003] In order to solve the above problems, the present invention provides a method for indexing network session packets based on retrieval information projection, comprising the following steps: [0004] Step 1: Pre-designate at least one ind...

AI Technical Summary

Problems solved by technology

[0002] The current index is basically based on the quadruple as the KEY to build the index. Under the massive data traffic, the processing performance and capacity of the HASH table cannot meet the requirements.

At present, the mainstream HASH processing limit is about 10 million, and the memory size occupied by the index block is not fixed. It increases with the increase of the data volume. It is impossible to pre-allocate fixed memory, and it needs to bear frequent and invalid memory application releases.

Images