Enhancing or upgrading the existing algorithms needs big efforts to implement the existing one and after to on the problem or the limitation in these algorithms. As such, we need to enhance or upgrade this algorithm or its step to be efficient. Many
updating revised algorithms for string matching have been done in many areas. All the work relies on of how enhance the time matching to be efficient. This work introduces a good tool to enhance the existing Boyer-Moore algorithm. On the other hand, we have designed two new algorithms for string matching called RAM1 & RAM2 and developed the existing one called "enhance_BMA". The new algorithm
depends on abstraction string method in Java s tool, which helps to find great results even in the worst case of matching. Finally, most of the Object-Oriented programming concepts have been achieved in this work. We propose in this paper new algorithm using Java tool which we called it RAM1 & RAM2. The existing Boyer-Moore has problems when the pattern length is long. This leads to increase the time complexity which causes unstably for this algorithm. On the other hand, we enhance the Boyer-Moore Algorithm (BMA) for a
large given pattern in the text by using abstraction methods. Keywords: String Matching Algorithm, Boyer-Moore Algorithm,
efficient time, Abstraction methods, JAVA tools.

STRING matching problem scale has much attention over the years due to its importance in various computer applications such as text processing, information retrieval, computational biology and intrusion detection. All those applications require a highly efficient algorithm to find all the occurrences of a given pattern in the text . String-matching algorithms is a very important subject in the huge data of text processing. They play a main role in theoretical computer science by providing the enhancement and challenge to develop these algorithms. Due to the large amount of data that save in linear files these days, we need to make the string matching
algorithms efficient to search in these files, even if the processor speed and capacity of storage of computers increase regularly. String-matching algorithms look for an occurrence of a string (called a pattern) in a text. In this paper, the pattern is referred to by x=x [0...m-1] of characters; while its length is m. The text is referred by y=y [0...n-1]; its length is equal to n. We need to
find the pattern in a given text in finite set of characters called the alphabet (A). The text matching or searching in text patterns considers the main thing in the algorithm domain. We need to search the pattern in linear file or a large text in both ways either
the searching for exact pattern or closer for it in words. Though the sequential and binary search algorithms are used to find one key inside a large text or digits , it is not useful for our paper here. On the other hand, string matching algorithms is
considered the main concepts to execute software process inside the operating system. It also has a main role in computer science to solve complex problems [2]. Finally, in this paper, we need to search for a certain pattern (group of keys and characters) in a
large text or other closer pattern [3] using abstraction methods by Java tool to satisfy the efficient time.