KP-trie algorithm for update and search operations

Abstract EN

adix-Tree is a space optimized data structure that performs data compression by means of cluster nodes that share the same branch.

Each node with only one child is merged with its child and is considered as space optimized.

Nevertheless, it can’t be considered as speed optimized because the root is associated with the empty string.

Moreover, values are not normally associated with every node; they are associated only with leaves and some inner nodes that correspond to keys of interest.

Therefore, it takes time in moving bit by bit to reach the desired word.

In this paper we propose the KP-Trie which is consider as speed and space optimized data structure that is resulted from both horizontal and vertical compression.