WO2022127114A1 - Data storage method and apparatus, and storage medium and server - Google Patents

Abstract

A data storage method and apparatus, and a storage medium and a server. The data storage method comprises: acquiring path information of each piece of node data from tree structure data, wherein the path information is used for indicating a path from a root node of a tree structure to a node corresponding to current node data, and the tree structure is a structural relationship presented by the tree structure data (S301); and storing the path information of each piece of node data and corresponding node data in a database (S302).

Description

A data storage method, device, storage medium and server

This application claims the priority of the Chinese patent application with application number 202011502922.4 filed with the China Patent Office on December 18, 2020, the entire contents of which are incorporated herein by reference.

technical field

The embodiments of the present application relate to the technical field of data processing, for example, to a data storage method, device, storage medium, and server.

Background technique

In order to meet the processing requirements of multi-level relationship data, the definition of parent_code (parent code) is generally used in the database storing multi-level relationship data. When querying through Structured Query Language (SQL), Based on the self-association operation, the display from two-dimensional data to multi-dimensional data is realized, and then the mapping between database information and entity objects is realized through the Object Relational Mapping (ORM) framework, and finally the entity objects are displayed on the page through front-end technology.

When performing data query, recursive query is generally performed in the form of passing in the parent node code. For data with multi-level relationships, recursive query can be implemented in Oracle database according to the connect by function, while for other relational databases, Such as MySQL database, you need to design a recursive query program to query. However, with the continuous growth of the hierarchical relationship of tree-structured data, the time complexity and space complexity of the query are also increasing, and the operating efficiency is low. Therefore, how to store the multi-level relational data so as to restore the tree-structured data relation simply and quickly when reading the data becomes very important.

SUMMARY OF THE INVENTION

The embodiments of the present application provide a data storage method, device, storage medium, and server, which can increase the flexibility and scalability of tree-structured data storage.

In a first aspect, an embodiment of the present application provides a data storage method, including:

Obtain the path information of each node data in the tree structure data; wherein, the path information is used to indicate the path from the root node of the tree structure to the node corresponding to the current node data, and the tree structure is the tree structure The structural relationships presented by the data;

The path information of each node data and the corresponding node data are stored in the database.

In a second aspect, an embodiment of the present application further provides a data storage device, including:

A path information acquisition module, configured to acquire path information of each node data in the tree structure data; wherein, the path information is used to indicate the path from the root node of the tree structure to the node corresponding to the current node data, the tree structure The structure is the structural relationship presented by the tree structure data;

The storage module is configured to store the path information of each node data and the corresponding node data in the database.

In a third aspect, an embodiment of the present application provides a computer-readable storage medium on which a computer program is stored, and when the program is executed by a processor, implements the data storage method described in the first aspect of the present application.

In a fourth aspect, an embodiment of the present application provides a server, including:

at least one processor;

a memory, arranged to store at least one program;

When the at least one program is executed by the at least one processor, the at least one processor implements the data storage method according to the first aspect of the present application.

Description of drawings

1 is a schematic diagram of a storage structure of tree-structured data in the related art;

Fig. 2 is another kind of storage structure schematic diagram of multi-level relationship data in the related art;

3 is a schematic flowchart of a data storage method provided in Embodiment 1 of the present application;

4 is a schematic diagram of a tree structure presented by tree structure data provided in Embodiment 1 of the present application;

5 is a schematic diagram of a storage structure of tree-structured data provided in Embodiment 1 of the present application;

6 is a flowchart of a data storage method provided in Embodiment 2 of the present application;

7 is a schematic structural diagram of a data storage device according to Embodiment 3 of the present application;

FIG. 8 is a schematic structural diagram of a server according to Embodiment 5 of the present application.

Detailed ways

The present application will be described in detail below with reference to the accompanying drawings and embodiments.

Before discussing the exemplary embodiments in greater detail, it should be mentioned that some exemplary embodiments are described as processes or methods depicted as flowcharts. Although the flowchart depicts the steps as a sequential process, many of the steps may be performed in parallel, concurrently, or concurrently. Furthermore, the order of the steps can be rearranged. The process may be terminated when its operation is complete, but may also have additional steps not included in the figures. The processes may correspond to methods, functions, procedures, subroutines, subroutines, and the like.

FIG. 1 is a schematic diagram of a storage structure of tree-structured data in the related art. As shown in Figure 1, the storage structure of tree structure data (that is, multi-level association data) is mainly composed of three fields, node code (code), node name (name) and parent node code (parent_code). The data and the superior-subordinate relationship between the data are stored in the form of self-association in the table, and the data with multi-level association relationship is reduced to two-dimensional data for storage. When reading data, it is necessary to restore the data relationship. In the process of restoring the data relationship, based on the recursive operation logic, the tree-structured data can be completely restored and finally displayed on the client. For Oracle database, you can use special database functions, such as connect by function to implement recursive query, while for other relational databases, you need to use program nested loop to achieve recursion, however, with the continuous growth of tree-structured data hierarchy, query The time complexity and space complexity are also increasing, and the operating efficiency is low.

In the related art, in order to solve the technical problem that the time complexity and space complexity of the query will continue to increase, and the operation efficiency is low due to the continuous growth of the hierarchical relationship of the tree structure data when the recursive query is performed based on the coding form of the parent node, it is proposed. One solution is to define the level to which the data belongs in advance in the database, so that the level can be purposefully queried during the query process. FIG. 2 is a schematic diagram of another storage structure of tree-structured data in the related art. As shown in Figure 2, the level field is added to the storage structure of the tree structure data provided in Figure 1, and the level of the data is clearly planned, so that when reading the data, the level can be arbitrarily defined, and there is no need to traverse level by level. . However, this method also makes the data lose the feasibility of automatic expansion in a sense, and at the same time limits the program implementation method during the development process, which is not convenient for flexible expansion.

Example 1

3 is a schematic flowchart of a data storage method provided in Embodiment 1 of the present application. The method is applicable to a situation where a server stores data in a multi-level association relationship, and can be executed by a data storage device, wherein the device can be implemented by software and/or Hardware implementation, generally can be integrated in the server. As shown in Figure 3, the method includes:

S301. Obtain path information of each node data in the tree structure data; wherein, the path information is used to indicate the path from the root node of the tree structure to the node corresponding to the current node data, and the tree structure is the tree The structural relationship presented by the shape structure data.

In the embodiment of the present application, the tree-structured data is data with obvious upper-lower and multi-level associations, the tree-structured data includes several nodes and several node data, and each node corresponds to each node data. The tree structure is the structural relationship presented by the tree structure data. The tree structure contains multiple parent-child relationships, and multiple parent-child relationships form the tree structure, that is, there is a parent-child relationship between the node data in the tree structure data. .

The path information of each node data in the tree structure data includes the path from the root node of the tree structure to the node corresponding to the current node data, that is, the path from the root node of the tree structure to the node where the current node data is located. path. It can be understood that the path information of each node data includes the current node where the current node data is located and all its parent nodes, and the position of each node data in the entire tree structure can be represented by the path information. Exemplarily, FIG. 4 is a schematic diagram of a tree structure presented by the tree structure data provided in this embodiment of the present application. As shown in FIG. 4 , the path information of the node data at the node E in the tree structure is: starting from the node A, passing through the node B, and then passing through the node D, and finally reaching the node E. Optionally, the path information consists of a node code and a preset separator, the multiple node codes are separated by the preset separator, and the path information ends with the preset separator. As shown in Fig. 4, the codes of each node in the tree structure are represented by A, B, C, D, F, G, H, I, J and K, and the preset separator can be "-", and the node E The path information of the corresponding node data can be expressed as: "A-B-D-E-".

In this embodiment of the present application, the path information of each node data in the tree structure data is obtained, for example, the path information of each node data in the tree structure data input by the user is obtained. Exemplarily, tree structure data is obtained, a tree structure presented by the tree structure data is extracted from the tree structure data, and each node in the corresponding tree structure data is determined according to the tree structure. Path information for the data. Optionally, in response to the received correction information for the path information, the path information of the plurality of node data determined according to the tree structure is corrected. The advantage of this setting is that when the node data determined according to the tree structure is When the path information of the node is inaccurate or there is a deviation, the path information can be corrected according to the correction information input by the user, which helps to accurately read the corresponding node data according to the path information in the future.

S302. Store the path information of each node data and the corresponding node data in a database.

In the embodiment of the present application, the path information of each node data in the tree structure data and the corresponding node data are stored in the database to obtain the tree structure database. Exemplarily, the tree structure database not only stores the data of each node in the tree structure data, but also stores the path information associated with or corresponding to each node data. When data is read from the tree structure database. When taking time, the corresponding node data can be directly read based on the path information, and the tree structure presented by the multiple node data can be quickly restored based on the path information.

Optionally, after storing the path information of each node data and the corresponding node data in the database, the method further includes: receiving user adjustment information on the path information, and updating the database according to the adjustment information. of the path information. The advantage of this setting is that the position of the node data in the entire tree structure can be adjusted by adjusting the path information, that is, the tree structure presented by the tree structure data can be adjusted flexibly. Optionally, after storing the path information of each node data and the corresponding node data in the database, the method further includes: receiving extension information of the path information from the user, wherein the extension information includes the added information. target node; obtain target node data corresponding to the target node in the extended information; update the path information in the database based on the extended information and store the target node data in the database. The advantage of this setting is that the entire tree-structured data can be extended, which increases the flexibility and expansibility of tree-structured data storage.

In the data storage method provided by the embodiment of the present application, the path information of each node data in the tree structure data is obtained; wherein, the path information is used to indicate the path from the root node of the tree structure to the node corresponding to the current node data, so The tree structure is the structural relationship presented by the tree structure data; the path information of each node data and the corresponding node data are stored in the database. By adopting the above technical solution, not only can the recursive query based on the parent node coding form be solved, but the time complexity and space complexity of the query will continue to increase due to the continuous growth of the hierarchical relationship of the tree structure data, and the technical problem of low operation efficiency will be solved. It also increases the flexibility and scalability of tree-structured data storage, and facilitates simple and fast restoration of tree-structured data relationships when reading data.

In some embodiments, before storing the path information of each node data and the corresponding node data in the database, the method further includes: acquiring the node code and node name of the node corresponding to each node data; Describe the corresponding relationship table of node code, node name and path information; store the path information of each node data and the corresponding node data in the database, including: the corresponding relationship between the node code, node name and path information Tables and corresponding node data are stored in the database. Exemplarily, the node code and node name of the node corresponding to each node data are obtained, that is, the node code and node name of each node in the tree structure are obtained, wherein the node code and node name can uniquely characterize the tree structure. of each node. Optionally, the node code and node name of the node corresponding to each node data can be determined according to the information input by the user, or the node code of each node in the tree structure can be determined according to the preset coding rules and naming rules. and node name. A correspondence table of node codes, node names, and path information of node data corresponding to each node is constructed. Exemplarily, a correspondence table of node codes, node names, and path information of multiple nodes in the tree structure in FIG. 4 As shown in the table below:

Node code (code)	Node name (name)	Path information (path)
A	Node A	A-
B	NodeB	A-B-
C	Node C	A-B-C-
D	Node D	A-B-D-
E	Node E	A-B-D-E-
F	Node F	A-B-F-
G	Node G	A-G-
H	Node H	A-G-H-
I	Node I	A-G-H-I-
J	Node J	A-J-
K	Node K	A-J-K-

The corresponding relationship table of node code, node name and path information and the corresponding node data are stored in the database. It can be understood that the node code, node name, path information and corresponding node data are stored in the database in the form of a library table. middle. FIG. 5 is a schematic diagram of a storage structure of tree-structured data provided by an embodiment of the present application. As shown in Figure 5, the storage structure of the tree structure is mainly composed of three fields, node code (code), node name (name) and path information (path). In the process of reading data, it can be determined according to the path information. The superior and inferior relationship of each node data.

In some embodiments, after storing the path information of each node data and the corresponding node data in the database, the method further includes: acquiring a data query request input by a user; wherein the data query request includes a target node path; traverse the path information of multiple node data in the database, and obtain the target path information matching the target node path in the data query request; read the node corresponding to the target path information from the database data.

Exemplarily, a data query request input by a user is obtained, wherein the data query request may include a target node path, and it can be understood that the target node path is the keyword information to be queried. For example, the data query request input by the user can be an SQL statement, for example, the data query request can be "path like 'A-%'", that is, the user wants to query the corresponding nodes of all levels under the A node through the above data query request The node data does not need to implement data query with the help of recursive algorithm. Another example, the data query request can also be "path like 'A-%-%-'", that is, if the user wants to query the node data corresponding to all the sub-nodes of the compartment under the A node through the above data query request, there is no need to. Specify the level to which each node data belongs. Traverse the path information of multiple node data in the database, and obtain the target path information matching the target node path in the data query request based on the fuzzy matching principle. For example, in the correspondence table of node codes, node names and path information of multiple nodes in the tree structure in FIG. 4, the target path information matching the data query request "path like 'A-%'" is: A-B- , A-B-C-, A-B-D-, A-B-D-E-, A-B-F-, A-G-, A-G-H-, A-G-H-I-, A-J- and A-J-K-; the target path information matching the data query request "path like 'A-%-%-'" is : A-B-C-, A-B-D-, A-B-D-E-, A-B-F-, A-G-H-, A-G-H-I- and A-J-K-. Read the node data corresponding to the target path information from the database. For example, if the target path information is: A-B-C-, A-B-D-, A-B-D-E-, A-B-F-, A-G-H-, A-G-H-I- and A-J-K-, then read the nodes from the database respectively Node data at C, node data at node D, node data at node E, node data at node F, node data at node H, node data at node I, and node data at node K.

Optionally, after reading the node data corresponding to the target path information from the database, the method further includes: restoring the read node data into tree structure data based on the target path information, that is, based on the target path information. The read multiple node data is placed in the corresponding node positions of the tree structure to restore the tree structure data.

Embodiment 2

FIG. 6 is a flowchart of a data storage method provided in Embodiment 2 of the present application. As shown in FIG. 6 , the method includes the following steps:

S601. Obtain the path information of each node data in the tree structure data; wherein, the path information is used to indicate the path from the root node of the tree structure to the node corresponding to the current node data, and the tree structure is presented by the tree structure data. structural relationship.

Optionally, the path information consists of a node code and a preset separator, the multiple node codes are separated by the preset separator, and the path information ends with the preset separator.

S602. Obtain the node code and node name of the node corresponding to each node data.

S603. Build a correspondence table of node codes, node names, and path information.

S604. Store the corresponding relationship table of the node code, the node name and the path information and the corresponding node data in the database.

S605. Obtain the data query request input by the user, wherein the data query request includes the target node path.

S606. Traverse the path information of multiple node data in the database, and obtain target path information that matches the target node path in the data query request.

S607: Read node data corresponding to the target path information from the database.

The data storage method provided by the embodiment of the present application not only solves the problem that when recursive query is performed based on the coding form of the parent node, due to the continuous growth of the hierarchical relationship of tree-structured data, the time complexity and space complexity of the query will continue to increase, and the running efficiency will be biased. It also reduces the technical problems and increases the flexibility and scalability of tree-structured data storage, and facilitates simple and fast restoration of tree-structured data relationships when data is read.

Embodiment 3

FIG. 7 is a schematic structural diagram of a data storage device according to Embodiment 3 of the present application. As shown in FIG. 7 , the apparatus includes: a path information acquisition module 701 and a storage module 702, wherein:

The path information obtaining module 701 is configured to obtain the path information of each node data in the tree structure data; wherein, the path information is used to indicate the path from the root node of the tree structure to the node corresponding to the current node data, the tree The shape structure is the structural relationship presented by the tree structure data;

The storage module 702 is configured to store the path information of each node data and the corresponding node data in the database.

The data storage device provided by the embodiment of the present application acquires the path information of each node data in the tree structure data; wherein, the path information is used to indicate the path from the root node of the tree structure to the node corresponding to the current node data, so The tree structure is the structural relationship presented by the tree structure data; the path information of each node data and the corresponding node data are stored in the database. By adopting the above technical solution, not only can the recursive query based on the parent node coding form be solved, but the time complexity and space complexity of the query will continue to increase due to the continuous growth of the hierarchical relationship of the tree structure data, and the technical problem of low operation efficiency will be solved. It also increases the flexibility and scalability of tree-structured data storage, and facilitates simple and fast restoration of tree-structured data relationships when reading data.

Optionally, the path information consists of a node code and a preset separator, the multiple node codes are separated by the preset separator, and the path information ends with the preset separator.

Optionally, the device further includes:

A node information obtaining module, configured to obtain the node code and node name of the node corresponding to each node data before storing the path information of each node data and the corresponding node data in the database;

A corresponding relationship building module, configured to construct a corresponding relationship table of the node code, node name and path information;

The storage module is set to:

The corresponding relationship table of the node code, the node name and the path information and the corresponding node data are stored in the database.

Optionally, the device further includes:

The query request obtaining module is configured to obtain the data query request input by the user after the path information of each node data and the corresponding node data are stored in the database; wherein, the data query request includes the target node path;

a target path obtaining module, configured to traverse the path information of a plurality of node data in the database, and obtain target path information matching the target node path in the query request;

The node data reading module is configured to read the node data corresponding to the target path information from the database.

Embodiment 4

The fourth embodiment of the present application provides a storage medium containing computer-executable instructions, where the computer-executable instructions, when executed by a computer processor, implement the data storage method provided by any embodiment of the present application.

storage medium - any of various types of memory devices or storage devices. The term "storage medium" is intended to include: installation media, such as Compact Disc Read-Only Memory (CD-ROM), floppy disks, or tape devices; computer system memory or random access memory, such as dynamic random access memory ( Dynamic Random Access Memory, DRAM), Double Data Rate Random Access Memory (DDRRAM), Static Random Access Memory (Static Random Access Memory, SRAM), Extended Data Output RAM (Extended Data Output RAM, EDORAM), Rambus RAM, etc.; non-volatile memory, such as flash memory, magnetic media (eg, hard disk or optical storage); registers or other similar types of memory elements, and the like. The storage medium may also include other types of memory or combinations thereof. In addition, the storage medium may be located in the first computer system in which the program is executed, or may be located in a second, different computer system connected to the first computer system through a network such as the Internet. The second computer system may provide program instructions to the first computer for execution. The term "storage media" may include at least two storage media that may reside in different locations (eg, in different computer systems connected by a network). The storage medium may store program instructions (eg, a computer program) executable by at least one processor.

An embodiment of the present application provides a storage medium containing computer-executable instructions, and the computer-executable instructions of the storage medium can execute the data storage method provided by any embodiment of the present application.

Embodiment 5

FIG. 8 is a schematic structural diagram of a server according to Embodiment 5 of the present application. The server shown in FIG. 8 is only an example, and should not impose any limitations on the functions and scope of use of the embodiments of the present application. As shown in FIG. 8 , the server provided in Embodiment 5 of the present application includes a processor 81, a memory 82, an input device 83, and an output device 84; the number of processors 81 in the server may be at least one, and in FIG. 8, one processor is used Take 81 as an example; the processor 81, the memory 82, the input device 83, and the output device 84 in the server may be connected through a bus or other means, and FIG. 8 takes the connection through a bus as an example.

As a computer-readable storage medium, the memory 82 may be configured to store software programs, computer-executable programs, and modules, such as program instructions/modules corresponding to the data storage method in the embodiments of the present application (for example, a path in a data storage device). information acquisition module 701 and storage module 702). The processor 81 executes various functional applications and file processing by running the software programs, instructions, and modules stored in the memory 82, for example, implementing the data storage method applied to the server provided by the embodiments of the present application.

The memory 82 may mainly include a stored program area and a stored data area, wherein the stored program area may store an operating system, an application program required for at least one function; the stored data area may store data created according to the use of the server, and the like. Additionally, memory 82 may include high speed random access memory, and may also include nonvolatile memory, such as at least one magnetic disk storage device, flash memory device, or other nonvolatile solid state storage device. In some examples, memory 82 may include memory located remotely from processor 81, which may be connected to a server through a network. Examples of such networks include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

The input device 83 may be configured to receive numerical or character information input by the user to generate key signal input related to user setting and function control of the server. The output device 84 may include a display device such as a display screen.

The data storage device, storage medium, and server provided in the above embodiments can execute the data storage method provided by the embodiment of the present application, and have corresponding functional modules for executing the method. For technical details not described in detail in the foregoing embodiments, reference may be made to the data storage method provided by any embodiment of the present application.

Claims (10)

1. A data storage method comprising:

   Obtain the path information of each node data in the tree structure data; wherein, the path information is used to indicate the path from the root node of the tree structure to the node corresponding to the current node data, and the tree structure is the tree structure The structural relationships presented by the data;

   The path information of each node data and the corresponding node data are stored in the database.
2. The method according to claim 1, wherein the path information is composed of a node code and a preset separator, a plurality of node codes are separated by the preset separator, and the path information is separated by the preset separator end of character.
3. The method according to claim 1, before storing the path information of each node data and the corresponding node data in the database, further comprising:

   Obtain the node code and node name of the node corresponding to each node data;

   constructing the corresponding relationship table of the node code, node name and path information;

   Store the path information of each node data and the corresponding node data in the database, including:

   The corresponding relationship table of the node code, the node name and the path information and the corresponding node data are stored in the database.
4. The method according to any one of claims 1-3, after storing the path information of each node data and the corresponding node data in the database, further comprising:

   Obtain the data query request input by the user; wherein, the data query request includes the target node path;

   Traverse the path information of multiple node data in the database, and obtain target path information matching the target node path in the data query request;

   The node data corresponding to the target path information is read from the database.
5. A data storage device, comprising:

   A path information acquisition module, configured to acquire path information of each node data in the tree structure data; wherein, the path information is used to indicate the path from the root node of the tree structure to the node corresponding to the current node data, the tree structure The structure is the structural relationship presented by the tree structure data;

   The storage module is configured to store the path information of each node data and the corresponding node data in the database.
6. The device according to claim 5, wherein the path information is composed of a node code and a preset separator, a plurality of node codes are separated by the preset separator, and the path information is separated by the preset separator end of character.
7. The apparatus of claim 5, further comprising:

   A node information obtaining module, configured to obtain the node code and node name of the node corresponding to each node data before storing the path information of each node data and the corresponding node data in the database;

   A corresponding relationship building module, configured to construct a corresponding relationship table of the node code, node name and path information;

   The storage module is configured to: store the corresponding relationship table of the node code, the node name and the path information and the corresponding node data in the database.
8. The device according to any one of claims 5-7, further comprising:

   The query request obtaining module is configured to obtain the data query request input by the user after the path information of each node data and the corresponding node data are stored in the database; wherein, the data query request includes the target node path;

   a target path obtaining module, configured to traverse the path information of a plurality of node data in the database, and obtain target path information matching the target node path in the query request;

   The node data reading module is configured to read the node data corresponding to the target path information from the database.
9. A computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, implements the data storage method according to any one of claims 1-4.
10. A server that includes:

    at least one processor;

    a memory, arranged to store at least one program;

    When the at least one program is executed by the at least one processor, the at least one processor implements the data storage method according to any one of claims 1-4.

Images