| 摘要 |
<p>The invention concerns a method for searching at least an object contained in a containment tree comprised in a computer system including physical and/or software resources, said computer system comprising at least a data storage unit, said tree being a programme represented by a hierarchic structure with a root (ROOT) and nodes called objects associated with respective resources of the system and linked via branches. Said method is characterised in that it consists in: including in one level a respective type of resource; assembling said objects in at least one domain, a domain being a set of objects of same level, the level of a node defining the number of branches to be run through from the root to said node; in selecting all or part of a name of a node included in the domain; and characterised in that it consists in: successively, until the name of the node is identified, analysing the objects of one level recursively, the passage from one level (n) to another level (n + 1) being carried out only if all the objects of the level (n) have been analysed.</p> |
