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 .