Join us   Log in  

ALLANA MANAGEMENT JOURNAL OF RESEARCH, PUNE - Volume 5, Issue 2, July 2015 - December 2015

Pages: 99-107
Print Article   Download XML  Download PDF


Author: Ms. Urvashi Kumari, Dr. Sarika Sharma

Category: Information Technology Management


String data is ubiquitous, common-place applications are digital libraries and product catalogs (for books, music, software, etc.), electronic white and yellow page directories, specialized information sources (e.g. patent or genomic databases), customer relationship management of data, etc. The amount of textual information managed by these applications is increasing at a incredible rate. The best two descriptive examples of this growth are the World-Wide Web, which is estimated to provide access to at least three terabytes of textual data, and the genomic databases, which are estimated to store more than fifteen billion of base pairs. The problem of string searching and matching is fundamental to many such applications which depend on efficient access of large no. of distinct strings or words in memory. For example spell checking in text editor, network intrusion, computer virus detection, telephone directory handling (electronic yellow page directory) etc. String matching is very important and one of the fundamental problem of computer science and is an important problem where we try to find a place where one or several strings are searched within large set of strings which is usually termed as texts. In this paper the researcher is trying to explore various means of string matching and also the diversified application on this classic problem.


String matching, String searching, Trie, Index, Time complexity, Space