KP-Trie algorithm for update and search operations

Radix-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.

[1]  Wojciech Szpankowski,et al.  Profiles of Tries , 2008, SIAM J. Comput..

[2]  Edward Fredkin,et al.  Trie memory , 1960, Commun. ACM.

[3]  Stefan Nilsson,et al.  An Experimental Study of Compression Methods for Dynamic Tries , 2002, Algorithmica.

[4]  Hong Zhu,et al.  VParC: a compression scheme for numeric data in column-oriented databases , 2016, Int. Arab J. Inf. Technol..

[5]  Yuriy A. Reznik.  Some results on tries with adaptive branching , 2002, Theor. Comput. Sci..

[6]  David M. Mount,et al.  A dynamic data structure for approximate range searching , 2010, SCG.

[7]  Lajos Rónyai,et al.  Trie: An alternative data structure for data mining algorithms , 2003 .

[8]  Ranjan Sinha,et al.  HAT-Trie: A Cache-Conscious Trie-Based Data Structure For Strings , 2007, ACSC.

[9]  Gunnar Karlsson,et al.  Improving and Analyzing LC-Trie Performance for IP-Address Lookup , 2007, J. Networks.

[10]  Evaluating Alternative Structures for Prefix Trees , .

[11]  H. Jonathan Chao,et al.  FlashTrie: Hash-based Prefix-Compressed Trie for IP Route Lookup Beyond 100Gbps , 2010, 2010 Proceedings IEEE INFOCOM.

[12]  Hugh E. Williams,et al.  Burst tries: a fast, efficient data structure for string keys , 2002, TOIS.

[13]  Justin Zobel,et al.  Redesigning the string hash table, burst trie, and BST to exploit cache , 2011, JEAL.

[14]  Roberto Grossi,et al.  The string B-tree: a new data structure for string search in external memory and its applications , 1999, JACM.

[15]  Niloufar Shafiei.  Non-blocking Patricia Tries with Replace Operations , 2013, 2013 IEEE 33rd International Conference on Distributed Computing Systems.

[16]  Marian Cristian Mihaescu,et al.  Using M Tree Data Structure as Unsupervised Classification Method , 2012, Informatica.

[17]  Hossein Saidi,et al.  The CPBT: A Method for Searching the Prefixes Using Coded Prefixes in B-Tree , 2008, Networking.

[18]  Viktor Leis,et al.  The adaptive radix tree: ARTful indexing for main-memory databases , 2013, 2013 IEEE 29th International Conference on Data Engineering (ICDE).

[19]  Donald R. Morrison,et al.  PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric , 1968, J. ACM.

[20]  Parth Patel,et al.  Comparison of Advance Tree Data Structures , 2012, ArXiv.