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 112
- Downloads 0
A Probabilistic Approach of Coverage prediction in Mobile Ad hoc Networks
A fundamental issue arising in mobile ad-hoc networks (MANETs) is the selection of the optimal path between any two nodes. It’s very difficult to select of optimal path due to different factors affects the stability of t...
An Algorithm for Better Decision Tree
The present paper aims at constructing the decision tree for a given database which adopts an improved ID3 decision tree algorithm to implement data mining in order to predict the output. The database is generated using...
Bitwise Operations Based Encryption and Decryption
In this paper, variable block length based character/bit level ransformation has been proposed for encryption and cryption, where a block of characters /few bits has taken into account. he originated text is transfor...
Web Page Segmentation for Small Screen Devices Using Tag Path Clustering Approach
The web pages breathing these days are developed to be displayed on a Desktop PCs and so viewing them on mobile web browsers is extremely tough. Since mobile devices have restricted resources, small screen device users n...
Data Mining Application to Attract Students in HEI
In the last two decades, number of Higher Education Institutions (HEI) grows in leaps and bounds. This causes a cut throat competition among these institutions while attracting the student get admission in these institut...