Efficient single pattern searching algorithm for offline text by using binary search tree (ESPS Algorithm)

To retrieve all recurrence of the pattern in offline text, pattern searching techniques are used. Two processes would be carried out in our approach, first process would be preprocessing and second process would be searching process. Pattern searching algorithms consists of problems with searching space and time overhead. The efficiency of proposed algorithm is improved by adopting binary search tree and SDBM hash function techniques. These techniques are applied to make fast the search time to find a unique key for each pattern in the text.