Návrh a implementace datové struktury Trie

Abstract

This diploma thesis deals with the description and implementation of Trie data structure. The Trie data structure is described in detail, including operations above this data structure. There are mentioned the advantages and disadvantages of this structure, and there is also a solution designed to overcome some deficiencies in the Trie data structure. Subsequently this diploma thesis describes data structures based on Trie, including its persistent variant. The next chapter explains the paging of data structures and their purpose. The implementation part describes the RadegastDB database framework and its use in Trie implementation. There is also described the implementation of Trie in C ++, including its optimized version. This is followed by performance testing of this structure and its variants on several data collections. And their subsequent comparison with B+-tree and sequential array, implemented within RadegastDB framework.