| 摘要 |
PROBLEM TO BE SOLVED: To provide an efficient method for renaming consecutive keys in a B-tree representing a hierarchical name space, such as a file system, with an estimated time efficiency of O(logN), where N is the number of nodes in the B-tree. SOLUTION: All the consecutive keys to be renamed are first excised from the original B-tree to form a trimmed B-tree, and the excised nodes are stored in a separate temporary extracted B-tree. The nodes in the extracted B-tree are then renamed, and the renamed extracted B-tree is inserted into the trimmed B-tree to form a final B-tree that contains the renamed keys. COPYRIGHT: (C)2006,JPO&NCIPI
|
