PMT_EDS: Pattern Matching as a Tool for Efficient and Dynamic Search in the Large Files

Authors

  • Hrushikesava Raju S PP.CSE.0158, Rayalaseema University, Kurnool (A.P.), India
  • Nagabhushana Rao M Department of CSE, K L University, Vijayawada (A.P.), India

Keywords:

pattern matching, statistics, searching, multi-process, time complexity, tool, PMT_EDS

Abstract

There exist many pattern matching approaches, which consume more time and unable to perform operations like recording history, finding number of times a pattern is found along with positions, page numbers etc. and they have limitations in performing operations beyond their usual operations. The pattern matching using indexOf method is proposed to find out a specific pattern or multiple patterns at a time in less time complexity. The additional information is reported by recording history operation, information of where the pattern is located like page number, number of times that pattern is found can be processed by searching operation, and multi-process operation searches multiple patterns and returns their locations, page numbers in less time complexity by using indexOf metod as a thread in achieving better efficiency. To do all these operations, an automated tool is required that asks for operation to perform, required details to be provided in that operation, and results going to be illustrated or reported. Data pre-processing is required when there is any inconsistency present in the dataset.

References

. Hrushikesava Raju S., Nagabhushana Rao M., “Improvement of Time Complexity on Pattern Matching using One -Time Look Indexing and Data Preprocessing”, IJCSE, Vol.4(11),PP.100-106,2016 E-ISSN:2347-2693.

. Hrushikesava Raju S. ,Swarna Latha T.,“Dynamic Pattern Matching: Efficient Pattern Matching using Data Preprocessing with help of One time look indexing method”, IJARCET,Vol.2(2),pp.592-599, 2013,ISSN:2278-1323.

. Hrushikesava Raju S., Nagabhushana Rao M.,“ “Pattern Matching Using Data Preproc-Essing With The Help Of One Time Look Indexing Method”, IJPT, Vol.8(3),pp.14749-14756, ISSN:0975-766X.

. Michael Good Rich T. and Roberto Tamassia, “Data Structures and Algorithms in java”, Fifth Edition, January,2010.

. Akepogu Ananda Rao and Radhika Raju polagiri, “Data Structures and Algorithms using C++”, Kindle Edition,Pearson, July,2010.

. Donald Adjeroh, Timothy Bell and Amar Mukharjee,“The Burrows Wheeler Transform”, Springer, July,2008.

. Machael McMillan,“Data Structures and Algorithms using Visual Basic.NET”, Cambridge Edition, March,2005.

. Svetlana, Eden, “Introduction to String Matching and modification in R using Regular expressions”, March,2007.

. Jeffrey.E.F.Fredl,“Mastering Regular Expression”, 3rd Edition, O,reilly publications,December,1998.

. Regular expressions and Matching in Modern Perl 2011-12 edition,ISBN-10: 1680500880,ISBN-13: 978-1680500882,October,2015.

. S. S. Sheik,Sumit K. Aggarwal,Anindya Poddar, N. Balakrishnan,and K. Sekar ,”A FAST Pattern Matching Algorithm”, J. Chem. Inf. Comput. Sci. 2004, 44, 1251-1256.

. Micheline Kamber and Jiawei Han, “Data Mining Concepts and Techniques”, Second Edition,March,2006.

Downloads

Published

2025-11-11

How to Cite

[1]
S. Hrushikesava Raju and M. Nagabhushana Rao, “PMT_EDS: Pattern Matching as a Tool for Efficient and Dynamic Search in the Large Files”, Int. J. Comp. Sci. Eng., vol. 5, no. 2, pp. 136–140, Nov. 2025.

Issue

Vol. 5 No. 2 (2017): IJCSE February Edition

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.