TY - GEN
T1 - SBM
T2 - 2nd International Conference on Business Analytics for Technology and Security, ICBATS 2023
AU - Nassoura, Ayman Bassam
AU - Ibrahim, Muhammad
AU - Ali, Atif
AU - Safdar, Sania
AU - Ur Rehman, Shujah
AU - Ibrahim, Amer
AU - Alrababah, Hamza
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2023
Y1 - 2023
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85160779043&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85160779043&partnerID=8YFLogxK
U2 - 10.1109/ICBATS57792.2023.10111342
DO - 10.1109/ICBATS57792.2023.10111342
M3 - Conference contribution
AN - SCOPUS:85160779043
T3 - 2nd International Conference on Business Analytics for Technology and Security, ICBATS 2023
BT - 2nd International Conference on Business Analytics for Technology and Security, ICBATS 2023
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 7 March 2023 through 8 March 2023
ER -