@article{oai:ir.kagoshima-u.ac.jp:00005886,
 author = {新森, 修一 and SHINMORI, Shuichi and 永福, 俊也 and EIFUKU, Shunya and 礒道, 隆一 and ISOMICHI, Ryuichi},
 journal = {鹿児島大学理学部紀要, Reports of the Faculty of Science, Kagoshima University},
 month = {Dec},
 note = {In this paper, we propose to develop a balanced tree with 3-subtrees, for the purpose of increasing search
efficiency, and examine various evaluations for the extended AVL tree. The data structure of this balanced tree contains
right-and-left balanced subtrees and central subtrees that match prefixes character by character by implementing the
radix search method. By introducing central partially subtrees, it becomes easy to look for the target data. A numerical
experiment using 10 million pieces with 100-digit character strings in decimal number confirmed that the construction
time was about 81% of the usual AVL tree. Moreover, it is possible to delete data completely and that experiment
confirmed that the removal time was about 78% of the usual AVL trees.},
 pages = {1--12},
 title = {平衡性を持つ3分木構造の提案とその評価},
 volume = {47},
 year = {2014}
}