Dynamic database design method and system of tree structure

Abstract

The invention relates to the field of databases, and discloses a dynamic database design method and system of a tree structure. The design method comprises the steps of establishing data nodes and setting a data structure; establishing an inspection node, and setting a logic rule; establishing tree-shaped association between the data nodes and the inspection nodes, and constructing a tree-shaped structure; and when the data of the data nodes changes, performing data processing by the associated check nodes, and dynamically updating the data by the associated data nodes. Data consistency and correctness are guaranteed through data dynamic updating, secondary calculation and redundant data reading and writing of upper-layer applications are greatly reduced, and the system development amount,complexity and database reading and writing loads are greatly reduced. The system comprises a data node, a check node, a transmission channel and a configuration module. The database system can directly store and process the data of the tree structure, does not need to establish a plurality of tables and a mutual tree structure relation table by using a general database, and has the characteristics of wide application range, quick design implementation, low development cost and the like.

Description

technical field [0001] The invention relates to the field of databases, in particular to a tree-structured dynamic database design method and system. Background technique [0002] In daily life and work, tree-like data with hierarchical relationships has been widely used, such as structured data for library management, structured data for organizational management, etc. The hierarchical relationship is usually represented by a tree structure, where each node represents a piece of data, and the lines represent the relationship between data. In database system design, tree structure is an important form of information, and all prototypes with hierarchical relationships can be described by trees. [0003] At present, the databases that provide data storage services for companies are usually relational databases, and the way of storing data is tables. In order to record tree-structured data in relational databases, foreign key fields are usually added to tables. However, this...

AI Technical Summary

Problems solved by technology

[0004] At the same time, as the functions of upper-layer applications continue to expand, the number of read and write operations on the database is also increasing. While implementing functions, the upper-layer applications also need to calculate the data in the database, which not only increases the work of upper-layer application development Frequent data read and write operations also take up a lot of resources in the database

[0005] In view of the fact that relational databases cannot well meet the needs of recording and processing tree-structured data, there is an urgent need for a system that can not only record tree-structured data well, but also meet the characteristics of wide application range, fast design and implementation, and low development cost. dynamic database

Images