Novel approach for string searching and matching using American standard code for information interchange value

The algorithms based on string matching generally searches for the search string in the database and find all the occurrences of the search string. This paper introduces a novel approach for string searching and matching to identify the correct occurrence of a given search string. The proposed work is based on calculating the sum of ASCII values of each character in the search string and comparing this sum with only the names which have the same ASCII values in the database. This is implemented using hashing and hence it can limit the search to only a few name strings. After searching for the corresponding ASCII value the string matching is done by comparing the first and last character of the search string with the name strings. If there is a match, then any two random positions in the search string are considered for comparison. If all these four positions match, then the whole string is compared, otherwise the string is skipped from further comparisons. This method is efficient in identifying the search string easily and the number of comparisons is reduced.