Digital addressing-based method for structured storage and rapid processing of command relation tree

Abstract

The invention discloses a digital addressing-based method for structured storage and rapid processing of a command relation tree. The method comprises the following steps of: 1, marking all nodes on the command relation tree by numeric strings with node positional information; 2, storing node identifiers, the numeric strings, step length and node information of all the nodes serving as a record into a database, and storing the structure information of one tree by a two-dimensional table; and 3, managing the structure information of the tree, wherein the management comprises the following operation of: reading the structure information of the tree, increasing nodes and deleting nodes. According to the method, the tree structure can be rapidly stored and read, ergodic search with low efficiency can be avoided according to the numeric strings identified with the node position, the system and the step length of the numeric strings can be flexibly configured, and the processing efficiency,the flexibility and the stability are improved.

Description

technical field [0001] The invention relates to a data storage method, in particular to a command relationship tree structured storage and fast processing method based on digital addressing for the tree structure of the command field. Background technique [0002] In the field of command and management, personnel organization or material objects are often expressed in a tree structure, which often presents the characteristics of multiple layers, large scale, and frequent addition and deletion of bottom nodes. At the same time, the system has relatively high requirements on the efficiency of tree structure reading and node operation, which requires an efficient and simple data persistence and processing method. At present, the commonly used method is to use a two-dimensional table to store tree structure information, and perform related operations on the basis of it. [0003] Based on tree structure storage of two-dimensional tables, Chinese patent CN200310113660.2 discloses...

AI Technical Summary

Problems solved by technology

When this method is applied to the general field, there are several disadvantages:

[0005](2) The two-dimensional table stores the structure information of the binary tree, which cannot reflect the original structure information of the tree. If you need to read the original tree structure from the two-dimensional table , then a conversion reduction calculation is also required;

[0006](3) Every time a leaf node is added or deleted, a search operation will be caused, and multiple records need to be modified at the same time, which increases the system consumption

Images