TRIE TREE ALGORITHM WITH MODIFIED KEY SAMPLING FUNCTION

The ongoing changes in computer performance are affecting the efficiency of string searching algorithms. The size of main memory in typical computers continues to grow, but memory accesses require increasing numbers of instruction cycles. One of the most important data structure which is used to improve the string searching is the Trie tree. The name Trie comes from the word “retrieval”. This data structure dose not store the data as specific elements, but rather as a path through the tree. This research aims to improve the performance of the Trie tree by using a proposed sample function in trie algorithm which improve space utilization and decrease the number of the search levels in the trie tree. i.e. decrease the time of searching because it searches less number of levels than the standard sample function.