| 摘要 |
The invention relates to a method for organising a relational database for a computer architecture comprising at least one processor and a memory, characterised in that it involves stages consisting in producing a hierarchical expansion table, forming a thesaurus on each of columns, producing a radical tree for a set of line indexes on which said word appears for each word of each thesaurus and in storing the sequence of said values for each primary key by permutating the set of said values in order to find data. |
