Proposal of search method compressed the one-way branch hased on the double-array structure

Digital search is expressed by the digital search tree which considers a part of keys as transitions. Therefore, it is frequently used for various applications, such as natural language dictionaries because of being dependent on the key length for search processing. There is the compressed digital search tree which compressed the one-way branches after the leaf and reduces nodes on digital search tree. However the one-way branches has still existed on the compressed digital search tree. In this paper, we present the search method which used the digital search tree compressed all one-way branches used the double-array structure. The simulation results confirmed that the proposed method is more efficient than the original method.