Efficient Word Processing Applications Using Radix Tree

Computer needs an efficient mechanism to store, retrieve, manage and process huge amount of data. When the data is organized efficiently on the storage device and on the main memory then it can be accessed quickly for processing. It will reduce the access time and will provide better working environment to the users. Data structure provides a scheme to organize the data which will lead to systematic organization of the data in such a way that data will be quickly available for the processor to process. Word processing is a powerful feature that allows the user to create, insert, modify and search the text in a file. The authors of this paper propose usage of radix trie datastructure for efficiently handling word processing applications. This datastructure can be used for storing and retrieving information for various applications such as Prefix Matching (Auto complete), Information Retrieval, Dictionary Implementation. In this paper authors discuss their experience in design, implementation of Radix Tree for word processing applications. The experimental result shows that radix tries performs better compared to other word processing datastructure such as hash tables.