2014
DOI: 10.1016/j.future.2013.09.008
|View full text |Cite
|
Sign up to set email alerts
|

Efficient parallel automata construction for hybrid resource-impelled data-matching

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2014
2014
2017
2017

Publication Types

Select...
5
1

Relationship

2
4

Authors

Journals

citations
Cited by 12 publications
(2 citation statements)
references
References 25 publications
0
2
0
Order By: Relevance
“…Each node will then just require a bitmap to indicate if a symbol is accepted or not, a failure offset indicating the node to jump to in case of a mismatch, and an offset to the first child in the stack, for situations when a symbol is accepted (the offset of the proper child to go to is computed by applying a population count in the bitmap). The approach has been successfully used in our earlier work [12] to significantly improve the construction stages of these automata, and still is at this time the most efficient storage format for heterogeneous automata processing.…”
Section: Storage Efficiencymentioning
confidence: 99%
“…Each node will then just require a bitmap to indicate if a symbol is accepted or not, a failure offset indicating the node to jump to in case of a mismatch, and an offset to the first child in the stack, for situations when a symbol is accepted (the offset of the proper child to go to is computed by applying a population count in the bitmap). The approach has been successfully used in our earlier work [12] to significantly improve the construction stages of these automata, and still is at this time the most efficient storage format for heterogeneous automata processing.…”
Section: Storage Efficiencymentioning
confidence: 99%
“…This type of instance is used for data mining [17], data-matching [29], intrusion detection [14,36] and learning [10].…”
mentioning
confidence: 99%