Comparative analysis of computer-aided tree-like structure organization

Ways to store arrays in data banks of hierarchical are analyzed. The index-successive, randomized and dynamic approaches to computer-aided array organization are qualitatively analyzed in terms of the «average» and «the worst case» estimates. IMS/2 system array storage and the dynamic method are described in equivalent terms. For these methods analytical estimates of time characteristics are obtaine and compared in terms of random (one quiery) and batch (several quieries) search and retrieval of records on the class of information trees. The qualitative and analytical results show the advantages of the dynamic method for a wide range of information problems.