Trie Data Structure

Abstract

This thesis focuses on the Trie data structure, a type of data structure that mainly handles the prefixes of the strings. Tries are very popular for applications such as building dictionaries, spell-checking, and auto-completion. However, performance can be challenging if the Trie works with large strings or a large alphabet, leading to various issues in its retrieval and storage capabilities. The main challenge is to select an appropriate data structure for handling the characters in the nodes of a Trie, based on factors such as the size of the alphabet that it can handle, operations performance, and implementation complexity. Therefore, in this thesis, we will study variations of the Trie data structure, considering their structures and operations to facilitate the selection of the optimal approach for processing large strings and alphabets. Finally, we will compare the performance of this variation with sequential array structure to assess its string-processing capabilities, highlighting its potential for practical applications.