An indexing system for network session packets

Abstract

The invention provides an indexing system of a network session package, which includes at least one index space for storing certain information retrieval information of the network session package, an information compression module, a retrieval information projection module, and a reading module. There are several storage bits in the index space, one storage bit corresponds to a kind of retrieval information, and each storage bit has the same initial value; the information compression module is used to compress certain or several types of information of the specified network session packet The retrieval information corresponding to each information is obtained through calculation; the retrieval information projection module is used to project and map the relevant information of the network session packet to the corresponding storage bit of the index space storing the retrieval information of this type of information, and the projected storage location is in the first When being projected, it is marked as having been projected; the reading module is used to find the corresponding network session packet. The present invention can greatly improve system performance.

Description

technical field [0001] The invention belongs to the field of data indexing, in particular to an indexing system for network session packets. 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 invention provides an indexing system of a network session packet, and the system includes the following modules: [0004] At least one index space used to store retrieval information of certain information in the network session packag...

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