By Topic

A Performance Evaluation of the Preprocessing Phase of Multiple Keyword Matching Algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Charalampos S. Kouzinopoulos ; Dept. of Appl. Inf., Univ. of Macedonia, Thessaloniki, Greece ; Konstantinos G. Margaritis

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.

Published in:

Informatics (PCI), 2011 15th Panhellenic Conference on

Date of Conference:

Sept. 30 2011-Oct. 2 2011