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 103
- Downloads 0
Improving Signal to Noise Ratio of Low-Dose CT Image Using Wavelet Transform
Now-a-days, diagnosis of human diseases has become comparatively easier with the help of modern technology. Use of new technology provides more information about the patient condition and also patient’s health can be mon...
Output Regulation of the Arneodo Chaotic System
This paper solves the problem of regulating the output of the Arneodo chaotic system (1981), which is one of the paradigms of chaotic dynamical systems. Explicitly, using the state feedback control laws, the output of th...
Visual Data Mining in Indian Election System
A good leaders or Government is the basic need to develop country. In India, who is largest democratic country in the world people are not fully involved in the selection process of Leaders. On an average there are 60-65...
A Survey On Various Defense Mechanisms Against Application Layer Distributed Denial Of Service Attack
The severity of application layer Distributed Denial of Service attack has become a major threat to network operators nowadays. Application layer Distributed Denial of Service attack causes unavailability of resources, r...
A Mixed-Mode Signal Processing Architecture for Radix-2 DHT
This paper proposes a mixed-mode signal processing architecture for radix-2 DHT. In the known algorithms, the stage structures perform all the additions and multiplications. The proposed algorithm introduces multiplying...