| 摘要 |
The system relates to a structure for the storage of data-information within a data-base, which information is structured into a hierarchy of nodes and which hierarchy consists in a tree-structure. This tree-structure has a root-node (1), possibly one or several intermediate nodes (2, 3) and one or more leaf-nodes (4), wherein the root-node (1) comprises one or more root-elements (1E), wherein respective intermediate nodes (2, 3) include one or more intermediate elements (2E1, 2E2, 2E3, . . . ), and wherein respective leaf-nodes (4) include one or more leaf-elements (4E1, 4E2, 4E3, . . . ). Respective elements include the address information necessary to hold the tree-structure together and enable searches to be performed in the tree and data-information. The order of the elements within a node is a logical order concerning the data-information, such as a numerical or alphabetical order, where the data-information within respective elements constitutes the difference in data-information in relation to the data-information within the preceding element in the hierarchy. The data-information within the root-element constitutes a start-value. This start-value is the actual data-information, and the differential information within the remaining elements is made up of a data-word that represents the actual difference of the data-information in relation to the data-information belonging to the preceding element, regardless of where the difference is within the data-information. |
