| 摘要 |
<p>A method for efficient handling and manipulating of information hierarchies that include multi-parent connectivity is disclosed. The hierarchy nodes are first mapped to a "Main tree" in which the path from the hierarchy root to each node is the longest possible and denoted "Main path". The Main path is further numerically specified by a "Numerical path" which is based on the hierarchical structure of the containing Main tree. The above notions are utilized for efficient transfers of sub-hierarchies from server to client computers. The client request for information is hierarchically formatted wherein the requested information may be specified for each node. The information that is transferred from the server in response is correspondingly formatted and may contain any combination if information types for each node, e.g. node name, its child nodes, its connectivity to parent nodes and associated content.</p> |
