Method and system for processing data in treelike structures

Abstract

The invention provides a method and a system for processing data in treelike structures. The method comprises the following steps that: the root nodes of all the treelike structures are numbered by increasing digitals, wherein the root nodes of each treelike structure are the first stage, and the leaf node having a depth of i is the i+1 stage, wherein i is an integer greater than or equal to 2; a plurality of nodes belonging to the nodes having a depth of i-1 in the nodes having the depth of i in the same treelike structure are numbered by increasing digitals, and a serial number field is configured for each node on the treelike structure, wherein the serial number of one node is formed by sequencing the serial numbers of all the father nodes of the node at the respective depths according to the order from small to large of the depths, and the serial numbers of two of the father nodes are spaced via a preset symbol; all the nodes of the treelike structures are stored in a database by means of sequential storage; and data corresponding to all the nodes of the treelike structures are processed according to the serial numbers of the nodes.

Description

technical field [0001] The invention relates to the field of computer applications, in particular to a data processing method and system in a tree structure. Background technique [0002] In the development of various application systems based on relational databases, we often need to store tree-structured data, and many times we need to use multiple tree-structure models. Currently, there are many popular methods for a single tree structure, such as The adjacency list model (The Adjacency List Model), the left and right value coding method, etc., on this basis, many people have made corresponding improvements for different needs, but there are always various defects in some aspects, as follows The two storage methods are taken as examples for description. [0003] First of all, the adjacency list model (The Adjacency List Model) runs very slowly and has poor efficiency in most programming languages. This is mainly caused by "recursion", and the database must be accessed e...

AI Technical Summary

Problems solved by technology

However, after careful study, this method also has great disadvantages: because the encoding method of left and right values ​​is different from the intuitive sorting of common Arabic numerals, plus the hierarchy of nodes in the tree, the order cannot be displayed intuitively, but must be passed through simple After calculating the formula, it takes a certain amount of time to understand its mathematical model in depth

[0005] The above two methods are not for the storage of multiple tree structures, and the processing ability for multiple tree structures is quite limited

Images