Novel Pattern Matching Algorithm for Single Pattern Matching
Journal Title: International Journal on Computer Science and Engineering - Year 2010, Vol 2, Issue 8
Abstract
Pattern matching is one of the important issues in the areas of network security and many others. The increase in network speed and traffic may cause the existing algorithms to become a performance bottleneck. Therefore, it is very necessary to evelop more efficient pattern matching algorithm, in order to overcome troubles on performance. There are several lgorithms in use, in which, some are with different ethodology and other are with the improved methodology for the existing algorithms. In this paper, we are proposing a novel pattern matching algorithm, called, DP algorithm (Devaki – Paul algorithm). The algorithm works basing on some novel set of innovated rules, which will endorse the algorithm resulting in better performance and efficiency. In case of unsuccessful search, the DP algorithm has zero character comparisons, irrespective of the sizes of the text and pattern, provided if either the first or the last character was not present in the given input text. Whereas, the Booyer-Moore and Quick Search algorithms will do search as usual. The algorithm also doesn’t require any pre-processing phase, if the search is on the same given input text and with different patterns, provided the first and the last characters are same as in the case of first pattern. The algorithm was tested and validated and the results have proved that the performance of DP algorithm is better than BM algorithm (Boyer – Moore algorithm) and Quick Search lgorithm. In case of tests with repeated character, its erformance is greater than 1%~50% with BM and Quick earch algorithms. In case of tests with the English Text and Random Pattern, it’s greater than 33%~91% with BM and 37%~85% with Quick Search algorithms. In case of tests with the English Text and Random Pattern of an unsuccessful search, its performance is greater than BM and Quick Search algorithms with 100%, if either the first and/or the last character of the pattern in the given text were not present.
Authors and Affiliations
Devaki Pendlimarri , Paul Bharath Bhushan Petlu
Keywords
Related Articles
- EP ID EP97290
- DOI -
- Views 118
- Downloads 0
Ultrasonic Sensor Based 3D Mapping & Localization
This article provides a basic level introduction to 3D mapping using sonar sensors and localization. It describes the methods used to construct a low-cost autonomous robot along with the hardware and software used as wel...
SECURING WMN USING HONEYPOT TECHNIQUE
WMN has been a field of active research in the recent years. Lot of research has focused various routing mechanism but very little effort has been made towards attack detection or intrusion detection. In this paper, we p...
Web-enabled Decision Support System on Most Probable Producing Ability and a Searchable Database on Herd Strength for Livestock Farm Management
An estimate of the producing ability of cattle, known as Most Probable Producing Ability (MPPA) is an important measure, which provides an estimate of future productivity of a dairy animal as the basis of the past produc...
Dependency Through Axiomatic Approach On Rough Set Theory
The idea of rough set consist the approximation of a set by pair of sets called the lower and the upper approximation of the set. In fact, these approximations are interior and closer operations in a certain topology gen...
Integrations of Remote Sensing and GIS to Land Use and Land Cover Change Detection of Coimbatore District
Changes in Land use and land Cover is a dynamic process taking place on the surface, and the spatial distribution of the changes that have taken place over a period of time and space is of immense importance in many a na...