| 摘要 |
The present invention is a process of organization of a relational data base, aimed to be used in a computer system containing at least a processor and some memory, characterized in that it includes the steps consisting in: Elaborate a hierarchical expansion table; Create the thesaurus of each of the columns; For each of the words of the thesaurus, create the radix tree of the set of line indexes at which the aforementioned word appears; For each of the primary keys, store the sequence of these values and a permutation on this set of values in order to find back a given value.
|
