Boyer-Moore-Horspool Research Articles

TDOPS: Time series based deduplication and optimal data placement strategy for IIoT in cloud environment

As a result of the advancements in Industry 4.0, the amount of data collected within industries are continuously expanding to achieve an innovative environment within the industry by maximizing asset usage. Meanwhile, the redundancy rate is increasing in cloud storage, which has an impact on data storage and analysis. To lower the rate of redundancy, the proposed system comprises a Time series-based deduplication technique. In the Time series-based deduplication technique, the Adaptive Multi-Pattern Boyer Moore Horspool (AM-BMH) algorithm, and Merkle tree were used to produce time-series data. Another significant challenge is that the geographically distributed cloud system has encountered that the data placement methodology with high-priced transportation costs for data transmission. To overcome this issue, an optimal data placement strategy using Modified Distribution is proposed. Thus the proposed Time Series-based Deduplication and Optimal Data Placement Strategy (TDOPS) is found to be effective when compared with the existing system. The various parameters like space reduction, efficient retrieval, data transportation costs, and data transmission time are taken into the account in the cloud environment for an evaluation. The proposed scheme saves 98 percent of storage space, 55 percent computation overhead, and improves 60% of cloud storage efficacy.

Boyer-Moore Horspool Algorithm Used in Content Management System of Data Fast Searching

After a deep view on few fast searching algorithm as Boyer-Moore algorithm, Boyer-Moore Horspool algorithm, Brute-Force Algorithm, Knuth-Morris-Pratt algorithm and Rabin-Karp algorithm, this research paper chooses Boyer-Moore Horspool algorithm to used in the content management system in term of data Fast Searching. An enormous amount of data stored in content management system as few big module as product data, slider data, personal information data, company information data, account data and another kind of data may refer to the different type of content management system and developer set. However, search specific data from all the above data type that mention, memory, and time consumed is used up. Therefore, from this paper, Boyer-Moore Horspool Algorithm is being chosen to use in content management system after comparing a few searching algorithm in research which will state in this article. The aim of this paper is to analysis few searching algorithm and choose the most suit algorithm that giving the fastest searching time consumed while searching long string data.

A Cloud-based Malware Detection Framework

<p class="Els-Abstract-text">Malwares are increasing rapidly. The nature of distribution and effects of malwares attacking several applications requires a real-time response. Therefore, a high performance detection platform is required. In this paper, Hadoop is utilized to perform static binary search and detection for malwares and viruses in portable executable files deployed mainly on the cloud. The paper presents an approach used to map the portable executable files to Hadoop compatible files. The Boyer–Moore-Horspool Search algorithm is modified to benefit from the distribution of Hadoop. The performance of the proposed model is evaluated using a standard virus database and the system is found to outperform similar platforms.</p>

An Effective Pattern Matching Algorithm for Intrusion Detection

This paper makes a summary of pattern matching algorithm in Intrusion Detection System: KMP algorithm, BM algorithm and BMH algorithm algorithm. The performances of various algorithms are analyzed, and then through the experiment data is verified. Last an improved algorithm based on the BM algorithm: BMD is proposed. BMD algorithm can reduce the space complexity and maintain the time complexity by reducing a pretreatment function and recording the number of times that a bad char found in the pattern.

Performance Improvement of BMH and BMHS using PDJ (Possible Double Jump) and MValue (Match Value)

BM (Boyer-Moore) string matching algorithm and its enhanced versions like BMH and BMHS are a standard benchmark for single pattern string matching. Based on BMH and BMHS algorithms we have developed improved algorithms EBMH(Enhanced BMH)and EBMHS(Enhanced BMHS). These algorithms uses the newly introduced PDJ (possible double jump) and MValue(Match Value) concepts. While searching these concepts helps to provide longer jump of characters. The algorithm EBMH emphasize on BMH algorithm with the inclusion of PDJ and MValue and the algorithm EBMHS emphasize on BMHS algorithm with the inclusion of PDJ and MValue. Through these algorithm the number of comparison of characters between text and pattern are reduced to a significant amount. In this paper PDJ, MValue, EBMH and EBMHS are described and analyzed. Experimental results show that in the algorithms searching time is reduced as compared to BM, BMH, and BMHS. The algorithms are analyzed on the basis of time requirement in best, worst and average case.

Multi-Pattern Boyer-Moore - Horspool Algorithm based Hashing Function for Intrusion Detection System

Every day the networks are expanding in very large scale and running in very high speed. The Intrusion Detection System (IDS) becomes as an essential part in any new network structure. The IDS is relying on the string matching algorithm to detect any signature attack, but the high speed of the modern networks are preventing the IDS string matching algorithms to work properly. There is a need to develop a robust IDS string matching algorithms to overcome these weaknesses. In this paper, we continue to developing Boyer-Moore Horspool algorithm by adding a new multi-pattern hashing feature to its original structure, which is called MPH-BMH. The developed algorithm is able to reduce the matching time because it can compare a group of pattern at one time. The results show that MPH-BMH is around 50% faster than BMH and QS algorithms in which it can scan and match large number of network packets in the given time and consequently it can be very useful to work in high speed networks. 

Average complexity of backward q-gram string matching algorithms

Many efficient string matching algorithms make use of q-grams and process the text in windows which are read backward. In this paper we provide a framework for analyzing the average case complexity of these algorithms taking into account the statistical dependencies between overlapping q-grams. We apply this to the q-gram Boyer–Moore–Horspool algorithm adapted to various string matching problems and show that the algorithm is optimal on average.

Enhanced Pattern Matching Performance Using Improved Boyer Moore Horspool Algorithm

In computer science, the Boyer–Moore–Horspool algorithm is an algorithm for finding substrings in strings. A pattern matching problem can be classified into software and hardware based on implemental methods. It is important of enhance pattern matching performance. This paper proposes enhanced pattern matching performance using improved Boyer Moore Horspool Algorithm. It combines the deterministic finite state; the improved Boyer Moore Horspool Algorithm takes full use of the matching information to skip several characters. Experimental result shows that the proposed improved Boyer Moore Horspool Algorithm is effective.

Improving Speed of the Signature Scanner using BMH Algorithm

As the importance of data in our computing systems has increased, number of viruses that may harm its integrity has also increased. It has become very important to detect them, so that we can remove them as well as disinfect the infected files. This paper presents an implementation of a fast signature scanner to detect the viruses. To reduce the scanning time, it uses Boyer-Moore-Horspool (BMH), a fast pattern-matching algorithm. It showed the best performance among commonly used pattern matching algorithms like Boyer Moore and Turbo-Boyer-Moore algorithms. General Terms Integrity checking technique, Signature scanning technique, Pattern matching problem.

The effect of multiple reference characters on detecting matches in string-searching algorithms

The effect of multiple reference characters and the condition types on the performance of exact string-searching algorithms is tested. In order to perform such a test a new algorithm called the Multiple Reference Characters Algorithm (MRCA) is developed. An experiment is performed using English text; the results are compared with the known string-matching algorithms called Boyer–Moore–Horspool (BMH) and Straight Forward (Naïve). With the MRCA algorithm, the shift distance is increased up to 3m + 1 positions in comparison with exactly one position in the Naïve algorithm and up to m positions in BMH. Furthermore, by using the new algorithm MRCA, the results suggest that the evaluation criteria of the average number of comparisons, the average number of shifts, and the clock time required by BMH are improved up to 73.1%, 64.7%, and 49.6%, respectively. The same evaluation criteria required by Naïve are improved by MRCA up to 98.1%, 98%, and 94.7%, respectively. Copyright © 2005 John Wiley & Sons, Ltd.

An n-gram hash and skip algorithm for finding large numbers of keywords in continuous text streams

A method of full-text scanning for matches in a large dictionary of keywords is described, suitable for Selective Dissemination of Information (SDI). The method is applicable to large dictionaries (say 104 to 105 entries), and to arbitrary byte streams for both patterns and data samples. The approach involves a sequence of tests, beginning with Boyer–Moore–Horspool skipping on digrams, followed by a succession of hash tests, and completed by trie searching, the combination of which is quite fast. Background information is provided, the algorithm and its implementation are described in detail, and experimental results are presented. In particular, tests suggest that the proposed method outperforms the algorithms of Aho–Corasick and Commentz–Walter when implementing large dictionaries. © 1998 John Wiley & Sons, Ltd.

An n-gram hash and skip algorithm for finding large numbers of keywords in continuous text streams

A method of full-text scanning for matches in a large dictionary of keywords is described, suitable for Selective Dissemination of Information (SDI). The method is applicable to large dictionaries (say 104 to 105 entries), and to arbitrary byte streams for both patterns and data samples. The approach involves a sequence of tests, beginning with Boyer–Moore–Horspool skipping on digrams, followed by a succession of hash tests, and completed by trie searching, the combination of which is quite fast. Background information is provided, the algorithm and its implementation are described in detail, and experimental results are presented. In particular, tests suggest that the proposed method outperforms the algorithms of Aho–Corasick and Commentz–Walter when implementing large dictionaries. © 1998 John Wiley & Sons, Ltd.

Arabic string searching in the context of character code standards and orthographic variations

In this paper, the problems of searching in Arabic text for finding a given pattern is considered from a practical perspective. Orthographic and character encoding variations are discussed. Four of the well known string searching algorithms have been modified to handle Arabic text and their performance has been examined and analyzed using vocalized and unvocalized Arabic texts of varying length. All algorithms could be modified to support the handling of diacritics, but only three could support spelling variant checking. The empirical results show that the Boyer–Moore–Horspool algorithm provides the best overall running time performance in dealing with Arabic text in terms of both the average number of comparisons and the average actual machine execution time. Most of the increase rate in the complexity of BMH is attributed to spelling variant checking, in comparison with the efficiency of handling diacritics.

On tuning the boyer-moore-horspool string searching algorithm

Experiments suggest that recently reported improvements to the Boyer-Moore-Horspool string searching algorithm may be due to compiler effects rather than to properties of the language being searched.