Guaranteed estimates of the time for search for an element in a hierarchical data structure

The paper is concerned with a method of physical organization of an abstract hierarchical structure which is used in a version of the INES system. Guaranteed estimates are obtained of the time for search for a vertex which is specified by its own key and of the time for search for vertices which follow a given one (on the level) and the branch). The effect of the order in which the vertices arrive in the storage structure on effectiveness of data access is investigated.