Fig 1.
Complete structure of the MH hash-binary table chains.
Fig 2.
The simple hash method for exploring keywords.
Fig 3.
The algorithm for inserting data.
Fig 4.
Delete rule r3 from the hash-binary table chains.
Table 1.
Jump distance (starting position) for different PATH methods.
Fig 5.
The algorithm to search the corresponding hash table of the target data.
Fig 6.
The complete matching algorithm of the MH.
Table 2.
A group of rules requiring backtracking.
Fig 7.
MH automaton model.
Table 3.
Matching speed of each algorithm in 3 rule sets (MB/s).
Table 4.
Memory consumption of each algorithm in 3 rule sets (MB).
Fig 8.
Matching speed comparison of MH, HEM, SBOM, M-BNDM and SUMSMF.
Fig 9.
Memory consumption of MH, HEM, SBOM, M-BNDM and SUMSMF.
Fig 10.
Matching speed comparison of MH and HEM.
Fig 11.
Memory consumption comparison of MH and HEM.
Table 5.
Matching speed of each algorithm in the SMART group (MB/s).