Data storage method and device, computer equipment and computer readable storage medium

Abstract

The invention relates to a data storage method and device, computer equipment and a computer readable storage medium. The method comprises the following steps: firstly, acquiring current application environment information, user demand information and to-be-stored data information by a data middle platform, generating corresponding configuration information according to the current application environment information and the user demand information, constructing a corresponding storage directory tree based on the configuration information, and storing the to-be-stored data information in the storage directory tree; and finally, storing the to-be-stored data information into the corresponding data storage nodes according to the data warehouse elements and the data indexes of the to-be-stored data information. According to the method, the adaptive storage directory tree is reconstructed according to the current scene instead of a storage directory tree in a fixed form, so that the mounting relationship between each data bin element and the data index is more adaptive to the current application scene, the data storage effect is better, the storage directory of a fixed architecture does not need to be modified by hard coding, and the data storage efficiency is improved. And the data storage cost is reduced.

Description

Technical Field

[0001] The present application relates to the field of data management and data middle platform technology, and in particular to a data storage method, apparatus, computer equipment, computer-readable storage medium and computer program product. Background Art

[0002] In the general trend of enterprise informatization and digital transformation, with the massive growth of data volume and the increasing complexity of business needs, traditional data management and analysis methods have gradually revealed their limitations. As an emerging data management and analysis architecture, the data middle platform builds a unified, standardized, efficient and secure data management system to store data. Data indicator construction is a key technology of the data middle platform, which involves data standardization, normalization and indicator management and use.

[0003] The indicators in data indicator construction are closely related to data warehouse elements (business classification, data domain, business process, data mart, and analysis theme).

[0004] However, current data storage methods have the problem of poor storage effect. Summary of the invention

[0005] Based on this, it is necessary to provide a data storage method, device, computer equipment, computer-readable storage medium and computer program product that can improve storage effects in response to the above technical problems.

[0006] In a first aspect, the present application provides a data storage method, using a data middle platform, including:

[0007] Obtain current application environment information, user demand information, and data information to be stored, and generate corresponding configuration information according to the current application environment information and user demand information; the configuration information includes data warehouse elements, first mounting relationships between data warehouse elements, second mounting relationships between data indicators and data warehouse elements, and the number of display layers;

[0008] Based on the data warehouse elements, data indicators, the first mounting relationship, the second mounting relationship and the number of display layers, a corresponding storage directory tree is constructed;

[0009] According to the data warehouse elements and data indicators of the data information to be stored, the data information to be stored is stored in the corresponding data storage node.

[0010] In one embodiment, the method further comprises:

[0011] According to the preset tile tree data information acquisition rules and any current data storage node, the number of data indicators mounted on the current data storage node is obtained and displayed; the number of data indicators includes a first number of data indicators and a second number of data indicators, the first number of data indicators is the number of data indicators mounted on the current data storage node, and the second number of data indicators is the number of data indicators of the data storage sub-nodes mounted on the current data storage node.

[0012] In one embodiment, according to a preset tile tree data information acquisition rule and any current data storage node, the number of data indicators mounted on the current data storage node is acquired and displayed, including:

[0013] Get the current data warehouse element and current level information corresponding to the current data storage node;

[0014] Based on the flat tree data information acquisition rules, the current data warehouse elements and the current level information, the node flat tree data information of the current data storage node is obtained;

[0015] According to the node tile tree data information, search for the target data indicator tile tree data information from the pre-built data indicator tile tree data information list; the target data indicator tile tree data information is information with the node tile tree data information as a prefix;

[0016] The number of target data indicator flat tree data information is determined as the number of data indicators mounted on the current data storage node and displayed.

[0017] In one embodiment, the current level information includes current layer information and current level information;

[0018] Based on the flat tree data information acquisition rules, the current data warehouse elements and the current level information, the node flat tree data information of the current data storage node is obtained, including:

[0019] According to the flat tree data information acquisition rule, the current data warehouse element, the current layer information and the current level information are symbolized to obtain the symbolized current data warehouse element, the symbolized current layer information and the symbolized current level information;

[0020] Connect the symbolized current data warehouse element and the data ID corresponding to the current data warehouse element through a preset connection symbol to obtain the identifier information of the current data warehouse element;

[0021] According to the identifier information, the symbolized current layer information and the symbolized current level information, the node flat tree data information of the current data storage node is obtained.

[0022] In one embodiment, the data indicator tile tree data information list is constructed by the following steps:

[0023] Obtain the mount type information, mount type name information, mounted data storage nodes, and data warehouse elements and level information corresponding to each mounted data storage node for each data indicator;

[0024] Based on the flat tree data information acquisition rules, mount type information, mount type name information, data warehouse elements and level information, the data indicator flat tree data information of each data indicator is obtained;

[0025] According to the data information of each data indicator tile tree, a data indicator tile tree data information list is constructed.

[0026] In an exemplary embodiment, the method further comprises:

[0027] According to the flat tree data information acquisition rule, the data warehouse elements and level information corresponding to each current data storage node, the first prefix information of each data storage node is acquired; the first prefix information is other flat tree data information before the flat tree data information corresponding to the currently mounted data warehouse element;

[0028] If it is detected that the user demand information has changed, the second prefix information of each data storage node is obtained based on the flat tree data information acquisition rule, the latest data warehouse element corresponding to each data storage node, and the hierarchical information; the second prefix information is other flat tree data information before the flat tree data information corresponding to the latest data warehouse element currently mounted;

[0029] When the first prefix information is the same as the second prefix information, the data warehouse element currently mounted on each data storage node is updated to the latest data warehouse element;

[0030] If the first prefix information is different from the second prefix information, the data warehouse elements currently mounted on each data storage node are updated to the latest data warehouse elements, and the data indicator tile tree data information corresponding to each data indicator is updated according to the first prefix information, the second prefix information and the latest data warehouse elements.

[0031] In one embodiment, updating data indicator tile tree data information corresponding to each data indicator according to the first prefix information, the second prefix information and the latest data warehouse element includes:

[0032] According to the tile tree data information acquisition rule, the latest data warehouse elements are symbolized to obtain the symbolized latest data warehouse elements;

[0033] The symbolized latest data warehouse element and the data ID corresponding to the latest data warehouse element are connected through a preset connection symbol to obtain the identifier information of the latest data warehouse element;

[0034] Using the symbolized hierarchical information, connecting the first prefix information and the identifier information to obtain the data indicator flat tree prefix information;

[0035] Based on the data indicator tile tree prefix information, searching for the data indicator tile tree data information to be updated from the data indicator tile tree data information list;

[0036] The first prefix information included in the data pointer tile tree data information to be updated is updated to the second prefix information.

[0037] In a second aspect, the present application also provides a data storage device, which is applied to a data middle station, including:

[0038] A configuration information generation module is used to obtain current application environment information, user demand information, and data information to be stored, and generate corresponding configuration information according to the current application environment information and user demand information; the configuration information includes data warehouse elements, the first mounting relationship between data warehouse elements, the second mounting relationship between data indicators and data warehouse elements, and the number of display layers;

[0039] The directory tree construction module is used to construct the corresponding storage directory tree based on the data warehouse elements, data indicators, the first mounting relationship, the second mounting relationship and the number of display layers;

[0040] The data storage module is used to store the data information to be stored into the corresponding data storage node according to the data warehouse elements and data indicators of the data information to be stored.

[0041] In a third aspect, the present application further provides a computer device, including a memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, the following steps are implemented:

[0042] Obtain current application environment information, user demand information, and data information to be stored, and generate corresponding configuration information according to the current application environment information and user demand information; the configuration information includes data warehouse elements, first mounting relationships between data warehouse elements, second mounting relationships between data indicators and data warehouse elements, and the number of display layers;

[0043] Based on the data warehouse elements, data indicators, the first mounting relationship, the second mounting relationship and the number of display layers, a corresponding storage directory tree is constructed;

[0044] According to the data warehouse elements and data indicators of the data information to be stored, the data information to be stored is stored in the corresponding data storage node.

[0045] In a fourth aspect, the present application further provides a computer-readable storage medium having a computer program stored thereon, and when the computer program is executed by a processor, the following steps are implemented:

[0046] Obtain current application environment information, user demand information, and data to be stored, and generate corresponding configuration information according to the current application environment information and user demand information; the configuration information includes data warehouse elements, first mounting relationships between data warehouse elements, second mounting relationships between data indicators and data warehouse elements, and the number of display layers;

[0047] Based on the data warehouse elements, data indicators, the first mounting relationship, the second mounting relationship and the number of display layers, a corresponding storage directory tree is constructed;

[0048] According to the data warehouse elements and data indicators of the data information to be stored, the data information to be stored is stored in the corresponding data storage node.

[0049] In a fifth aspect, the present application further provides a computer program product, including a computer program, which implements the following steps when executed by a processor:

[0050] Obtain current application environment information, user demand information, and data to be stored, and generate corresponding configuration information according to the current application environment information and user demand information; the configuration information includes data warehouse elements, first mounting relationships between data warehouse elements, second mounting relationships between data indicators and data warehouse elements, and the number of display layers;

[0051] Based on the data warehouse elements, data indicators, the first mounting relationship, the second mounting relationship and the number of display layers, a corresponding storage directory tree is constructed;

[0052] According to the data warehouse elements and data indicators of the data information to be stored, the data information to be stored is stored in the corresponding data storage node.

[0053] In the above data storage method, device, computer equipment, computer-readable storage medium and computer program product, the data middle station first obtains the current application environment information, user demand information and data information to be stored, and generates corresponding configuration information according to the current application environment information and user demand information, the configuration information includes data warehouse elements, the first mounting relationship between data warehouse elements, the second mounting relationship between data indicators and data warehouse elements and the number of display layers, and then constructs a corresponding storage directory tree based on the data warehouse elements, data indicators, the first mounting relationship, the second mounting relationship and the number of display layers, and finally stores the data information to be stored in the corresponding data storage node according to the data warehouse elements and data indicators of the data information to be stored. By generating adaptive configuration information according to the current application environment information and user demand information, configuring the corresponding storage directory tree according to the configuration information, storing the data warehouse elements and data indicators of the data information to be stored in the corresponding data storage node, and reconstructing the adaptive storage directory tree according to the current scene instead of using a fixed form of storage directory tree, the mounting relationship between each data warehouse element and data indicator is more adapted to the current application scene, so that the data storage effect is better, and there is no need to hard-code and modify the directory tree of the fixed architecture, which reduces the cost of data storage. BRIEF DESCRIPTION OF THE DRAWINGS

[0054] In order to more clearly illustrate the technical solutions in the embodiments of the present application or related technologies, the drawings required for use in the embodiments of the present application or related technical descriptions will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without paying creative work.

[0055] FIG1 is an application environment diagram of a data storage method in one embodiment;

[0056] FIG2 is a schematic diagram of a flow chart of a data storage method in one embodiment;

[0057] FIG3 is a schematic diagram of the hierarchical relationship of data warehouse elements in one embodiment;

[0058] FIG4 is a schematic diagram of an atomic indicator-business classification process management directory tree in another embodiment;

[0059] FIG5 is a schematic diagram of a derived indicator-analysis subject directory tree management derived indicator in one embodiment;

[0060] FIG6 is a schematic diagram of derived index-data mart directory tree management derived index in another embodiment;

[0061] FIG7 is a schematic diagram of a flat tree structure in a directory tree and table storage in one embodiment;

[0062] FIG8 is a block diagram of a data storage device in one embodiment;

[0063] FIG. 9 is a diagram showing the internal structure of a computer device in one embodiment. DETAILED DESCRIPTION

[0064] In order to make the purpose, technical solution and advantages of the present application more clearly understood, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

[0065] The data storage method provided in the embodiment of the present application can be applied to the application environment shown in FIG. 1. Among them, the terminal 102 communicates with the data middle station 104 through the network. The data storage system can store the data that the data middle station 104 needs to process. The data storage system can be integrated on the data middle station 104, or it can be placed on the cloud or other network servers. The data middle station 104 obtains the current application environment information, user demand information and data information to be stored of the terminal 102, and generates data warehouse elements, the first mounting relationship between data warehouse elements, the second mounting relationship between data indicators and data warehouse elements, and the number of display layers according to the current application environment information and user demand information, and further constructs a corresponding storage directory tree based on the data warehouse elements, data indicators, the first mounting relationship, the second mounting relationship and the number of display layers, and finally stores the data information to be stored in the corresponding data storage node according to the data warehouse elements and data indicators of the data information to be stored. Among them, the terminal 102 can be, but is not limited to, various personal computers, laptops, smart phones, tablet computers, Internet of Things devices and portable wearable devices, and the Internet of Things devices can be smart speakers, smart TVs, smart air conditioners, smart car devices, projection devices, etc. Portable wearable devices may be smart watches, smart bracelets, head-mounted devices, etc. Head-mounted devices may be virtual reality (VR) devices, augmented reality (AR) devices, smart glasses, etc. The data middle platform 104 may be a data management architecture, and a server cluster or distributed system composed of multiple physical servers provides the underlying computing logic for it.

[0066] In an exemplary embodiment, as shown in FIG2 , a data storage method is provided, which is described by taking the method applied to the data middle station 104 in FIG1 as an example, and includes the following steps S201 to S203. Among them:

[0067] Step S201, obtain the current application environment information, user demand information and data information to be stored, and generate corresponding configuration information according to the current application environment information and user demand information; the configuration information includes data warehouse elements, the first mounting relationship between data warehouse elements, the second mounting relationship between data indicators and data warehouse elements, and the number of display layers.

[0068] Among them, data warehouse elements can be understood as the business field, business subject, business process and other information related to the nature of the data described by the data stored in the database. The first mounting relationship can be understood as the movement and transformation relationship between data warehouse elements, that is, the hierarchical relationship between data warehouse elements. The second mounting relationship can be understood as which data warehouse element the data indicator belongs to.

[0069] Optionally, the data middle platform 104 obtains the current application environment information, user demand information and data information to be stored of the terminal through the network, and generates corresponding data warehouse elements, the first mounting relationship between data warehouse elements, the second mounting relationship between data indicators and data warehouse elements, and the number of display layers according to the current environment information and user demand information. Each time data storage is required, the data middle platform does not directly use the previously generated storage directory tree for storage, but re-acquires the current application environment information and user demand information to generate new configuration information, avoiding hard coding of the directory tree with a fixed architecture, thereby reducing the operational complexity of data storage, and at the same time laying a data foundation for the subsequent construction of the corresponding storage directory tree.

[0070] Step S202, constructing a corresponding storage directory tree based on the data warehouse elements, data indicators, the first mounting relationship, the second mounting relationship and the number of display layers.

[0071] The storage directory tree can be understood as a tree structure for storing and managing data, which has a hierarchical structure and makes data storage clearer.

[0072] For example, the data middle station 104 first determines the hierarchical relationship of the data warehouse elements according to the first mounting relationship, and uses the hierarchical relationship between the data warehouse elements to build the basic framework of the storage directory tree, and further uses the second mounting relationship to mount the data indicators under the corresponding data storage node to obtain the constructed storage directory tree, and finally uses the display layer number to obtain the final storage directory tree. Through the hierarchical relationship and clear directory tree structure, the storage and management of data are optimized. Secondly, the indicators are mounted to specific nodes to ensure that users can quickly access the required data. The clear architecture facilitates the addition of new data warehouse elements and data indicators in the future.

[0073] Step S203, according to the data warehouse elements and data indicators of the data information to be stored, the data information to be stored is stored in the corresponding data storage node.

[0074] Among them, the target data storage node can be understood as a node with the same data warehouse element as the data information to be stored.

[0075] Optionally, the data station 104 first searches for the corresponding data storage node from the storage directory tree according to the data warehouse element of the data information to be stored, and then stores the data information to be stored under the mount data indicator corresponding to the above data storage node according to the data indicator of the data information to be stored. Mapping the data information to be stored to clear storage nodes and data indicators makes data access and reference simple, and the required information can be quickly located later, which improves the extraction speed of data extraction and enhances the user's service experience.

[0076] In the above data storage method, the data center first obtains the current application environment information, user demand information and data information to be stored, and generates corresponding configuration information according to the current application environment information and user demand information, the configuration information includes data warehouse elements, the first mounting relationship between data warehouse elements, the second mounting relationship between data indicators and data warehouse elements, and the number of display layers, and then based on the data warehouse elements, data indicators, the first mounting relationship, the second mounting relationship and the number of display layers, the corresponding storage directory tree is constructed, and finally, according to the data warehouse elements and data indicators of the data information to be stored, the data information to be stored is stored in the corresponding data storage node. By generating adaptive configuration information according to the current application environment information and user demand information, configuring the corresponding storage directory tree according to the configuration information, storing the data warehouse elements and data indicators of the data information to be stored in the corresponding data storage node, and reconstructing the adaptive storage directory tree according to the current scenario instead of using a fixed form of storage directory tree, the mounting relationship between each data warehouse element and data indicator is more adapted to the current application scenario, so that the data storage effect is better, and there is no need to hard-code and modify the directory tree of the fixed architecture, which reduces the cost of data storage.

[0077] In one embodiment, the method also includes: according to the pre-set tile tree data information acquisition rules and any current data storage node, obtaining and displaying the number of data indicators mounted on the current data storage node; the number of data indicators includes a first number of data indicators and a second number of data indicators, the first number of data indicators is the number of data indicators mounted under the current data storage node, and the second number of data indicators is the number of data indicators of the data storage sub-nodes mounted on the current data storage node.

[0078] Among them, the flat tree data information acquisition rules can be understood as the rules that specify how to symbolize the hierarchical relationships between data warehouse elements; the number of data indicators can be understood as the number of data indicators mounted by the current data storage node itself and the sum of the number of data indicators mounted by the child nodes of the current data storage node.

[0079] For example, the data middle station 104 obtains the node flat tree data information corresponding to any current data storage node according to the preset flat tree data information acquisition rules, and uses the node flat tree data information as a prefix to search in the pre-built data indicator flat tree data information list, counts the number of searched data indicators, and displays them under the corresponding data storage node. The flat tree data information is introduced to help query the number of indicators mounted on the current data storage node and display them, so as to improve the data display effect of the storage directory tree and enable users to know the storage location of related data more intuitively.

[0080] In one embodiment, according to a preset tile tree data information acquisition rule and any current data storage node, the number of data indicators mounted on the current data storage node is acquired and displayed, including:

[0081] Get the current data warehouse elements and current level information corresponding to the current data storage node; based on the flat tree data information acquisition rules, the current data warehouse elements and the current level information, get the node flat tree data information of the current data storage node; search for the target data indicator flat tree data information from the pre-built data indicator flat tree data information list according to the node flat tree data information; the target data indicator flat tree data information is information with the node flat tree data information as a prefix; determine the number of target data indicator flat tree data information as the number of data indicators mounted on the current data storage node and display it.

[0082] Among them, the target data indicator tile tree data information can be understood as the tile tree data information with the node tile tree data information corresponding to the current data storage node as the prefix information; the data indicator tile tree data information list can be understood as a list of tile tree data information corresponding to all data indicators mounted by the current storage directory tree.

[0083] Optionally, the data middle station 104 obtains the current data warehouse element and current level information corresponding to the current data storage node, and then obtains the node flat tree data information corresponding to the current data storage node based on the flat tree data information acquisition rule, the current data warehouse element and the current level information, and then searches for the target data indicator flat tree data information with the node flat tree data information as the prefix information from the pre-built data indicator flat tree data information list according to the node flat tree data information, and finally counts the number of the searched target data indicator flat tree data information, determines this number as the number of data indicators mounted by the current data storage node and displays it. Introducing the flat tree structure in the storage directory tree, and using the flat tree data information corresponding to each element to count and display the number of data indicators mounted by the data storage node, reduces the errors that may be caused by human statistics, improves the display effect of the data, and enhances the availability of the storage directory tree, which can effectively avoid the situation where a certain node is overloaded with storage, and ensures the security of the stored data.

[0084] In an exemplary embodiment, the current level information includes current layer information and current level information;

[0085] Based on the flat tree data information acquisition rules, the current data warehouse elements and the current level information, the node flat tree data information of the current data storage node is obtained, including:

[0086] According to the flat tree data information acquisition rules, the current data warehouse element, the current hierarchy information and the current level information are symbolized to obtain the symbolized current data warehouse element, the symbolized current hierarchy information and the symbolized current level information; through the pre-set connection symbol, the symbolized current data warehouse element and the data ID corresponding to the current data warehouse element are connected to obtain the identifier information of the current data warehouse element; according to the identifier information, the symbolized current hierarchy information and the symbolized current level information, the node flat tree data information of the current data storage node is obtained.

[0087] Among them, the current hierarchical information can be understood as the position of the current data storage node in the storage directory tree, emphasizing the hierarchical relationship between data storage nodes. The current level information can be understood as the horizontal positioning or classification at the same level; data ID (Identification) can be understood as the digital information corresponding to the data warehouse elements.

[0088] For example, the data middle station 104 symbolizes the current data warehouse element, the current level information and the current level information according to the flat tree data information acquisition rules to obtain the symbolized current data warehouse element, the symbolized current level information and the symbolized current level information, and then connects the symbolized current data warehouse element and the data ID corresponding to the current data warehouse element through a preset connection symbol such as @ to obtain the unique identifier information of the current data warehouse element in this storage directory tree, and finally obtains the node flat tree data information of the current data storage node according to the identifier information, the symbolized current level information and the symbolized current level information. The node flat tree data information corresponding to the data storage node will not be stored or reflected in the storage directory tree, but will be calculated according to the preset rules and nodes when the relevant node flat tree data information is needed. The storage space of the storage directory tree is saved through the aforementioned real-time acquisition method, and the credibility and timeliness of the node flat tree data information obtained are also guaranteed.

[0089] In one embodiment, a data indicator flat tree data information list is constructed by the following steps: obtaining the mount type information, mount type name information, mounted data storage node, and data warehouse elements and hierarchical information corresponding to each mounted data storage node of each data indicator; obtaining the data indicator flat tree data information of each data indicator based on the flat tree data information acquisition rules, mount type information, mount type name information, data warehouse elements and hierarchical information; constructing a data indicator flat tree data information list based on the flat tree data information of each data indicator.

[0090] Among them, the mounting type information can be understood as the data integration or connection method selected for specific analysis, such as analysis subject, data mart, etc.; the mounting type name information can be understood as the name of the specific data integration or connection method. Taking the analysis subject as an example, it can be a sales performance analysis subject, a sales trend analysis subject, etc.

[0091] Optionally, the data center obtains the mounting type information, mounting type name information, mounted data storage nodes, and data warehouse elements and hierarchical information corresponding to each mounted data storage node of each data indicator, and obtains the data indicator flat tree data information of each data indicator based on the flat tree data information acquisition rules, mounting type information, mounting type name information, data warehouse elements and hierarchical information, and constructs a data indicator flat tree data information list based on the flat tree data information of each data indicator. The data indicator flat tree data information of the data indicator is associated with the node flat tree data information of the mounted data storage node, so as to facilitate the subsequent search of the data indicator with the node flat tree data information as a prefix, and obtain the number of data indicators mounted on each data storage node, thus laying a foundation for the search process in advance.

[0092] In one of the embodiments, the method also includes: obtaining the first prefix information of each data storage node according to the flat tree data information acquisition rules, the data warehouse elements and level information corresponding to each current data storage node; the first prefix information is other flat tree data information before the flat tree data information corresponding to the currently mounted data warehouse element; if it is detected that the user demand information has changed, obtaining the second prefix information of each data storage node based on the flat tree data information acquisition rules, the latest data warehouse elements and level information corresponding to each data storage node; the second prefix information is other flat tree data information before the flat tree data information corresponding to the latest data warehouse element currently mounted; when the first prefix information is the same as the second prefix information, the data warehouse elements currently mounted on each data storage node are updated to the latest data warehouse elements; if the first prefix information is different from the second prefix information, the data warehouse elements currently mounted on each data storage node are updated to the latest data warehouse elements, and the data indicator flat tree data information corresponding to each data indicator is updated according to the first prefix information, the second prefix information and the latest data warehouse elements.

[0093] For example, the data middle station 104 obtains the first prefix information of each data storage node before the tiled tree data information corresponding to the currently mounted data warehouse element according to the tiled tree data information acquisition rule, the data warehouse elements and level information corresponding to each current data storage node, and the node tiled tree data information acquisition method mentioned in the aforementioned embodiment. If a change in user demand information is detected, based on the tiled tree data information, the latest data warehouse elements and level information corresponding to each data storage node, the second prefix information of each data storage node before the tiled tree data information corresponding to the currently mounted data warehouse element is obtained according to the node tiled tree data information acquisition method mentioned in the aforementioned embodiment.

[0094] Afterwards, when the first prefix information and the second prefix information are the same, it means that the mounting relationship between the data warehouse elements has not changed, and the data warehouse elements currently mounted on each data storage node are updated to the latest data warehouse elements. In addition, when the first prefix information and the second prefix information are different, it means that the mounting relationship between the data warehouse elements has changed. First, the data warehouse elements currently mounted on each data storage node are updated to the latest data warehouse elements. The aforementioned update of the data warehouse elements is not only in the storage directory tree, but also requires the update of the data warehouse elements in the data indicator flat tree data information list; then, according to the first prefix information, the second prefix information and the latest data warehouse elements, the data indicator flat tree data information corresponding to each of the data indicators is updated.

[0095] The above method can achieve the following technical effects:

[0096] 1. By monitoring changes in user needs, the system can dynamically adjust the mounting relationship of data storage nodes to adapt to new business needs.

[0097] 2. Ensure that each data storage node obtains the latest data warehouse elements in a timely manner, thereby ensuring that data analysis and decision-making are based on accurate information, improving the accuracy and consistency of the data.

[0098] In an exemplary embodiment, updating data indicator tile tree data information corresponding to each data indicator according to the first prefix information, the second prefix information and the latest data warehouse element includes:

[0099] According to the tile tree data information acquisition rules, the latest data warehouse elements are symbolized to obtain the symbolized latest data warehouse elements; through the pre-set connection symbol, the symbolized latest data warehouse elements and the data ID corresponding to the latest data warehouse elements are connected to obtain the identifier information of the latest data warehouse elements; using the symbolized hierarchical information, the first prefix information and the identifier information are connected to obtain the data indicator tile tree prefix information; based on the data indicator tile tree prefix information, the data indicator tile tree data information to be updated is searched from the data indicator tile tree data information list; the first prefix information contained in the data indicator tile tree data information to be updated is updated to the second prefix information.

[0100] Optionally, the data middle station 104 symbolizes the latest data warehouse element according to the tile tree data information acquisition rules to obtain the symbolized latest data warehouse element, and then connects the symbolized latest data warehouse element and the data ID corresponding to the latest data warehouse element through a pre-set connection symbol to obtain the unique identifier information of the latest data warehouse element in the storage directory tree, and then uses the symbolized hierarchical information to connect the first prefix information and the identifier information to obtain the data indicator tile tree prefix information, and searches for the data indicator tile tree data information to be updated from the data indicator tile tree data information list based on the data indicator tile tree prefix information, and finally updates the first prefix information contained in the data indicator tile tree data information to be updated to the second prefix information. Since the latest data warehouse element has been updated before, this step only updates the mounting relationship of the data warehouse element. In the above manner, using the pre-introduced tile tree data, the data indicator tile tree data information can be quickly updated in batches when the mounting relationship between the data warehouse elements changes, thereby ensuring the timeliness and effectiveness of the data indicator tile tree data information.

[0101] In an exemplary embodiment, a specific implementation process of a data storage method is provided. The specific name elements appearing below are examples of implementing the method in a specific scenario, and are not limited to only being able to successfully execute the solution in this scenario:

[0102] 1. Configuration of dynamic directory tree solution design and implementation example:

[0103] 1.1、Scheme design:

[0104] In order to achieve refined classification management of indicators, support multi-dimensional analysis of indicator systems, and enhance the flexibility and scalability of the directory tree, the classification management directory tree is designed to be configurable, and the configurable parameters include:

[0105] 1) Add, modify and configure data warehouse elements, and adjust the data warehouse elements and the number of sub-levels of data warehouse elements according to business needs.

[0106] 2) Configure the mounting relationship between data warehouse elements.

[0107] 3) Configure the mounting relationship between data indicators and data warehouse elements.

[0108] 4) Configure the number of levels displayed in the directory tree.

[0109] In this application, business classification, data domain, data mart, etc. are collectively referred to as data warehouse elements. The mounting relationship between data warehouse elements determines the hierarchical relationship between data warehouse elements. For example, if the configuration case is: data domain is mounted on business classification, business process is mounted on data domain, data mart is mounted on business classification, and analysis subject is mounted on data mart, the relationship between data warehouse elements can be presented in a tree structure as shown in Figure 3.

[0110] The purpose of configuring the mounting relationship of data indicators is to facilitate the fine classification and management of business indicator data, so as to query and analyze indicator data from different dimensions. By configuring the display level of the directory tree, a directory tree with a multi-level data organization structure can be realized.

[0111] If the atomic indicator is configured to be mounted on the business process, the directory tree is configured with 1 layer. On the left side of the atomic indicator menu page, the atomic indicator can be managed by category through the "Business Process Directory Tree", and the root node of the directory tree is the business process;

[0112] If the above mounting relationship remains unchanged, adjust the directory tree to 2 layers. From the mounting relationship of the data warehouse elements, we can know that the root node of the directory tree is the data domain and the leaf node is the business process. For other scenarios, you can refer to the hierarchical relationship of the data warehouse elements and so on.

[0113] 1.2. Example:

[0114] Atomic indicator directory tree configuration: Atomic indicators are mounted in the business process, and a 2-layer directory tree is displayed as shown in Figure 4:

[0115] The root node of the directory tree on the left is the data domain, and the leaf nodes on the tree are business processes. The number displayed on the leaf node is equal to the number of indicators directly mounted on the node, for example, 2 atomic indicators are mounted under "Order Generation". The number of non-leaf nodes is equal to the sum of the number of child nodes and the number directly mounted on the current node.

[0116] Derived indicator classification management directory tree configuration: The mount relationship configuration is mounted on the analysis subject and data mart, and the directory tree level is configured as 1. In the derived indicator classification management, derived indicators can be managed through the "analysis subject directory tree" or the "data mart directory tree".

[0117] Figure 5 shows the derived indicators of the “Analysis Subject Directory Tree” management:

[0118] Figure 6 shows the derived indicators managed by the data mart directory tree. Since the sales analysis topic is a subdirectory of the product sales data mart, the derived indicators under the product sales data mart include those mounted on the sales analysis topic and those directly mounted on the mart. As can be seen from the table on the right, the number is 5.

[0119] 2. Structural design and implementation of the flat tree in the directory tree node:

[0120] 2.1, Structural design:

[0121] In order to meet the requirements of fast search and counting at the same time, when the indicators are classified and managed, when the indicators are selected to be mounted on a specific data warehouse element instance, the tree structure of the nodes on the tree is stored to facilitate the query and statistics of the indicators under the nodes on the subsequent directory tree. In this patent, the structure of the node string on the tree is collectively referred to as a flat tree.

[0122] The design rules for tile trees are as follows:

[0123] 1) Symbolize the data warehouse elements, where business classification is a fixed element of the data warehouse elements, and the business classification is symbolized as bc; the data domain is the first data warehouse element customized by the planning template, and the code is dwe1; the business process is the second data warehouse element of the planning template, and the code is dwe2; and so on, the data mart code is dwe3 and the analysis subject is dwe4.

[0124] 2) Use the combination of "@" and data ID as the unique identifier of the data in the tree. For example, if the data ID of the e-commerce category in the business category is 1, then bc@1 uniquely identifies the e-commerce category.

[0125] 3) Use “||” for layer isolation. For example, if the sales domain data ID in the data domain is 20 and the sales domain is mounted on the e-commerce category, the unique identifier of the sales domain in the tree is bc@1||dwe1@20.

[0126] 4) Use " / " to isolate different sub-levels at the same level: For example, the data domain can be configured at most 2 levels in the planning configuration. The sales domain is an element in the data domain. Then, the product sales domain (assuming the data ID is 21) and the regional sales domain (assuming the data ID is 22) can be added to the sales domain. The unique identifier of the product sales domain in the tree is bc@1||dwe1@20 / dwe1@21; the unique identifier of the regional sales domain in the tree is bc@1||dwe1@20 / dwe1@22.

[0127] According to the above rules, when building a directory tree, the flat tree of the directory tree nodes is calculated, and when the indicator is mounted to the tree node, the flat tree structure of the currently mounted tree node is recorded in the indicator table.

[0128] 2.2, Example:

[0129] FIG. 7 is an embodiment of a flat tree structure of data indicators in a directory tree and in table storage.

[0130] In the above embodiment, the directory tree node identifies the flat tree structure of the current node, and the derived indicator table records the flat tree structure after the node is mounted on the tree. The data warehouse element type of the currently displayed directory tree is a data mart, so the leaf node of the directory tree is a data mart. From the last record in the table, it can be seen that when the derived indicator is mounted on the "product sales data mart", the flat tree structure recorded in the table is the flat tree structure on the left directory tree.

[0131] 3. Search implementation plan:

[0132] 1) According to the design of the tile tree, when constructing an indicator, when the indicator is mounted on a certain data warehouse element, the corresponding tile tree after mounting is stored in the warehouse.

[0133] 2) When the corresponding data warehouse element is selected as the directory tree display, the current data warehouse element directory tree is constructed.

[0134] 3) Traverse the tree and calculate the tile tree for each node.

[0135] 4) When clicking a directory tree node to search, the flattenTree value of the current node is used as the conditional search item.

[0136] 5) Use prefix matching to match the indicator data mounted under the current directory tree node.

[0137] 4. Directory tree counting statistics implementation plan:

[0138] 1) Build the entire directory tree first.

[0139] 2) Traverse the tree and compute the tiled tree for each node.

[0140] 3) Get the flat tree of all nodes on the tree to count the number of indicators mounted by all nodes.

[0141] 4) Calculate the level of the leaf node according to the number of “||”. The number of levels is equal to the number of “||” + 1, and put the nodes of the same level into the same set.

[0142] 5) Calculate the number of leaf nodes with the same number of layers. The statistical method is:

[0143] 5.1) Use prefix matching to query all indicators whose tile trees are prefixed with the leaf node tile tree.

[0144] 5.2) Cut the matching indicator tile tree. Assume that the current leaf node level is n=1. The cutting condition is that the tile tree is from left to right. When the nth “||” is encountered, it stops. The object after cutting is the string before “||”. The cut string is the tile tree of the directory tree leaf node.

[0145] 5.3) Group and count the strings cut by all indicator flat trees, and the number of each group is equal to the number of indicators under the corresponding leaf node.

[0146] 5.4) Loop through the leaf node sets at different levels to calculate the data of the indicators under all leaf nodes.

[0147] 6) Recursively calculate the number of indicators of nodes on the tree. The calculation rule is: the number of indicators of the current node + the number of indicators in all child nodes.

[0148] 6. Design of tile tree batch update scheme:

[0149] In order to achieve fast search and counting, the flat tree structure is stored in the database when the indicators and data warehouse elements are constructed. However, due to business changes, when the mounting relationship between data warehouse elements changes, the flat trees of all indicators need to be updated synchronously.

[0150] 1) Get the flatten tree preFlattenTree mounted on the current data warehouse element before the update.

[0151] 2) Calculate the flatten tree curFlattenTree mounted on the current data warehouse element after the update.

[0152] 3) Determine whether preFlattenTree is equal to curFlattenTree.

[0153] 4) If preFlattenTree==curFlattenTree, only the data warehouse elements are updated to complete the update operation.

[0154] 5) preFlattenTree!=curFlattenTree, indicating that the mounting relationship has been changed, and the indicator system needs to be notified to synchronously update the flat tree of the indicator data.

[0155] 5.1) Calculate the flat tree prefix mounted on the current data warehouse element: dwElementFlattentree = preFlattenTree+“||”+the unique identifier of the current data in the tree (for example, dwe3@1).

[0156] 5.2) Calculate the flatten tree prefix before replacement: preParentFlattenTree = preFlattenTree + "||".

[0157] 5.3) Calculate the replaced flat tree prefix: curParentFlattentree=curFlattenTree+“||”.

[0158] 5.4) Send tile tree update events.

[0159] 6) The indicator monitors events and makes the following changes after monitoring the events:

[0160] 6.1) Use the prefix to match all indicators that need to be changed. The prefix is: dwElementFlattentree.

[0161] 6.2) Replace the flat tree prefix of the indicator from preParentFlattenTree to curParentFlattentree.

[0162] 6.3) Complete the indicator tile tree batch update operation.

[0163] Compared with the prior art, this application has the following advantages:

[0164] 1. Improve data management efficiency: The combination of dynamic configuration mechanism and multi-level directory display makes the creation, management and query of data indicators more efficient, reduces human errors and improves the overall efficiency of data processing.

[0165] 2. Enhanced data analysis capabilities: Quick query and statistical functions enable users to examine data from multiple perspectives, helping to discover connections and patterns between data, and providing strong support for more in-depth data analysis and business decision-making.

[0166] 3. Promote data governance: Through fine-grained indicator classification and management, it helps maintain data consistency and accuracy, promotes effective data governance, and reduces the risk of data confusion and redundancy.

[0167] 4. Improve user experience: The user interface is user-friendly and can customize data display methods according to user query habits and business needs, improving user satisfaction and work efficiency.

[0168] 5. Support business innovation: The flexible data management framework provides a solid foundation for business innovation, enabling enterprises to respond to market changes more quickly and use data to drive the iterative upgrade of products and services.

[0169] It should be understood that, although the various steps in the flowcharts involved in the above-mentioned embodiments are displayed in sequence according to the indication of the arrows, these steps are not necessarily executed in sequence according to the order indicated by the arrows. Unless there is a clear explanation in this article, the execution of these steps does not have a strict order restriction, and these steps can be executed in other orders. Moreover, at least a part of the steps in the flowcharts involved in the above-mentioned embodiments can include multiple steps or multiple stages, and these steps or stages are not necessarily executed at the same time, but can be executed at different times, and the execution order of these steps or stages is not necessarily to be carried out in sequence, but can be executed in turn or alternately with other steps or at least a part of the steps or stages in other steps.

[0170] Based on the same inventive concept, the embodiment of the present application also provides a data storage device for implementing the data storage method involved above. The implementation solution provided by the device to solve the problem is similar to the implementation solution recorded in the above method, so the specific limitations in one or more data storage device embodiments provided below can refer to the limitations on the data storage method above, and will not be repeated here.

[0171] In an exemplary embodiment, as shown in FIG8 , a data storage device is provided, including: a configuration information generation module 801, a directory tree construction module 802 and a data storage module 803, wherein:

[0172] A configuration information generation module is used to obtain current application environment information, user demand information, and data information to be stored, and generate corresponding configuration information according to the current application environment information and user demand information; the configuration information includes data warehouse elements, the first mounting relationship between data warehouse elements, the second mounting relationship between data indicators and data warehouse elements, and the number of display layers;

[0173] The directory tree construction module is used to construct the corresponding storage directory tree based on the data warehouse elements, data indicators, the first mounting relationship, the second mounting relationship and the number of display layers;

[0174] The data storage module is used to store the data information to be stored into the corresponding data storage node according to the data warehouse elements and data indicators of the data information to be stored.

[0175] In one embodiment, the data storage device also includes a mounting indicator quantity display module, which is used to obtain and display the number of data indicators mounted on the current data storage node according to pre-set tile tree data information acquisition rules and any current data storage node; the number of data indicators includes a first data indicator number and a second data indicator number, the first data indicator number is the number of data indicators mounted under the current data storage node, and the second data indicator number is the number of data indicators of the data storage sub-nodes mounted on the current data storage node.

[0176] In one embodiment, the mounting indicator quantity display module further includes:

[0177] The acquisition submodule is used to obtain the current data warehouse elements and current level information corresponding to the current data storage node.

[0178] The node flat tree generation submodule is used to obtain the node flat tree data information of the current data storage node based on the flat tree data information acquisition rules, current data warehouse elements and current level information.

[0179] The search submodule is used to search for target data indicator tiled tree data information from a pre-built data indicator tiled tree data information list according to the node tiled tree data information; the target data indicator tiled tree data information is information with the node tiled tree data information as a prefix.

[0180] The display submodule is used to determine the number of target data indicator flat tree data information as the number of data indicators mounted on the current data storage node and display it.

[0181] In an exemplary embodiment, the current hierarchical information includes current hierarchical information and current level information. The node flat tree generation submodule is also used to symbolize the current data warehouse element, the current hierarchical information and the current level information according to the flat tree data information acquisition rules to obtain the symbolized current data warehouse element, the symbolized current hierarchical information and the symbolized current level information; connect the symbolized current data warehouse element and the data ID corresponding to the current data warehouse element through a pre-set connection symbol to obtain the identifier information of the current data warehouse element; obtain the node flat tree data information of the current data storage node according to the identifier information, the symbolized current hierarchical information and the symbolized current level information.

[0182] In one embodiment, the data storage device also includes a list construction module, which is used to obtain the mounting type information, mounting type name information, mounted data storage nodes, and data warehouse elements and hierarchical information corresponding to each mounted data storage node of each data indicator; based on the flat tree data information acquisition rules, mounting type information, mounting type name information, data warehouse elements and hierarchical information, the data indicator flat tree data information of each data indicator is obtained; according to the flat tree data information of each data indicator, a data indicator flat tree data information list is constructed.

[0183] In one of the embodiments, the data storage device also includes an update module, which is used to obtain the first prefix information of each data storage node according to the flat tree data information acquisition rules, the data warehouse elements and level information corresponding to each current data storage node; the first prefix information is other flat tree data information before the flat tree data information corresponding to the currently mounted data warehouse element; if it is detected that the user demand information has changed, the second prefix information of each data storage node is obtained based on the flat tree data information acquisition rules, the latest data warehouse elements and level information corresponding to each data storage node; the second prefix information is other flat tree data information before the flat tree data information corresponding to the latest data warehouse element currently mounted; when the first prefix information is the same as the second prefix information, the data warehouse elements currently mounted on each data storage node are updated to the latest data warehouse elements; if the first prefix information is different from the second prefix information, the data warehouse elements currently mounted on each data storage node are updated to the latest data warehouse elements, and the data indicator flat tree data information corresponding to each data indicator is updated according to the first prefix information, the second prefix information and the latest data warehouse elements.

[0184] In an exemplary embodiment, the update module is further used to symbolize the latest data warehouse element according to the tile tree data information acquisition rules to obtain the symbolized latest data warehouse element; connect the symbolized latest data warehouse element and the data ID corresponding to the latest data warehouse element through a pre-set connection symbol to obtain the identifier information of the latest data warehouse element; use the symbolized hierarchical information to connect the first prefix information and the identifier information to obtain the data indicator tile tree prefix information; based on the data indicator tile tree prefix information, search for the data indicator tile tree data information to be updated from the data indicator tile tree data information list; update the first prefix information contained in the data indicator tile tree data information to be updated to the second prefix information.

[0185] Each module in the above data storage device can be implemented in whole or in part by software, hardware, or a combination thereof. Each module can be embedded in or independent of a processor in a computer device in the form of hardware, or can be stored in a memory in a computer device in the form of software, so that the processor can call and execute operations corresponding to each module.

[0186] In an exemplary embodiment, a computer device is provided, which may be a server, and its internal structure diagram may be shown in FIG9. The computer device includes a processor, a memory, an input / output interface (Input / Output, referred to as I / O) and a communication interface. The processor, the memory and the input / output interface are connected via a system bus, and the communication interface is connected to the system bus via the input / output interface. The processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of the computer device is used to store current application environment information, user demand information, data information to be stored, configuration information and a storage directory tree. The input / output interface of the computer device is used to exchange information between the processor and an external device. The communication interface of the computer device is used to communicate with an external terminal via a network connection. When the computer program is executed by the processor, a data storage method is implemented.

[0187] Those skilled in the art will understand that the structure shown in FIG. 9 is merely a block diagram of a partial structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than shown in the figure, or combine certain components, or have a different arrangement of components.

[0188] In an exemplary embodiment, a computer device is provided, including a memory and a processor, wherein a computer program is stored in the memory, and when the processor executes the computer program, the data storage method of the above embodiment is implemented.

[0189] In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the data storage method of the above embodiment is implemented.

[0190] In one embodiment, a computer program product is provided, including a computer program, which implements the data storage method of the above embodiment when executed by a processor.

[0191] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, stored data, displayed data, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties, and the collection, use and processing of relevant data must comply with relevant regulations.

[0192] A person of ordinary skill in the art can understand that all or part of the processes in the above-mentioned embodiment method can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to the memory, database or other medium used in the embodiments provided in the present application can include at least one of non-volatile memory and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. As an illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM). The database involved in each embodiment provided in this application may include at least one of a relational database and a non-relational database. Non-relational databases may include distributed databases based on blockchains, etc., but are not limited to this. The processor involved in each embodiment provided in this application may be a general-purpose processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic device, a data processing logic device based on quantum computing, an artificial intelligence (AI) processor, etc., but are not limited to this.

[0193] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this application.

[0194] The above-described embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the present application. It should be pointed out that, for a person of ordinary skill in the art, several variations and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the attached claims.

Claims

1. A data storage method, characterized in that: Applied to the data center, the method includes: Acquire current application environment information, user demand information, and data information to be stored, and generate corresponding configuration information according to the current application environment information and the user demand information; the configuration information includes data warehouse elements, a first mounting relationship between data warehouse elements, a second mounting relationship between data indicators and the data warehouse elements, and the number of display layers; Based on the data warehouse elements, data indicators, the first mounting relationship, the second mounting relationship and the number of display layers, a corresponding storage directory tree is constructed; According to the data warehouse elements and data indicators of the data information to be stored, the data information to be stored is stored in the corresponding data storage node.

2. The method according to claim 1, characterized in that The method further comprises: According to the preset tile tree data information acquisition rules and any current data storage node, the number of data indicators mounted on the current data storage node is acquired and displayed; the number of data indicators includes a first number of data indicators and a second number of data indicators, the first number of data indicators is the number of data indicators mounted on the current data storage node, and the second number of data indicators is the number of data indicators of data storage sub-nodes mounted on the current data storage node.

3. The method according to claim 2, characterized in that The step of obtaining and displaying the number of data indicators mounted on the current data storage node according to the preset tile tree data information acquisition rules and any current data storage node includes: Obtain the current data warehouse element and current level information corresponding to the current data storage node; Based on the flat tree data information acquisition rule, the current data warehouse element and the current level information, obtain the node flat tree data information of the current data storage node; According to the node tile tree data information, search for target data indicator tile tree data information from a pre-built data indicator tile tree data information list; the target data indicator tile tree data information is information with the node tile tree data information as a prefix; The quantity of the target data indicator tile tree data information is determined as the quantity of data indicators mounted on the current data storage node and displayed.

4. The method according to claim 3, characterized in that The current level information includes current layer information and current level information; The node flat tree data information of the current data storage node is obtained based on the flat tree data information acquisition rule, the current data warehouse element and the current level information, including: According to the flat tree data information acquisition rule, the current data warehouse element, the current layer information and the current level information are symbolized to obtain the symbolized current data warehouse element, the symbolized current layer information and the symbolized current level information; Connecting the symbolized current data warehouse element and the data ID corresponding to the current data warehouse element through a preset connection symbol to obtain identifier information of the current data warehouse element; The node flat tree data information of the current data storage node is obtained according to the identifier information, the symbolized current hierarchy information and the symbolized current level information.

5. The method according to claim 3, characterized in that: The data indicator flat tree data information list is constructed by the following steps: Obtaining the mount type information, mount type name information, mounted data storage node, and data warehouse elements and level information corresponding to each mounted data storage node of each data indicator; Based on the flat tree data information acquisition rule, mount type information, mount type name information, data warehouse elements and level information, obtain data indicator flat tree data information of each data indicator; According to the data information of each data indicator tile tree, a data indicator tile tree data information list is constructed.

6. The method according to claim 5, characterized in that The method further comprises: According to the flat tree data information acquisition rule, the data warehouse elements and level information corresponding to each of the current data storage nodes, the first prefix information of each of the data storage nodes is acquired; the first prefix information is other flat tree data information before the flat tree data information corresponding to the currently mounted data warehouse element; If it is detected that the user demand information has changed, the second prefix information of each data storage node is obtained based on the flat tree data information acquisition rule, the latest data warehouse element corresponding to each data storage node, and the hierarchical information; the second prefix information is other flat tree data information before the flat tree data information corresponding to the latest data warehouse element currently mounted; When the first prefix information is the same as the second prefix information, the data warehouse element currently mounted on each data storage node is updated to the latest data warehouse element; If the first prefix information is different from the second prefix information, the data warehouse element currently mounted on each data storage node is updated to the latest data warehouse element, and the data indicator tile tree data information corresponding to each data indicator is updated according to the first prefix information, the second prefix information and the latest data warehouse element.

7. The method according to claim 6, characterized in that The updating of the data indicator tile tree data information corresponding to each of the data indicators according to the first prefix information, the second prefix information and the latest data warehouse element includes: According to the tile tree data information acquisition rule, the latest data warehouse element is symbolized to obtain the symbolized latest data warehouse element; Connecting the symbolized latest data warehouse element and the data ID corresponding to the latest data warehouse element through a preset connection symbol to obtain identifier information of the latest data warehouse element; Using the symbolized hierarchical information, connecting the first prefix information and the identifier information to obtain data indicator flat tree prefix information; Based on the data indicator tile tree prefix information, searching for the data indicator tile tree data information to be updated from the data indicator tile tree data information list; The first prefix information contained in the data pointer tile tree data information to be updated is updated to the second prefix information.

8. A data storage device, characterized in that: Applied to the data middle station, the device includes: A configuration information generation module, used to obtain current application environment information, user demand information and data information to be stored, and generate corresponding configuration information according to the current application environment information and the user demand information; the configuration information includes data warehouse elements, a first mounting relationship between data warehouse elements, a second mounting relationship between data indicators and the data warehouse elements, and the number of display layers; A directory tree construction module, used to construct a corresponding storage directory tree based on the data warehouse elements, data indicators, the first mounting relationship, the second mounting relationship and the number of display layers; The data storage module is used to store the data information to be stored into the corresponding data storage node according to the data warehouse elements and data indicators of the data information to be stored.

9. A computer device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 7 are implemented.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 7 are implemented.

Images