Method and device for data matching
A data and ordinal number technology, applied in the field of data matching, can solve problems such as high cost, high power consumption, and complex configuration updates
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0030] The embodiment of the present invention implements a method for data matching, such as figure 1 As shown, the method is specifically implemented through the following steps:
[0031] Step 101: the network interconnection device generates a lookup table according to the content to be looked up;
[0032] Specifically, the network interconnection device performs hash processing on the search keyword of the content to be searched to obtain the hash index value of the search keyword of the content to be searched, and uses all the search keywords with the same hash index value as an entry, and the The entries are constructed as a tree structure, and all entries form a lookup table; wherein, each node in the entry of the tree structure includes a key value of a search keyword and indication information indicating whether it is a root node or a leaf node, and the key value is The binary or other numeric value corresponding to the search keyword, the indication information may ...
Embodiment 2
[0060] An embodiment of the present invention provides a data matching device, such as Figure 5 As shown, the device includes a control unit 1, a lookup unit 2, and a lookup table generation unit 3; wherein:
[0061] The lookup table generating unit 3 generates a lookup table according to the content to be looked up;
[0062] Specifically, the lookup table generation unit 3 performs hash processing on the search keywords of the content to be searched to obtain the hash index value of the search keyword of the content to be searched, and uses all search keywords with the same hash index value as an entry , constructing the entry into a tree structure, and all entries form a lookup table; wherein, each node in the entry of the tree structure includes a key value of a search keyword and indication information indicating whether it is an intermediate node or a leaf node, and the The key value is a binary or other numeric value corresponding to the search key, and the indication ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


