• Aug 09, 2018 News![CFP] The annual meeting of IJFCC Editorial Board, ICCTD 2019, will be held in Prague, Czech Republic during March 2-4, 2019.   [Click]
  • Aug 09, 2018 News!IJFCC Vol. 6, No. 1-No. 3 has been indexed by EI (Inspec).   [Click]
  • Dec 24, 2018 News!The papers published in Vol.7, No.1-No.2 have all received dois from Crossref.
General Information
    • ISSN: 2010-3751
    • Frequency: Bimonthly (2012-2016); Quarterly (Since 2017)
    • DOI: 10.18178/IJFCC
    • Editor-in-Chief: Prof. Mohamed Othman
    • Executive Editor: Ms. Cherry L. Chan
    • Abstracting/ Indexing: Google Scholar,  Crossref, Electronic Journals LibraryEI (INSPEC, IET), etc.
    • E-mail:  ijfcc@ejournal.net 
Prof. Mohamed Othman
Department of Communication Technology and Network Universiti Putra Malaysia, Malaysia
It is my honor to be the editor-in-chief of IJFCC. The journal publishes good papers in the field of future computer and communication. Hopefully, IJFCC will become a recognized journal among the readers in the filed of future computer and communication.
IJFCC 2016 Vol.5(6): 229-232 ISSN: 2010-3751
doi: 10.18178/ijfcc.2016.5.6.476

An Implementation Method of Trie Structure Using Xorshift

Kazuhiro Morita, Shunsuke Kanda, and Masao Fuketa
Abstract—Key retrieval is the most basic and important technology. The trie is one of the key retrieval methods that can be retrieved without depending on the number of registered keys. The development of implementation method of a trie is indispensable for use in application fields. The double array is an excellent implementation method of a trie with high speed retrieval and compactness. However, there is room for the improvement in comparison with the implementation method given priority to memory efficiency because the size for two integer types per one node is necessary. This paper presents a novel implementation method for a trie by using the idea of the randomized algorithm. From experimental observations, it was shown that the proposal method promotes efficiency of a trade-off of memory size and the speed well.

Index Terms—Trie, double array, randomized algorithm, pseudorandom number generator.

Kazuhiro Morita and Masao Fuketa are with the Department of Computer Science, Graduate School of Science and Technology, Tokushima University, Tokushima, Japan (e-mail: kam@is.tokushima-u.ac.jp, fuketa@is.tokushima-u.ac.jp).
Shunsuke Kanda is with the Department of Information Science and Intelligent Systems, Graduate School of Advanced Technology and Science, Tokushima University, Tokushima, Japan (e-mail: shnsk.knd@gmail.com).


Cite: Kazuhiro Morita, Shunsuke Kanda, and Masao Fuketa, "An Implementation Method of Trie Structure Using Xorshift," International Journal of Future Computer and Communication vol. 5, no. 6, pp. 229-232, 2016.

Copyright © 2008-2018. International Journal of Future Computer and Communication. All rights reserved.
E-mail: ijfcc@ejournal.net