| 摘要 |
PROBLEM TO BE SOLVED: To optimize performance characteristics of digital tree and similar structures. SOLUTION: The data structure comprises a hierarchy of branch nodes (103, 108, 109, 119, 120, 121, 123) and each of the branch nodes comprises an array of adaptable objects (104, 105, 110, 112, 111, 114-118, in Fig. 2), each associated with a subexpanse of the indexes mapped by a respective one of the branch nodes, the adaptable objects each including a type field (T) indicating a type of the adaptable object, the type including a pointer type and an immediate type (Fig. 2-6) in which at least one of the indexes is stored in the adaptable object, the pointer type including a pointer (116B) to another node and an information data field (116A) configured to store information of other node said in the above.
|
