SBM: A Time and Resource Efficient Single Backward Match Exact String Searching Algorithm
Ayman Bassam Nassoura, Muhammad Ibrahim, Atif Ali, Sania Safdar, Shujah Ur Rehman, Amer M. Ibrahim, Hamza Alrababah
Abstract
As in the current era, data is expanding daily on the web, where tremendous data banks with big data need to be searched by different users according to their data needs. This is when normal users cannot afford more waiting time searching the required data and indulge themselves in uncomfortable, lengthy, and complex computational processes. Moreover, search results will also play a vital role in extracting the desired output from the existing data bank. By keeping this common and consistent need of the normal user, the effort has been made to formulate a solution in the exact string searching algorithm. The algorithm's simplicity will add efficiency and speed up the processing time compared to the existing exact string-searching algorithms in terms of worst-case complexity. The proposed algorithm is compared with Boyer Moore Hoorspool, Knuth Morris Pratt (KMP), and Back and Forth Matching Algorithms to understand the results better.