The Community for Technology Leaders
2012 16th Panhellenic Conference on Informatics (2011)
Kastoria, Greece
Sept. 30, 2011 to Oct. 2, 2011
ISBN: 978-0-7695-4389-5
pp: 85-89
Multiple keyword matching is an important problem in text processing that involves the location of all the positions of an input string where one or more keywords from a finite set occur. Modern multiple keyword matching algorithms can scan the input string in a single pass by preprocessing the keyword set, an essential phase that affects the overall performance of each algorithm. This paper presents a performance evaluation in terms of preprocessing of the well known Commentz-Walter, Wu-Manber, Set Backward Oracle Matching and Salmela-Tarhio-Kyt\"{o}joki multiple keyword matching algorithms for different types of keywords and for several problem parameters.
Algorithms, Performance Evaluation, Preprocessing, Multiple Keyword Matching, Multiple Pattern Matching
Konstantinos G. Margaritis, Charalampos S. Kouzinopoulos, "A Performance Evaluation of the Preprocessing Phase of Multiple Keyword Matching Algorithms", 2012 16th Panhellenic Conference on Informatics, vol. 00, no. , pp. 85-89, 2011, doi:10.1109/PCI.2011.41
166 ms
(Ver 3.3 (11022016))