| 摘要 |
PROBLEM TO BE SOLVED: To provide optimized tree data structure capable of realizing both of speedy access and the improvement of the efficiency of a memory. SOLUTION: Optimization is attained through two unique mechanisms being the collapse of a tree and an instant index. The collapse optimizes tree structure by deleting the unnecessary level of the tree, and realizes the efficient use of a memory. The instant index cuts off the branch of the tree and stores each index at the possible highest level to optimize tree data structure. Since an index which is not mapped is skipped at the possible highest level of the tree, a mapped instant index is retrieved speedily compared with a conventional technique.
|
