Method for establishing and applying aggregation type IP index
An application method and aggregated technology, applied in the field of data processing, can solve problems such as system space occupation and process complexity, achieve high performance, reduce memory and storage space, and reduce memory consumption
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0040] This embodiment provides a method for establishing and applying an aggregated IP index, including the following steps:
[0041] Step S1, index design: convert all 4 bytes in the IP domain into integers corresponding to the host byte order, and create a blank bitmap index; design the IP bitmap in the host byte order, and retrieve it To improve the hit rate, the IP bit marks of the same network will be similar. When reading and matching similar IPs, the optimization effect will be achieved. Since most networks plan IPs in the form of network segments, similar IPs will appear in the network.
[0042] Step S2, index marking: receiving data blocks, extracting the IP data of all data blocks arriving in a space-time and converting them into integers, putting them into a blank bitmap index and marking the corresponding positions to form a local time-space processing index; using bitmaps Index mode, which can record all IP conditions without data distortion at all, and the bitma...
Embodiment 2
[0046] The present invention provides a method for establishing and applying an aggregated IP index, which is based on the following index design strategy:
[0047] Step 1. Convert all 4 bytes in the IP domain range (0-255.255.255.255) into integers corresponding to the host byte order, and the converted integers range from 0 to 4294967295.
[0048] Step 2: Create a mask bit for each integer, and a total of 4294967295 bits are required. These 4294967295 bits form a blank bitmap index, and a total of 512MB of memory is consumed to record the bitmap index.
[0049]Step 3. Divide the integers evenly by segment to form a slice array, and compile a slice sequence number (0-15) for each slice array; in this embodiment, divide the integers from 0 to 4294967295 by segment into 16 slices, 32MB each. The data size of each slice is 268435456, the data range of 0 slices is [0,268435456) or [0,268435455], the data range of 1 slice is [268435456, 536870911], and so on, the data range of 15...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


