Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
A new string search hardware architecture for VLSI
ISCA '86 Proceedings of the 13th annual international symposium on Computer architecture
Algorithms
Operational characteristics of a harware-based pattern matcher
ACM Transactions on Database Systems (TODS)
A fast string searching algorithm
Communications of the ACM
Efficient string matching: an aid to bibliographic search
Communications of the ACM
ISCA '82 Proceedings of the 9th annual symposium on Computer Architecture
The schuss filter: A processor for non-numerical data processing.
ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
Research on a faster algorithm for pattern matching
IRAL '00 Proceedings of the fifth international workshop on on Information retrieval with Asian languages
The Design of Efficient Algorithms for Two-Dimensional Pattern Matching
IEEE Transactions on Knowledge and Data Engineering
3D-List: A Data Structure for Efficient Video Query Processing
IEEE Transactions on Knowledge and Data Engineering
Corrections to “An Efficient Algorithm for Matching Multiple Patterns”
IEEE Transactions on Knowledge and Data Engineering
Fast detection of communication patterns in distributed executions
CASCON '97 Proceedings of the 1997 conference of the Centre for Advanced Studies on Collaborative research
A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms
Science of Computer Programming
Ultra-high throughput string matching for deep packet inspection
Proceedings of the Conference on Design, Automation and Test in Europe
An efficient topic-specific web text filtering framework
APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
| Hi-index | 0.00 |
An efficient algorithm for performing multiple pattern match in a string is described. The match algorithm combines the concept of deterministic finite state automata (DFSA) and the Boyer-Moore algorithm to achieve better performance. Experimental results indicate that in the average case, the algorithm is able to perform pattern match operations sublinearly, i.e. it does not need to inspect every character of the string to perform pattern match operations. The analysis shows that the number of characters to be inspected decreases as the length of patterns increases, and increases slightly as the total number of patterns increases. To match an eight-character pattern in an English string using the algorithm, only about 17% of all characters of the strong and 33% of all characters of the string, when the number of patterns is seven, are inspected. In an actual testing, the algorithm running on SUN 3/160 takes only 3.7 s to search seven eight-character patterns in a 1.4-Mbyte English text file.