A Method for Composition of TRIE Key

Sonil Kwak, Cholmin Cho, Cholgwon O

Abstract


In this paper we propose a method for composition of TRIE key and verify its effectiveness to extend the application of TRIE which is high speed search structure.


Full Text:

PDF

References


Cho Cholmin and Choe Jongho. A Study on speed up method of double array compressing TRIE, Journal of Kim Il Sung University (natural science). Vol.54, No.8, pp.23-25, 2008 [2] Jun-ichi.Aoe, Katsushi Morimoto, Masami Shishibori and Ki-hong Park. A Trie Compaction Algorithm for a Large Set of Keys, IEEE Transactions on Knowledge and Data Engineering, Vol 8, Issue 3, June 1996, pp 476-491. [3]Kurt Maly. Compressed Tries, Communications of the ACM, Vol 19, Issue 7, 1976, pp 409-415 [4] D.E.Zegour, Scalable distributed compact trie hashing (CTH*), Information and Software Technology, Vol 46, Issue 14, pp 923-935, 2004. [5] M.E.Nebel. The Stack-size of Tries: A Combinational Study, Theoretical Computer Science, Vol 270, Issues 1-2, pp 441-461, 2002. [6] Minsoo Jung, Masami Shishibori, Yasuhiro Tanaka and Jun-ichi Aoe, A dynamic construction algorithm for the Compact Patricia trie using the hierarchical structure, Information Processing and Management, Vol.38, Issue 2, pp.221-236, 2002.


Refbacks

  • There are currently no refbacks.