44. The method for removing information about objects of an arbitrary application domain from the system for storage and retrieval of a plurality of information objects according to claim 1 , comprising the steps of: a) marking an AUS to be removed, and b) comparing IOs of new AUSs added to said storage and search system with the IO of the AUS to be removed and, if the similarity criterion as per the metric of said IOs is met, replacing the AUS being removed with the added AUS on the logical network of said system.
44. The method for removing information about objects of an arbitrary application domain from the system for storage and retrieval of a plurality of information objects according to claim 1 , comprising the steps of: a) marking an AUS to be removed, and b) comparing IOs of new AUSs added to said storage and search system with the IO of the AUS to be removed and, if the similarity criterion as per the metric of said IOs is met, replacing the AUS being removed with the added AUS on the logical network of said system. 48. The method according to claim 44 , wherein the metric is information distance between two IOs, determined as a matrix of size n 1 ×n 2 : {ρ(T 1 ,r 1 ,T 2 ,r 2 )} n 1× n 2 , where T 1 , T 2 are rooted trees, representing the intrinsic structure of compared IOs, r 1 , r 2 are two nodes (from T 1 and T 2 respectively), designated as temporary roots, n 1 , n 2 denote the number of nodes in the structures of the first and second IOs respectively; therewith ρ(T 1 ,r 1 ,T 2 ,r 2 )=(c(T 1 ,r 1 ,T 2 ,r 2 )) α , where c(T 1 ,r 1 ,T 2 ,r 2 ) is the similarity measure equal to the power of the largest subtree common for two compared IO trees, isomorphically transformed relative to the designated temporary roots r 1 and r 2 respectively, and α is a numeric parameter assuming values α<−1.