Cart (Loading....) | Create Account
Close category search window
 

A Lightweight Multiple String Matching Algorithm

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
$31 $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)
Liuling Dai ; Beijing Lab. of Intell. Inf. Technol., Beijing Inst. of Technol., Beijing ; Yuning Xia

String matching is a fundamental issue in computer science. This paper presents a lightweight string matching algorithm for short pattern matching, in which less than 20 keywords are often involved in the pattern set. The new algorithm makes use of condensed hash tables and computes the shift distance after each test by observing the character that immediately passes the test window. Experiments show that the new algorithm improves execution speed and decreases memory requirement. This algorithm is suitable for applications with small pattern set (i.e. containing up to 30 keywords), particularly for embedded equipments.

Published in:

Computer Science and Information Technology, 2008. ICCSIT '08. International Conference on

Date of Conference:

Aug. 29 2008-Sept. 2 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.