An Efficient Word Lookup System by using Improved Trie Algorithm

TL;DR

This paper introduces an improved Radix trie data structure that efficiently stores and searches words by sharing prefixes, infixes, and suffixes, significantly reducing memory usage in various applications.

Contribution

It presents a novel Radix trie with an emptiness property and character cell reduction, enabling substantial memory savings over traditional trie structures.

Findings

Reduces memory requirement in word searching applications

Shares prefix, infix, and suffix in the trie structure

Dramatically decreases application runtime memory size

Abstract

Efficiently word storing and searching is an important task in computer science. An application space complexity, time complexity, and overall performance depend on this string data. Many word searching data structures and algorithms exist in the current world but few of them have space compress ability. Trie is a popular data structure for word searching for its linear searching capability. It is the basic and important part of various computer applications such as information retrieval, natural language processing, database system, compiler, and computer network. But currently, the available version of trie tree cannot be used widely because of its high memory requirement. This paper proposes a new Radix trie based data structure for word storing and searching which can share not only just prefix but also infix and suffix and thus reduces memory requirement. We propose a new emptiness property to Radix trie. Proposed trie has character cell reduction capability and it can dramatically reduce any application runtime memory size. Using it as data tank to an operating system the overall main memory requirement of a device can be reduced to a large extent.