CN105975515A - Node compression method and multimodal matching method - Google Patents
Node compression method and multimodal matching method Download PDFInfo
- Publication number
- CN105975515A CN105975515A CN201610277456.1A CN201610277456A CN105975515A CN 105975515 A CN105975515 A CN 105975515A CN 201610277456 A CN201610277456 A CN 201610277456A CN 105975515 A CN105975515 A CN 105975515A
- Authority
- CN
- China
- Prior art keywords
- node
- character
- compressed
- nodal point
- failure
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 59
- 238000007906 compression Methods 0.000 title claims abstract description 32
- 230000006835 compression Effects 0.000 title claims abstract description 31
- 238000012546 transfer Methods 0.000 claims description 31
- 238000002372 labelling Methods 0.000 claims description 21
- 230000008878 coupling Effects 0.000 claims description 20
- 238000010168 coupling process Methods 0.000 claims description 20
- 238000005859 coupling reaction Methods 0.000 claims description 20
- 239000000203 mixture Substances 0.000 claims description 5
- 230000008569 process Effects 0.000 description 14
- 230000006870 function Effects 0.000 description 5
- 230000013011 mating Effects 0.000 description 5
- 238000010586 diagram Methods 0.000 description 4
- 230000006978 adaptation Effects 0.000 description 2
- 230000007423 decrease Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000005055 memory storage Effects 0.000 description 2
- 238000012163 sequencing technique Methods 0.000 description 2
- 241000700605 Viruses Species 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000001914 filtration Methods 0.000 description 1
- 230000005012 migration Effects 0.000 description 1
- 238000013508 migration Methods 0.000 description 1
- 238000007781 pre-processing Methods 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/903—Querying
- G06F16/90335—Query processing
- G06F16/90344—Query processing by using string matching techniques
Abstract
An embodiment of the invention discloses a node compression method, which is used for saving storage space. The method disclosed by the embodiment of the invention comprises the steps of searching for a first node and a second node which are located on a same branch and sequentially numbered from a root node; compressing each node from the first node to the second node to obtain a compressed node, wherein the first node only has a branch and is a node closest to the root node, the second node is a leaf node or has two or more branches, and a character string parameter of the compressed node sequentially consists of character parameters of each node from the first node to the second node; and marking the compressed node. Therefore, the storage space is effectively saved.
Description
Technical field
The present invention relates to communication technical field, particularly relate to a kind of Node compression method and multimode matching side
Method.
Background technology
In virus scan, protocol identification, information filtering, in the application such as intrusion detection, mode-matching technique
It it is all a basic support technology.Mode-matching technique, by quick scan data report, on big rule
The rule base of mould finds the matched rule of correspondence, carries out process for application program thereafter and provide foundation.
The quality of pattern matching algorithm directly influences the height of the performance of these application.
The purpose of mode-matching technique be find in target text to pattern occur position.According to treating
The difference of search pattern quantity, is divided into single pattern matching and multi-mode matching.Multi-mode matching technical research
The position that all patterns in library occur is found in target text.Here pattern is all with character
The form of string describes.
AC automat matching algorithm is the classic algorithm of multimode matching, and it is real by one AC scheme-tree of structure
Now quick multimode matching.Its processing procedure is divided into two steps: preprocessing process and search procedure.
The purpose of pretreatment is based on one AC scheme-tree of all schema constructions in library.Its process is such as
Under:
The root node that every pattern is set in mode is starting point, and the pattern in library is inserted into pattern one by one
In tree.
From the beginning of root node, if there is the limit identical with pattern character, enter corresponding node.
If having gone to leaf node, new node and limit will be increased, and carrying out with pattern character opposite side
Labelling.
When increasing the node of last character of pattern, it is labeled as matched node；
Then it is that each node increases failed function fail () and adaptation function output ().
The feature of this scheme-tree is:
There is a character marking on each the limit of this tree；
The tab character on each bar limit under same node is all different；
For each pattern p in library P, all there is a node v so that L (v)=p, wherein L (v)
Represent the splicing of character marking from root node to limits all the path of node v；
Corresponding pattern p belonged in library P of each leaf node v so that L (v)=p.
The failed function of each node v points to a failure node v ', v '=fail (v) so that L (v ')
The longest suffix character string for L (v).
The adaptation function of each node v exports one group of match pattern, and output (v)=P ', wherein P ' is inner
Each pattern is the suffix character string of L (v).
Such as library P={he, she, his, hers}, then the scheme-tree of its correspondence is as shown in Figure 1:
101 to 110 is node；
Solid arrow represents that state shifts；
Dotted arrow represents the failed function of this node, is referred to as unsuccessfully shifting；
The node table with dashed lines labeled is shown with pattern match.
The internal data structure of the node in this AC scheme-tree includes: present node (Cs), inputs character
(Char), next node (Ns), failure node (Fs), hit labelling (Hit).The implication of its each field
As follows:
Present node: represent the father node of this node；
Input character: represent the character needing coupling from father node to this node；
Next node: represent the numbering of this node；If current state is Cs, and input character and Char
After coupling, current state transfers to this node Ns；
Failure node: when current state is Ns, if input character does not find the next node of coupling,
The most unsuccessfully shifting, current state transfers to this failure node Fs；
Hit labelling: represent that this node memory is in pattern match.
The process made a look up based on AC scheme-tree is as follows:
With root node as starting point, carry out state transfer along the limit with the character in text as labelling；
If current state is Cs, the Char of input character match corresponding node, then current state is transferred to
Ns；
If do not find the next node of input character match at present node, the most unsuccessfully shift,
Current state transfers to Fs；
Condition according to above-mentioned steps constantly carries out state transfer, until all characters in text have been searched；
Each node of process in state migration procedure, if its field Hit is labeled as existing hit, then
The node number (representing the MODE NUMBER of hit) of output correspondence and corresponding text position.
Such as, there is library P={he, she, his, hers}, target text text=to be searched
" ushers ", then the result obtained after carrying out multimode matching is exactly: she is hit in position 2, and he is hit in position 3,
Hers is hit in position 3.
The memory space that AC automat matching algorithm needs mainly is determined by the interstitial content of its scheme-tree, its
The memory space taken is directly proportional to the character number in library, if the character number in library is a lot
Time, the memory space that AC scheme-tree takies is the biggest.If using the AC pattern that on-chip memory storage is original
Tree, the library of support will be the least, if using external memory storage to carry out memory module tree, will be greatly increased
The time delay of state transfer.
On the other hand, AC automat matching algorithm often processes a character and is required for carrying out state transfer, and
The delay being carried out state transfer by search pattern tree is relatively large.Therefore in frequent visit memorizer
AC scheme-tree, will be substantially reduced the speed of multimode matching search.
In sum, AC automat matching algorithm causes searching the very difficult raising of speed.
Summary of the invention
Embodiments provide a kind of multi-mode matching method, Apparatus and system, can effectively save
Memory space, reduces the frequency of state transfer, and a next state transfer can process multiple character, improve
The speed that multimode is searched.
A kind of Node compression method that the embodiment of the present invention provides, including:
Search and be positioned at same branch and from the primary nodal point of root node serial number and secondary nodal point；
It is compressed from each node of primary nodal point to secondary nodal point, obtains compressed node；
Described primary nodal point only one of which branch and be from the nearest node of root node；
Described secondary nodal point is leaf node or has two with top set；
The string argument of described compressed node is joined by from the character of each node of primary nodal point to secondary nodal point
Number order composition；
Compressed node described in labelling.
As can be seen from the above technical solutions, the embodiment of the present invention has the advantage that
Owing to the multiple Node compression meeting condition are become a special compressed node, decrease node
Quantity, thus effectively saved memory space, on the other hand, the minimizing of nodes reduces state and turns
The frequency moved, a next state transfer can process multiple character, improve the speed that multimode is searched.
Accompanying drawing explanation
Fig. 1 is the pattern tree graph of art methods AC automat algorithm；
Fig. 2 is one embodiment schematic diagram of multi-mode matching method of the embodiment of the present invention；
Fig. 3 is another embodiment schematic diagram of multi-mode matching method of the embodiment of the present invention；
Fig. 4 is another embodiment schematic diagram of multi-mode matching method of the embodiment of the present invention；
Fig. 5 is another embodiment schematic diagram of multi-mode matching method of the embodiment of the present invention；
Fig. 6 is the Node compression process schematic of the embodiment of the present invention；
Fig. 7 is the multimode matching process schematic of the embodiment of the present invention.
Detailed description of the invention
Embodiments provide a kind of multi-mode matching method, be used for saving memory space and improving multimode
The speed searched.
Referring to Fig. 2, one object lesson of the multi-mode matching method in the embodiment of the present invention includes:
201, compression primary nodal point, intermediate node and secondary nodal point；
Wherein, primary nodal point, intermediate node and secondary nodal point are positioned at same branch and number in order, the
One node does not has branch and is branch node, and intermediate node is continuous nodes, and secondary nodal point is leaf node
Or have two with top set.
202, the node after labelling compression；
Wherein, being marked compressed node, the internal data structure for this compressed node can ensure that
What this scheme-tree energy when searching was same carries out state transfer.
The nodal information of the compressed node in the present embodiment specifically may include that
" type " Typ (i.e. type parameter), " present node " Cs (i.e. current node parameters), " character
String " Str (i.e. string argument), " length " Len (i.e. length parameter), " next node " Ns is (i.e.
Next node parameter), " failure node " Fs (i.e. failure node parameter), " hit location " Hitpos is (i.e.
Hit location parameter), " hit labelling " Hit (i.e. hitting flag parameters), the implication of each field is as follows:
" type " Typ: represent primary nodal point, secondary nodal point, and " failure node " of intermediate node
Between relation, such as should " type " can be " failure node is identical " or " failure node is continuous ",
If it should be noted that between " failure node " of primary nodal point, secondary nodal point, and intermediate node
The a certain relation of employing, such as when Node compression, " failure node " of the node before compression are given tacit consent to
Necessary identical ability is compressible, then can also be without this field；
" present node " Cs: represent the father node of this compressed node；
" character string " Str: represent to this compressed node is mated completely, the character string of required coupling,
This character string by being compressed into the primary nodal point of this compressed node, intermediate node, and secondary nodal point "
Join character " according to the sequencing composition of node during traversal；
" length " Len: representing the length of character string Str, this field is Optional Field, if in reality
Application itself can be embodied the information of length by " character string ", without " long exclusively with this
Degree " field；
" next node " Ns: represent this compressed node self；
" failure node " Fs: represent next required coupling after it fails to match to this compressed node
Node；
" hit labelling " Hit: represent in the node forming this compressed node whether comprise hit node,
I.e. " hit labelling " two kinds of numerical value should be specifically as follows, be respectively used to represent that forming this compression saved
The node of point comprises hit node, and forms the node of this compressed node does not comprise hit node；
" hit location " Hitpos: represent that the hit node forming this compressed node is in this compressed node
Position.
In the present embodiment, owing to primary nodal point, intermediate node and secondary nodal point are compressed, reduce
Number of nodes, thus saved memory space.
In order to make it easy to understand, the multi-mode matching method in the embodiment of the present invention is entered with an instantiation below
Line description, refers to Fig. 3, and another embodiment of the inventive method includes:
Use path compression method compression primary nodal point 3011, intermediate node 3012 and secondary nodal point
3013 is compressed node 3018；
Wherein, primary nodal point 3011, intermediate node 3012 and secondary nodal point 3013 be positioned at same branch and
Numbering in order, primary nodal point 3011 does not has branch and the branch node for node 3014, intermediate node
3012 is continuous nodes, secondary nodal point 3013 have two with top set, 3015,3016,3017 are
Node, 3018 is the node after the Node compression in dotted line frame.
The number of intermediate node can be one or more, is not construed as limiting herein；Secondary nodal point can also be
Leaf node, is not construed as limiting herein.
Node after labelling compression；
Wherein, with the numbering of secondary nodal point, compressed node is marked, for the inside of this compressed node
Data structure can ensure that what this scheme-tree can be same when searching carries out state transfer.
Compressed node is marked by the numbering that can also use primary nodal point, is not construed as limiting herein.
In the present embodiment, use path compression method by primary nodal point, intermediate node and secondary nodal point
One node of boil down to, decreases number of nodes, thus has saved memory space.
From compressed node side, multi-mode matching method of the present invention is described above, below from matched node
Multi-mode matching method of the present invention is described by side, refers to Fig. 4, and another of the embodiment of the present invention is concrete
Example includes:
401, when state transfers to compressed node, if mating the character string of this compressed node, then entering should
Compressed node.
402, when state transfers to compressed node, if mating several leading character, then part of this character string
Enter this compressed node.
403, when coupling can not proceed, the failure node that this compressed node is corresponding is transferred to；
Wherein, failure node is determined by the type of compressed node and the field of failure node, does not limits
Fixed.
In the present embodiment, the character string of compressed node or several leading character of character string are mated, fall
The frequency of low state transfer, a next state transfer can process multiple character, improve what multimode was searched
Speed.
In order to make it easy to understand, the multi-mode matching method in the embodiment of the present invention is entered with an instantiation below
Line description, refers to Fig. 5, and another embodiment of the inventive method includes:
501, with root node as starting point, state is carried out along the branch with the character in target text as labelling
Transfer.
502, ordinary node is transferred to when state, it is judged that whether input character mates should ordinary node
Character, the most then enter step 503, if it is not, then enter step 504.
503, transfer current state is to next node.
504, unsuccessfully shifting, transfer current state is to failure node.
505, when state transfers to compressed node, if mating the character string of this compressed node, then entering should
Compressed node.
506, when state transfers to compressed node, if mating several leading character, then part of this character string
Enter this compressed node.
507, when coupling can not proceed, the failure node that this compressed node is corresponding is transferred to；
Wherein, failure node is determined by the type of compressed node and the field of failure node, does not limits
Fixed.
If 508 hit mark value are labeled as hit, then label and this compression of exporting this compressed node save
The position that point is corresponding.
509, according to the MODE NUMBER of the label output matching of this compressed node.
510, when all characters in target text have been searched, coupling is terminated.
In the present embodiment, the character string of compressed node or several leading character of character string are mated, and
Outputing the MODE NUMBER of coupling, reduce the frequency of state transfer, a next state transfer can process many
Individual character, improves the speed that multimode is searched.
With another example, the process of above-mentioned Node compression is described below, refers to Fig. 6:
Assume to exist library P={he, she, his, hers}, the AC mould built according to this library
Formula tree as shown in Figure 6, comprises 10 nodes in this AC scheme-tree, wherein root node is S0, each band arrow
Character on the solid line of head, is " the coupling character " of the node of this arrow indication, pointed by each dotted arrow
Node represent " failure node " of each node, node S2, S4, S6 and S9 are for hit node (i.e.
" the hit labelling " of node S2, S4, S6 and S9 represents to exist and mates), the pattern of S2 coupling is " he ",
The pattern of S4 coupling is " hers ", and the pattern of S6 coupling is " his ", and the pattern of S9 coupling is " she ".
After this AC scheme-tree is carried out depth-first traversal, can know, meet " with upper the
One node and intermediate node only one of which child node " node section be " S2, S3, S4 " (primary nodal point
For S2, intermediate node is S3, and secondary nodal point is S4), " S5, S6 " (primary nodal point is S5, second section
Point is for S6) and " S7, S8, S9 " (primary nodal point is S7, and intermediate node is S8, and secondary nodal point is
S9), " only one of which hit node in primary nodal point, secondary nodal point and intermediate node " is further conformed to
Node section be " S2, S3 " (primary nodal point is S2, and secondary nodal point is S3), " S3, S4 " (first segment
Point is for S3, and secondary nodal point is S4), " S5, S6 " (primary nodal point is S5, and secondary nodal point is S6) and
" S7, S8, S9 " (primary nodal point is S7, and intermediate node is S8, and secondary nodal point is S9), further
Meet the node section of " failure node corresponding to primary nodal point, secondary nodal point and intermediate node is identical "
For " S2, S3 " (primary nodal point is S2, and secondary nodal point is S3).
Wherein, the nodal information of node S2 be " present node: S1, mate character: e, next node:
S2, failure node: S0, hit labelling: 1 ", hit is labeled as 1 expression this node S2 for hit node.
The nodal information of node S3 be " present node: S2, mate character: r, next node: S3,
Failure node: S0, hit labelling: 0 ", it is not hit node that hit is labeled as 0 expression this node S3.
After Node compression, obtain compressed node S20 as shown in Figure 7, this compressed node S20's
Nodal information be " type: failure node is identical, present node: S1, character string: er, length: 2,
Next node: S20, failure node: S0, hit location: 1, hit labelling: 1 ".
Hit is labeled as 1 expression and forms each node of this compressed node S20 and include a hit node,
Hit location be this hit node of 1 expression be composition compressed node S20 first node, i.e. origin node
S2。
It should be noted that in the present embodiment, with simultaneously need to meet " with go up primary nodal point and
Intermediate node only one of which child node ", " only one of which in primary nodal point, secondary nodal point and intermediate node
Hit node " and " failure node corresponding to primary nodal point, secondary nodal point and intermediate node is identical "
As a example by illustrate, these three condition, concrete compression side can be met in actual applications simultaneously
Formula is similar to, and here is omitted.
With an instantiation, the process of above-mentioned multimode matching is described below, refers to Fig. 7:
AC scheme-tree exists node S0, S1, S4, S5, S6, S7, S8, S9 and compressed node
S20, the nodal information of this compressed node S20 be " type: failure node is identical, present node: S1,
Character string: er, length: 2, next node: S20, failure node: S0, hit location: 1, hit
Labelling: 1 ".
Assume that mating target is text text=" shers ", then start coupling, currently at root node S0
Target character is s, then matched node S7, updates current goal character, and order matched node S8 afterwards
And node S9, owing to node S9 is hit node, after the match is successful for node S9, then output
Joining result is pattern " she " and pattern " he ", in the present embodiment, matched node S7, node S8,
The process of node S9 can use prior art, is not construed as limiting herein.
It fails to match at node S9 for character r, by node S2 and node S3 boil down to compressed node S20
Before, " failure node " of node S9 is S2, and " failure node " of the posterior nodal point S9 of compression becomes
S0, therefore current goal character needs to carry out rollback from character r, i.e. in coupling target " shers ",
From character r to the direction of character s, current goal character is fallen back, so when character r is at node S9
After it fails to match, the failure node to node S9 (i.e. root node S0) is needed to mate, target character
Being updated to h, then matched node S1, after the success of matched node S1, target character is updated to e, then to compression
Node S20 mates, and target character e mates into the initial character e of the character string of compressed node S20
Merit, then continue to mate the successive character of " character string " of compressed node S20 according to sequencing,
Target character is updated to r, with compressed node S20 inside to the successive character r of character string, the match is successful, then
Compressed node S20 mates completely, if now each node of composition compressed node S20 includes hitting node,
The most exportable matching result is pattern " he ", after compressed node S20 mates completely, continues and this compression
" coupling character " s of child node S4 of node mates, and after the match is successful, output matching result is mould
Formula " hers ".
Above to a kind of Node compression method and device provided by the present invention and multi-mode matching method and
Device is described in detail, for one of ordinary skill in the art, according to the think of of the embodiment of the present invention
Think, the most all will change, in sum, in this specification
Hold and should not be construed as limitation of the present invention.
Claims (10)
1. a Node compression method, it is characterised in that including:
Search and be positioned at same branch and from the primary nodal point of root node serial number and secondary nodal point；
It is compressed from each node of primary nodal point to secondary nodal point, obtains compressed node；
Described primary nodal point only one of which branch and be from the nearest node of root node；
Described secondary nodal point is leaf node or has two with top set；
The string argument of described compressed node is joined by from the character of each node of primary nodal point to secondary nodal point
Number order composition；
Compressed node described in labelling.
Node compression method the most according to claim 1, it is characterised in that described labelling is with described
The numbering labelling of secondary nodal point.
Node compression method the most according to claim 1, it is characterised in that described compression uses road
Electrical path length compression method；
Described compressed node also includes: the type of described compressed node, present node, length, next joint
Point, failure node, hit location, hit labelling.
Node compression method the most according to claim 1, it is characterised in that described failure node table
Show run into do not mate time, carry out failure transfer to correspondence node；
The failure node that in described compressed node, each node is corresponding is identical or continuous print.
5. a multi-mode matching method, it is characterised in that including:
With root node as starting point, carry out state transfer along the branch with the character in target text as labelling；
When state transfers to compressed node, it is judged that the current character in target text and described compressed node
Character string in first character whether mate, the most then update the current word in described target text
Accord with and use the character after renewal to mate with the successive character in the character string of described compressed node, if
No, then transfer to failure node.
Multi-mode matching method the most according to claim 5, it is characterised in that described coupling laggard
One step includes step: if hit mark value is labeled as hit, then export described compressed node label and
The position that described compressed node is corresponding.
Multi-mode matching method the most according to claim 6, it is characterised in that defeated according to described label
Go out the MODE NUMBER of coupling.
Multi-mode matching method the most according to claim 5, it is characterised in that described multimode matching side
Method farther includes step:
When state transfers to ordinary node, it is judged that whether the current character in target text mates described general
The character of logical node, the most then transfer current state is to next node, turns if it is not, then carry out failure
Moving, transfer current state is to failure node.
Multi-mode matching method the most according to claim 8, it is characterised in that when described target text
In all characters when having been searched, terminate described coupling.
10. according to the multi-mode matching method described in its claim 5, it is characterised in that described compression saves
The failure node that in point, each node is corresponding is identical or continuous print.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610277456.1A CN105975515A (en) | 2016-04-28 | 2016-04-28 | Node compression method and multimodal matching method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610277456.1A CN105975515A (en) | 2016-04-28 | 2016-04-28 | Node compression method and multimodal matching method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105975515A true CN105975515A (en) | 2016-09-28 |
Family
ID=56993449
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610277456.1A Pending CN105975515A (en) | 2016-04-28 | 2016-04-28 | Node compression method and multimodal matching method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105975515A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111046002A (en) * | 2019-12-06 | 2020-04-21 | 浪潮(北京)电子信息产业有限公司 | Data compression method, decompression method, system and related device of graph data |
| CN113127861A (en) * | 2019-12-31 | 2021-07-16 | 深信服科技股份有限公司 | Rule hit detection method and device, electronic equipment and readable storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030236793A1 (en) * | 2002-06-19 | 2003-12-25 | Ericsson Inc. | Compressed prefix tree structure and method for traversing a compressed prefix tree |
| CN101296116A (en) * | 2007-04-24 | 2008-10-29 | 丛林网络公司 | Parallelized pattern matching using non-deterministic finite automata |
| CN101556619A (en) * | 2009-05-04 | 2009-10-14 | 成都市华为赛门铁克科技有限公司 | Node compression method and device thereof and multimode matching method and device thereof |
| CN102136005A (en) * | 2011-03-29 | 2011-07-27 | 北京航空航天大学 | Data searching method and device |
-
2016
- 2016-04-28 CN CN201610277456.1A patent/CN105975515A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030236793A1 (en) * | 2002-06-19 | 2003-12-25 | Ericsson Inc. | Compressed prefix tree structure and method for traversing a compressed prefix tree |
| CN101296116A (en) * | 2007-04-24 | 2008-10-29 | 丛林网络公司 | Parallelized pattern matching using non-deterministic finite automata |
| CN101556619A (en) * | 2009-05-04 | 2009-10-14 | 成都市华为赛门铁克科技有限公司 | Node compression method and device thereof and multimode matching method and device thereof |
| CN102136005A (en) * | 2011-03-29 | 2011-07-27 | 北京航空航天大学 | Data searching method and device |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111046002A (en) * | 2019-12-06 | 2020-04-21 | 浪潮(北京)电子信息产业有限公司 | Data compression method, decompression method, system and related device of graph data |
| CN111046002B (en) * | 2019-12-06 | 2022-08-02 | 浪潮(北京)电子信息产业有限公司 | Data compression method, decompression method, system and related device of graph data |
| CN113127861A (en) * | 2019-12-31 | 2021-07-16 | 深信服科技股份有限公司 | Rule hit detection method and device, electronic equipment and readable storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112199375B (en) | Cross-modal data processing method and device, storage medium and electronic device | |
| CN100576222C (en) | Detect the method and apparatus of the pattern in the data stream | |
| JPH08194719A (en) | Retrieval device and dictionary and text retrieval method | |
| Hsu et al. | Finite-state transducers for semi-structured text mining | |
| JP2007094775A (en) | Semantic analyzer, semantic analysis method and semantic analysis program | |
| CN103188267B (en) | A kind of protocol analysis method based on DFA | |
| CN106067039A (en) | Method for mode matching based on decision tree beta pruning | |
| CN103699647B (en) | Character string dictionary indexing method and system | |
| CN101425084A (en) | Mode matching method based on ordering binary tree | |
| CN108897545A (en) | Code compiling method and device | |
| CN103164388A (en) | Method and device for obtaining structuring information in layout files | |
| CN106330520A (en) | Method and device of extracting feature information of terminal equipment | |
| Cheng et al. | Clcminer: detecting cross-language clones without intermediates | |
| CN104598231A (en) | Python source code file similarity detecting method | |
| CN105975515A (en) | Node compression method and multimodal matching method | |
| CN103077216B (en) | The method of subgraph match device and subgraph match | |
| CN102508901A (en) | Content-based massive image search method and content-based massive image search system | |
| CN104125300B (en) | The synchronous method of separation between machine and card type home gateway service configuration data | |
| CN101556619B (en) | Node compression method and device thereof and multimode matching method and device thereof | |
| CN105025013B (en) | The method for building up of dynamic IP Matching Model based on priority Trie trees | |
| CN109992593A (en) | A kind of large-scale data parallel query method based on subgraph match | |
| CN106295252A (en) | Search method for gene prod | |
| CN109271560A (en) | A kind of link data critical word querying method based on tree template | |
| CN117093260A (en) | Fusion model website structure analysis method based on decision tree classification algorithm | |
| CN102760173A (en) | Bottom-up XML (eXtensible Markup Language) twig pattern matching method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| REG | Reference to a national code |
Ref country code: HK Ref legal event code: DE Ref document number: 1233342 Country of ref document: HK |
|
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20160928 |
|
| REG | Reference to a national code |
Ref country code: HK Ref legal event code: WD Ref document number: 1233342 Country of ref document: HK |