| 摘要 |
A relational database is provided with a plurality of data entries stored in the database. The data entries have a hierarchical relationship. The data entries are assigned a real number, unique identifier, which can be calculated using a convergent series, capable of locating each data entry in the hierarchical structure. Each data entry is assigned a float type, level value, identifying the data entries hierarchical level in the structure. The data entries are also assigned an family value defining a hierarchical relationship with another data entry. The invented method allows for retrieving a sub-tree of any data entry by comparing two real numbers, and adding new data entries or a sub-tree without making changes to other data entries.
|
