AN EFFICIENT STRING MATCHING ALGORITHM FOR DETECTING PATTERNS USING FORWARD AND BACKWARD SEARCHING APPROACH

ABSTRACT String matching algorithms are playing an important role on anomaly detection. Identifying and extracting anomaly patterns from the massive amount of online data are gaining more attention in the field of research in Big Data Analysis. Last two decades, researchers proposed many string searching algorithms for pattern matching from large volumes of data. Most of the pattern matching algorithms are based on string matching concept. In this paper, an algorithm for efficient string matching using forward and backward searching method has proposed. The string matching algorithms are based on the concept of comparing individual character by character. The individual characters from right to middle character and left to middle character are compared in a parallel way. In each iteration a preprocess array is created to simplify the comparison process. The concept of shift function is used for increasing the searching efficiency and to avoid the unnecessary comparisons of characters. The patterns and strings are considered same here. The proposed method provides an efficient result in terms of accurate pattern matching and execution time. We have compared the proposed algorithm with the related exact string matching algorithms in terms of accuracy and execution time. The proposed algorithm is suitable for searching patterns from a large volume of data.