FIELD: physics, computer engineering.
SUBSTANCE: invention relates to information processing and specifically to methods of searching for information and creating data structures to this end. The method of compressing a prefix tree data structure includes node merging after ranking and finding the most suitable merging pair. To this end, values of numerical characteristics of random quantities are calculated at each iteration for all nodes involved in compression. The best node for merging is selected for each node according to a selected criterion. Iterations continue while there is still potential for merging for at least a pair of nodes.
EFFECT: high compression density, which enables to reduce the amount of random-access memory needed to store said data structure without complicating the search algorithm and reducing the information search rate.
5 dwg
