Abstract
Matching approaches based on the exact match are popular and commonly utilized in various applications such as texting, intrusion detection network systems, web-based search engines and molecular biology. The efficiency of these approaches is measured in terms of time taken in the text searching and effective utilization of heap memory. This paper suggests a unique approach for achieving both time proficiency and better memory usage by splitting the query text pattern used for searching the text Corpus. The propound approach divides the query pattern P into multiple parts such as \({\text{P}}_{{\text{k}}} ,\;{\text{P}}_{{{\text{k}} - {1}}} ,\; \ldots ,\;{\text{P}}_{{2}}\) and P1 where k depends on the pattern length. In this article, the scanning of the text corpus is performed from the right to the left and the searching of the multiple sub-patterns is performed in the right to the left order. The propound approach applies the traditional Boyer Moore approach to minimize the comparison cost by using a bad match table for the characters of the first sub-pattern P1 only. The sub-patterns other than P1 are matched using the Brute Force approach. The sub-patterns are mapped at the beginning of other sub-patterns such as \({\text{P}}_{{\text{k}}} {\text{P}}_{{{\text{k}} - {1}}} \ldots {\text{P}}_{{2}} {\text{P}}_{{1}}\), to find the exact matching. The comparative study of the traditional approaches and the suggested solution indicates that the suggested approach outruns the traditional approaches in terms of memory utilization and matching time.
Similar content being viewed by others
References
Al-Khamaiseh K, Alshagarin S (2014) A survey of string matching algorithms. J Eng Res Appl 4(2):144–156
Al-Ssulami AM (2015) Hybrid string matching algorithm with a pivot. J Inf Sci 41(1):82–88
Boyer RS, Moore JS (1977) A fast string searching algorithm. Commun ACM 20(10):762–772
Chayapathi AR, Sunil Kumar G, Manjunath Swamy BE, Thriveni J, Venugopal KR (2021) Analysis of pattern matching algorithms used for searching the patterns in MLIR framework. Turk J Comput Math Educ 12(7):738–748
Crochemore M et al (1994) Speeding up two string-matching algorithms. Algorithmica 12(4–5):247–267
Faro S, Külekci MO (2013) Fast packed string matching for short patterns. In: Proceedings of the workshop on algorithm engineering and experiments, pp 113–121
Faro S, Lecroq T (2013) The exact online string matching problem: a review of the most recent results. ACM Comput Surv 45(2):1–42
Hakak SI, Kamsin A, Shivakumara P, Gilkar GA, Khan WZ, Imran M (2019) Exact string matching algorithms: survey, issues, and future research directions. IEEE Access 7:69614–69637
Horspool RN (1980) Practical fast searching in strings. Softw Pract Exp 10(6):501–506
Karp RM, Rabin MO (1987) Efficient randomized pattern-matching algorithms. IBM J Res Dev 31(2):249–260
Knuth D, Morris J Jr, Pratt V (1977) Fast pattern matching in strings. SIAM J Comput 6(2):323–350
Lecroq T (2007) Fast exact string matching algorithms. Inf Process Lett 102(6):229–235
Lin J, Adjeroh D, Jiang Y (2014) A faster quick search algorithm. Algorithms 7(2):253–275
McEnery AM, Xiao RZ (2005) Character encoding in corpus construction
Mohammad A, Saleh O, Abdeen RA (2006) Occurrences algorithm for string searching based on brute-force algorithm. J Comput Sci 2(1):82–85
Ojugo AA, Oyemade DA (2021) Boyer moore string-match framework for a hybrid short message service spam filtering technique. IAES Int J Artif Intell 10(3):519–527
Rafiq ANME, El-Kharashi MW, Gebali F (2004) A fast string search algorithm for deep packet classification. Comput Commun 27(15):1524–1538
Rao CS, Raju KB, Raju SV (2013) Parallel string matching with multi core processors-a comparative study for gene sequences. computerresearch.org
Shah P, Oza R (2018) Improved parallel Rabin-Karp algorithm using compute unified device architecture. In: Information and Communication Technology for Intelligent Systems (ICTIS 2017), Springer International Publishing, vol 22, pp 236–244
Singla N, Garg D (2012) String matching algorithms and their applicability in various applications. Int J Soft Comput Eng 6:218–222
Sivathanu S, Liu L, Yiduo M, Pu X (2010) Storage management in virtualized cloud environment. In: Proceedings—2010 IEEE 3rd international conference on cloud computing, CLOUD 2010, pp 204–211
Sunday DM (1990) A very fast substring search algorithm. Commun ACM 33(8):132–142
Yang T, Hertz M, Berger ED, Kaplan SF, Eliot J, Moss B (2004) Automatic heap sizing: taking real memory into account. In: International symposium on memory management, ISMM, pp 61–72
Yuan Y, Liu WC (2011) Efficient resource management for cloud computing. In: 2011 international conference on system science, engineering design and manufacturing informatization, ICSEM 2011, vol 2, pp 233–236
Yuan J, Zheng J, Ding S (2010) An improved pattern matching algorithm. In: 3rd international symposium on intelligent information technology and security informatics, IITSI 2010, pp 599–603
Funding
There is no funding thats why author have choosed subscription based publication.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
There is no conflict.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Srivastav, S., Singh, P.K. & Yadav, D. A novel approach to solve exact matching problem using multi-splitting of text patterns. Int J Syst Assur Eng Manag 14, 1457–1466 (2023). https://doi.org/10.1007/s13198-023-01948-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13198-023-01948-7