Data structure is an important subject for any system that deals with strings (sequence of characters from an alphabet) and text processing, such as word-processor, text editor and other systems. Many problems arise when dealing with strings operations as sequences consist of undefined number of characters (e.g., the execution time) due to the overhead hidden-operations (like, symbols matching calculations and conversions operations). The execution time largely depends on the nature of string length (the number of characters in the strings plus the number of words in the sentence). In addition, the length limitation is a common problem in many operations because the variable length of strings is an obstacle to represent and manipulate string. Many of string matching algorithms were introduced in the literature to deal with fixed length of characters for each string.
This paper is focusing on reducing the time for text processing by taking the advantage of enumerating each strings to numbers using multi hashing methodology. Some experimental results are provided for a number of operations such as (simple string matching, hashing indexing systems, garbage words collection and text extractions) to understand the advantage of the proposed method. A comparison is made with the traditional method that deals with strings only and the results demonstrate the effectiveness of the proposed approach.