System main data storage method and device, equipment, storage medium and program product
By building a multi-forktree structure and mapping user planes and resource planes, the problem of inefficient acquisition and access of master data in hyper-large-scale systems is solved, and the associated storage and unified logical access of system master data are realized, which improves operation and maintenance management efficiency.
Patent Information
- Application Number
- CN202411105164.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-12
- Publication Date
- 2024-12-03
AI Technical Summary
Existing data integration methods are difficult to achieve universal acquisition and rapid access of system master data in hyper-large-scale systems and business complex systems, resulting in inefficient operation and maintenance management.
By building a multi-fork tree structure between users and applications, mapping user planes and resource planes based on application ordering records and call records, forming a two-dimensional multi-fork tree, and modifying them, the system's main data multi-fork tree is obtained. To realize the associated storage and unified logical access of the master data.
It improves the efficiency of the system's operation and maintenance management, realizes rapid acquisition and access of the system's main data, and is suitable for super-large-scale systems and complex business scenarios.
Smart Images

Figure CN119065607A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of data processing technology, and in particular to a system master data storage method, device, equipment, storage medium and program product. Background Art
[0002] At present, data integration methods usually include the following three methods: Method 1, to achieve master data management based on the data injection method of established rules, and different objects have different established rules; Method 2, to obtain integrated master data through field association processing; Method 3, to achieve management based on the identification, classification and coding of master data.
[0003] However, for very large-scale systems and systems with complex business situations, the above method only constructs the basic relationship between objects and cannot reflect the basic relationship between data in the system; the above method 2 cannot associate master data with objects; and the above method 3 cannot obtain and access master data with unified logic.
[0004] Due to the complex relationship between the master data of different systems, the above three methods cannot meet the needs of universal acquisition, rapid access and rapid use of system master data in ultra-large-scale systems and complex business systems, reducing the efficiency of system operation and maintenance management. Summary of the invention
[0005] The main purpose of the present application is to provide a system master data storage method, device, equipment, storage medium and program product, aiming to solve the technical problem of low efficiency in system operation and maintenance management.
[0006] To achieve the above object, the present application proposes a system master data storage method, the method comprising:
[0007] Based on the application set included in the system and the call records of the tool components of the applications subscribed by the user, a multi-branch tree of the application architecture corresponding to the user's full application is constructed;
[0008] Based on the association relationship between the user and the historically subscribed application, the user is mapped to each node in the multi-branch tree of the application architecture to obtain a two-dimensional multi-branch tree including a user plane and a resource plane, wherein the association relationship is determined based on the application subscription record;
[0009] Based on the application ordering record and the calling record, the usage corresponding to each node in the two-dimensional multi-branch tree is modified to obtain the master data multi-branch tree of the system, so as to associate and store the system master data based on the master data multi-branch tree.
[0010] In one embodiment, the step of mapping the user to each node in the application architecture multi-branch tree based on the association relationship between the user and the historical subscription application to obtain a two-dimensional multi-branch tree including a user plane and a resource plane includes:
[0011] Based on the application architecture multitree of the full application and the data storage set, construct the longest application architecture multitree of the application corresponding to the user, wherein the data storage set includes each node element of the application architecture multitree of the full application;
[0012] Based on the association relationship, the user is mapped to each node in the longest application architecture multi-branch tree to obtain a two-dimensional multi-branch tree including a user plane and a resource plane.
[0013] In one embodiment, the step of mapping the user to each node in the longest application architecture multitree based on the association relationship to obtain a two-dimensional multitree including a user plane and a resource plane includes:
[0014] Based on the association relationship, the user's identity is mapped one by one with the tool components called by the application in the longest application architecture multi-branch tree, other tools associated with the tool components, component modules corresponding to the tool components and other tools, and the IP addresses of the component modules, and the application resource quantities corresponding to the applications subscribed by the user are mapped one by one with the tool components called by the application in the longest application architecture multi-branch tree, other tools associated with the tool components, component modules of the tool components, and the IP addresses of the components, to obtain a two-dimensional multi-branch tree including a user plane and a resource plane, wherein the application resource quantity is measured based on the usage of the tool components called by the user corresponding to the full amount of applications.
[0015] In one embodiment, the step of constructing the longest application architecture multitree of the user's corresponding application based on the application architecture multitree of the full application and the data storage set includes:
[0016] Constructing a tuple based on multiple application nodes in the multi-branch tree of the application architecture of the full application and each tool component node corresponding to each application node;
[0017] Determine whether the entities corresponding to each pair of binary tuples are consistent. If they are consistent, perform deduplication on the consistent binary tuples.
[0018] Arrange the deduplicated tuples in the order of calling to obtain the longest calling logic chain of each application node;
[0019] Based on the longest call logic chain of each of the application nodes and the call relationship between each of the tool component nodes and the corresponding components and component addresses, the longest call logic chain of the user's corresponding full application is constructed;
[0020] Based on the longest calling logic chain of the full application corresponding to the user, a longest application architecture multi-branch tree of the full application corresponding to the user is constructed.
[0021] In one embodiment, the step of modifying the usage corresponding to each node in the two-dimensional multi-branch tree based on the application subscription record and the call record to obtain the master data multi-branch tree of the system includes at least one of the following:
[0022] Based on the application subscription record and the call record, the usage of the applications not subscribed by the user and the unused tool components in the two-dimensional multi-branch tree including the user plane and the resource plane are recorded as zero, so as to obtain the master data multi-branch tree corresponding to the full amount of applications of the user;
[0023] Based on the application subscription record and the call record, each node in the two-dimensional multi-branch tree including the user plane and the resource plane is traversed, and the usage corresponding to each node of the two-dimensional multi-branch tree is modified to obtain the master data multi-branch tree of the full application corresponding to the user.
[0024] In one embodiment, the step of constructing a multi-branch tree of application architecture corresponding to the full amount of applications of the user based on the application set included in the system and the call records of the application subscribed by the user to the tool component includes:
[0025] Based on the application set included in the system, determine the tool component required to be called for the application to run, other tools associated with the tool component, component modules of the tool component, and specific instances of the component modules during operation;
[0026] Traverse the call records of the tool component corresponding to the full application of the user, other tools associated with the tool component, component modules of the tool component, and specific instances of the component during operation, and determine the tool component, other tools, component modules and IP addresses of the component modules corresponding to the full application respectively;
[0027] Based on the tool components, other tools, component modules and IP addresses of component modules respectively corresponding to the full application, a multi-branch tree of the application architecture of the full application is constructed.
[0028] In addition, to achieve the above-mentioned purpose, the present application also proposes a system master data storage device, the system master data storage device comprising:
[0029] The application architecture multi-tree construction module is used to build the application architecture multi-tree corresponding to the user's full application based on the application set included in the system and the call records of the tool components of the application subscribed by the user;
[0030] A two-dimensional multi-branch tree construction module, used to map users to each node in the application architecture multi-branch tree based on the association relationship between users and historically ordered applications, to obtain a two-dimensional multi-branch tree including a user plane and a resource plane, wherein the association relationship is determined based on application ordering records;
[0031] The master data multi-branch tree construction module is used to modify the usage corresponding to each node in the two-dimensional multi-branch tree based on the application ordering record and the call record to obtain the master data multi-branch tree of the system, so as to associate and store the system master data based on the master data multi-branch tree.
[0032] In addition, to achieve the above-mentioned objectives, the present application also proposes a system master data storage device, which includes: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the computer program is configured to implement the steps of the system master data storage method as described above.
[0033] In addition, to achieve the above-mentioned purpose, the present application also proposes a storage medium, which is a computer-readable storage medium, and a computer program is stored on the storage medium. When the computer program is executed by a processor, the steps of the system master data storage method described above are implemented.
[0034] In addition, to achieve the above-mentioned purpose, the present application also provides a computer program product, which includes a computer program, and when the computer program is executed by a processor, the steps of the system master data storage method described above are implemented.
[0035] The present application constructs an application architecture multi-branch tree corresponding to the user's full range of applications based on the application set included in the system and the call records of the application subscribed by the user to the tool component; based on the association relationship between the user and the historically subscribed application, the user is mapped to each node in the application architecture multi-branch tree to obtain a two-dimensional multi-branch tree including a user surface and a resource surface; based on the application subscription record and the call record, the usage corresponding to each node in the two-dimensional multi-branch tree is modified to obtain the master data multi-branch tree of the system, that is, based on a unified master data multi-branch tree recording method, the system master data is associated and stored; specifically, based on the master data multi-branch tree, it is convenient to manage the call records between the system applications and the user's application subscription records, thereby improving the operation and maintenance efficiency of the system. BRIEF DESCRIPTION OF THE DRAWINGS
[0036] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and, together with the description, serve to explain the principles of the present application.
[0037] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, for ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative labor.
[0038] Figure 1 A flowchart of the first embodiment of the master data storage method of the present application system;
[0039] Figure 2 A schematic diagram of a scenario provided in Example 1 of the master data storage method of the system of the present application;
[0040] Figure 3 A flow chart of the second embodiment of the master data storage method of the system of the present application;
[0041] Figure 4 This is a schematic diagram of the module structure of the main data storage device of the system according to the embodiment of the present application;
[0042] Figure 5 Schematic diagram of the device structure of the hardware operating environment involved in the system master data storage method in the embodiment of the present application.
[0043] The purpose, features and advantages of this application will be further described in conjunction with the embodiments and with reference to the accompanying drawings. DETAILED DESCRIPTION
[0044] It should be understood that the specific embodiments described herein are only used to explain the technical solutions of the present application and are not used to limit the present application.
[0045] In order to better understand the technical solution of the present application, a detailed description will be given below in conjunction with the accompanying drawings and specific implementation methods.
[0046] It should be noted that the execution subject of this embodiment can be a computing service device with data processing, network communication and program running functions, such as a tablet computer, a personal computer, a mobile phone, etc., or an electronic device capable of realizing the above functions, a system master data storage device, etc. The following takes the system master data storage device as an example to illustrate this embodiment and the following embodiments.
[0047] Based on this, the embodiment of the present application provides a system master data storage method, referring to Figure 1 , Figure 1 This is a flow chart of the first embodiment of the master data storage method of the system of the present application.
[0048] In this embodiment, the system master data storage method includes steps S10 to S30:
[0049] Step S10, based on the application set included in the system and the call records of the application subscribed by the user to the tool components, construct an application architecture multi-branch tree corresponding to the user's full application.
[0050] It should be noted that system master data refers to data shared among various systems (for example, operational application systems, transactional application systems, and analytical systems, etc.) across the entire enterprise.
[0051] At present, data integration methods usually include the following three methods: Method 1, the data injection method based on established rules realizes master data management, and different objects have different established rules; Method 2, the integrated master data is obtained through field association processing; Method 3, the management is realized based on the identification, classification and coding of master data; However, for ultra-large-scale systems and systems with complex business situations, the above methods only build the basic relationship of objects and cannot reflect the basic relationship of data in the system; the above method 2 cannot associate master data with objects; the above method 3 cannot obtain and access master data with unified logic.
[0052] Due to the complex relationship between the master data of different systems, the above three methods cannot meet the needs of universal acquisition, rapid access and rapid use of system master data in ultra-large-scale systems and complex business systems, reducing the efficiency of system operation and maintenance management.
[0053] In order to improve the operation and maintenance management efficiency of the system, this embodiment first constructs a tuple based on the user's application subscription record, and the tuple is used to record the association relationship between the user and the application; specifically, there are f elements in the tuple F. If it is assumed that the tuple includes 3 elements, the triplet can be the set {user name, application name, application quantity} ({User-ID, Product-ID, Product-mount}).
[0054] It should be noted that the application quantity (resource quantity) is measured based on different tool components. Therefore, the application quantity can be a multi-value. For example, the resource quantity measurement process of the tool component involves the component module of the tool component and its resource ID and resource quantity. The corresponding triplet can be recorded as the set US = {user name, application name, {component name 1, user ID 1, resource quantity 1}, {component name 2, user ID 2, resource quantity 2}, ..., {component name N, user ID N, resource quantity N}}, where N is greater than 1.
[0055] If a user orders a Hadoop platform tool (an application, an open source software platform, mainly used for distributed storage and distributed processing of large data sets), the resource volume of the Hadoop platform tool is measured based on different tool components; for example, the Hadoop platform tool includes HDFS (Hadoop Distributed File System) storage space, and the CPU and memory usage of YARN (Yet Another Resource Negotiator, an HDFS component, responsible for managing and scheduling computing resources in the cluster, including CPU and memory). Therefore, the triplet of the Hadoop platform tool can be expressed as US = {user, Hadoop, {HDFS, keytab, Quota}, {Yarn, queue, {CPU-count, memory-count}}}.
[0056] For a set F containing f applications, each application Fi corresponds to N tool components, then the triplet corresponding to each application Fi can be recorded as: {Uyi, Fi, {Ti1, Ui1, Si1}, {Ti2, Ui2, Si2}, ..., {Tin, Uin, Sin}}; where Uyi represents the y-th user name of the ith application, Tin, Uin, Sin represent the name, component ID and component resource quota value (array) of the n-th component of the ith application, respectively, i is greater than or equal to 1 and less than or equal to f, and n is greater than or equal to 1 and less than or equal to N.
[0057] It should be noted that the application set included in the system can be determined based on the actual architecture of the system.
[0058] Specifically, the implementation method of constructing the multi-branch tree of the application architecture of the full application based on the application set and the call record of the tool component by the user corresponding to the full application may be:
[0059] Based on the application set, the full application ordered by the user is orchestrated to obtain the required orchestration structure diagram, and based on the orchestration structure, the application set, and the user's call record of the tool component corresponding to the full application, a multi-branch tree of the application architecture of the full application is constructed.
[0060] In addition, the implementation method of constructing the multi-branch tree of the application architecture of the full application based on the application set and the call record of the tool component by the user corresponding to the full application can also be:
[0061] Based on the application set included in the system, determine the tool components that need to be called for the application to run, other tools associated with the tool components, component modules of the tool components, and specific instances of the component modules during operation; traverse the call records of the tool components corresponding to the full application of the user, other tools associated with the tool components, component modules of the tool components, and specific instances of the components during operation, and determine the tool components, other tools, component modules, and IP addresses of the component modules that respectively correspond to the full application; based on the tool components, other tools, component modules, and IP addresses of the component modules that respectively correspond to the full application, construct a multi-branch tree of the application architecture of the full application.
[0062] Since the application collection includes all applications of the system, based on the application collection, the tool components required to be called for application operation, other tools associated with the tool components, the component modules of the tool components, and the specific instances of the component modules during operation can be determined.
[0063] Furthermore, by horizontally traversing the call records of the tool component corresponding to the full application of the user, and then vertically traversing other tools associated with the tool component, the component modules of the tool component, and the specific instances of the component during operation based on the characteristics of the platform tool, the tool component, other tools, component modules and the IP addresses of the component modules corresponding to the full application are determined; since there is a parent-child relationship between the platform tools, tool components, other tools, component modules and the IP addresses of the component modules, based on the parent-child relationship, a multi-branch tree of the application architecture of the full application can be constructed.
[0064] For example, suppose that the code of application a is A1, and the platform tools for executing application a involve ETL tool 1, Hadoop platform, GP database and WEB server 1; the execution order of the tools during the application execution process is ETL tool 1, Hadoop platform, ETL tool 1, GP database, ETL tool 1, WEB server 1; specifically, ETL tool 1 is executed first, and the task of ETL tool 1 is to extract, transform and load (ETL) the original data of application A1. The processed data is transmitted to the Hadoop platform, which is used to store and process large-scale data sets. ETL tool 1 is executed again to prepare the data to meet the needs of the next stage. The data is transferred to the GP database, which analyzes the large data sets. ETL tool 1 is executed again to ensure that the data is the latest and most accurate before entering the final stage.
[0065] Based on the above execution process, it can be determined that the identifier T01 is A1, the identifier T11 is ETL tool 1, the identifier T12 is NW1, the identifier T13 is Hadoop platform, the identifier T14 is ETL tool 1, the identifier T15 is NW2, the identifier T16 is GP database, the identifier T17 is ETL tool 1, and the identifier T18 is WEB server 1; further, taking the tool component as the Hadoop platform as an example, the component modules of the Hadoop platform include: LDAP (Lightweight Directory Access Protocol), Kerberos (a network authentication protocol), Ranger (authority management module), Yarn (Yet Another Resource Negotiator, one of the core components of Hadoop, responsible for the management and scheduling of cluster resources), HDFS, MapReduce (a programming model), and the corresponding identifiers are H1, H2, H3, H4, H5, H6, such as Figure 2 shown.
[0066] Assume that ETL tool 1 is called to Hadoop platform, component modules M11 and M12 will be used; ETL tool 1 is called to GP database, component modules M11 and M13 will be used; the operation of GP database requires the use of component modules GP1 and GP2; ETL tool 1 is called to WEB server, component module M14 will be used; the operation of WEB server requires the use of component WEB1; therefore, after the operation of each tool component, the data generated is a tree node with a depth of 2, and the corresponding relationship between the identifier and the component module is sorted as {T21, T22, T23, T24, T25, T26, T27, T28, T29, T210, T211, T212} = {M11, M12, H1, H2, H3, H4, H5, H6, M11, M13, GP1, GP2, M14, WEB1};
[0067] Furthermore, taking the tool component HDFS of the Hadoop platform as an example, the tool component HDFS is identified as H4, and includes two component modules, respectively identified as {T31, T32}={NameNode, DataNode}, and the two component modules are regarded as tree nodes with a depth of 3.
[0068] Furthermore, for a single tool component namespace, its component module cores are NameNode and DataNode. The component module NameNode has two IP addresses. The encoding of these two IP addresses can be used as the tree nodes with a depth of 4 corresponding to the NameNode component module, and are identified as T41 and T42 respectively; the tree node with a depth of 4 corresponding to the component module DataNode is the set of its IP addresses {T43, T44,...,T4(K+2)}, where K is the number of DataNode nodes.
[0069] Based on the above method, multiple applications (full-volume applications) ordered by the user are arranged to construct a multi-branch tree of the application architecture of the full-volume applications.
[0070] Step S20, based on the association relationship between the user and the historically subscribed application, the user is mapped to each node in the application architecture multi-branch tree to obtain a two-dimensional multi-branch tree including a user plane and a resource plane, wherein the association relationship is determined based on the application subscription record.
[0071] It can be understood that when the application architecture multi-branch tree corresponding to the user's full application is constructed, by mapping each tree node in the application architecture multi-branch tree with the application subscribed by the user, a two-dimensional multi-branch tree including the user plane and the resource plane can be obtained.
[0072] Specifically, based on the association relationship, the user can be mapped to each node in the application architecture multi-branch tree (the tool component called by the application, other tools associated with the tool component, the component modules corresponding to the tool component and other tools, and the IP address of the component module) to obtain a two-dimensional multi-branch tree including the user plane and the resource plane.
[0073] Step S30, based on the application ordering record and the call record, modify the usage corresponding to each node in the two-dimensional multi-branch tree to obtain the master data multi-branch tree of the system, so as to associate and store the system master data based on the master data multi-branch tree.
[0074] It can be understood that when the multi-branch tree of the application architecture corresponding to the user's full application is built, the associated storage of the system's master data can be achieved by storing the usage of the applications corresponding to each tree node in the multi-branch tree of the application architecture (including the usage of platform tools, tool components, component modules, component IP addresses, etc.).
[0075] In the process of using the master data, it is only necessary to convert the subscription value of the application corresponding to each tree node in the system's master data multi-branch tree into a usage value with a timestamp, which is recorded as: the user's usage amount / transaction amount each time. That is, the statistics of the application's transaction volume can be achieved through the superposition of different timestamps to achieve unified measurement at the user level and application level; the storage of user IDs, resource usage and metadata corresponding to the system's applications, tool components, etc. can be achieved to achieve unified management of the system.
[0076] Based on the above, this embodiment builds an application architecture multi-branch tree corresponding to the user's full application based on the application set included in the system and the call records of the application subscribed by the user to the tool component; based on the association relationship between the user and the historically subscribed application, the user is mapped to each node in the application architecture multi-branch tree to obtain a two-dimensional multi-branch tree including a user surface and a resource surface; based on the application subscription record and the call record, the usage corresponding to each node in the two-dimensional multi-branch tree is modified to obtain the master data multi-branch tree of the system, that is, based on a unified master data multi-branch tree recording method, the system master data is associated and stored. Specifically, based on the master data multi-branch tree, it is convenient to manage the call records between the system applications and the user's application subscription records, thereby improving the operation and maintenance efficiency of the system.
[0077] Based on the first embodiment of the present application, in the second embodiment of the present application, the same or similar contents as those in the above-mentioned embodiment 1 can be referred to the above introduction, and will not be repeated in the following. Figure 3 After step S20, the system master data storage method further includes steps S40-S50:
[0078] Step S40, based on the application architecture multi-branch tree of the full application and the data storage set, construct the longest application architecture multi-branch tree of the application corresponding to the user, wherein the data storage set includes each node element of the application architecture multi-branch tree of the full application.
[0079] It should be noted that the data storage set includes each node element of the application architecture multi-branch tree, that is, when the application architecture multi-branch tree of the full application is constructed based on the application set and the user's call record of the tool component corresponding to the full application, the data storage set can be obtained, and the data storage set includes each node element of the application architecture multi-branch tree of the full application.
[0080] Specifically, the data storage set AK has a total of M objects AKi, AKi represents the application architecture multi-branch tree of the i-th application, and M is the total number of applications.
[0081] It can be understood that the depth of AKi is 4, and the depth and width set is recorded as XC, where X represents the depth (X1, X2, X3, X4 are 1, 2, 3, 4 respectively), and C represents the width (C1, C2, C3, C4 represent the width of depth 1, 2, 3, 4 respectively, and j is greater than or equal to 1 and less than or equal to 4). Combined with the first step application involving AKiX2C2, the component corresponds to AKiX3C3, where Xx (x is less than or equal to a positive integer less than or equal to 1 and less than or equal to 4) and Cc (c is greater than or equal to 1 and less than or equal to 4) are both data objects, and the value of the data object can correspond to multiple objects.
[0082] Specifically, the implementation method of constructing the longest application architecture multi-tree of the user's corresponding full application based on the application architecture multi-tree of the user's corresponding full application and the data storage set may be:
[0083] Determine the longest call chain or longest dependency path between the full application corresponding to the user and each element in the data storage set; specifically, the application architecture multi-branch tree corresponding to the full application of the user can be subjected to algorithms such as depth-first search (DFS) or breadth-first search (BFS) to identify the longest path from the root node (user) to the leaf node (each element in the data storage set), thereby constructing the longest application architecture multi-branch tree of the full application corresponding to the user based on the longest call chain.
[0084] In addition, the specific implementation method of constructing the longest application architecture multi-tree of the user corresponding to the full amount of applications based on the application architecture multi-tree of the user corresponding to the full amount of applications and the data storage set can also be:
[0085] Based on multiple application nodes in the application architecture multi-branch tree of the full application, and each tool component node corresponding to each application node, construct a tuple; determine whether the entities corresponding to each pair of tuples are consistent, and if consistent, deduplicate the consistent tuples; arrange the deduplicated tuples in a calling order to obtain the longest calling logic chain of each application node; based on the longest calling logic chain of each application node, and the calling relationship between each tool component node and the corresponding component and component address, construct the longest calling logic chain of the full application corresponding to the user; based on the longest calling logic chain of the full application corresponding to the user, construct the longest application architecture multi-branch tree corresponding to the full application of the user.
[0086] It should be noted that the tuple is used to represent the directed relationship between the application node and the tool component node, where the application node is the starting point and the tool component node is the end point; for each tree node in the longest application architecture multi-branch tree of multiple applications, the tuple can be used to represent the relationship between each tree node.
[0087] In order to construct the longest calling logic chain of each of the application nodes, it is necessary to deduplicate and arrange the tuples; wherein, it can be determined whether the entities corresponding to the two tuples are consistent, and if they are consistent, the consistent tuples are deduplicated; it can be understood that if there are two tuples whose corresponding entities are consistent, it is considered that the starting point and end point of the two tuples are the same entity, representing the same calling relationship, and therefore, the two tuples need to be deduplicated.
[0088] For example, the element sequence with depth 1 in the application architecture multitree of application A1 is {A11, A12, A13} = {ETL tool 1, GP database, WEB server}; the element sequence with depth 1 in the application architecture multitree of application A2 is {A21, A22, A23, A24, A25} = {ETL tool 1, Hadoop platform, ETL tool 1, GP database, WEB server}; the element sequence with depth 1 in the application architecture multitree of application A3 is {A31, A32, A33, A34} = {ETL tool 1, Hadoop platform, ETL tool 2 , GBase database, WEB server}; through entity mapping, it is determined that {A11, A12} and {A23, A24} are repeated, {A12, A13} and {A24, A25} are repeated, {A21, A22} and {A31, A32}, {A42, A43} are repeated; after deduplication, the total element set is {A11, A12}, {A12, A13}, {A21, A22}, {A22, A23}, {A32, A33}, {A33, A34}, {A34, A35}, {A41, A42} objects.
[0089] Furthermore, the tuples can be sorted in the order of the starting points to obtain the longest call logic chain of each application node, for example, a node set with a depth of 2 in the longest application architecture multi-branch tree {{collection tool, ETL tool 1, Hadoop platform, ETL tool 1, GP database, WEB server}, {collection tool, ETL tool 1, Hadoop platform, ETL tool 2, GBase database, WEB server}} is obtained.
[0090] Furthermore, according to the relationship between the tool components, component modules and IP addresses of the above-mentioned applications, the above-mentioned method is used to construct tuples, and the tuples are deduplicated and rearranged to obtain a set of nodes with a depth of 3 and a depth of 4 in the longest application architecture multi-branch tree.
[0091] For user A, its longest application architecture multitree is TA (containing S elements). For each element TAs (s is a positive integer greater than or equal to 1 and less than or equal to S) in the combination, combined with the application set F in the first step, each application object Fi, then TAs belongs to the element of F.
[0092] The implementation method of mapping the application architecture multi-tree based on the association relationship to obtain a two-dimensional multi-tree including a user plane and a resource plane may be:
[0093] Based on the association relationship, the user is mapped to each node in the longest application architecture multi-branch tree to obtain a two-dimensional multi-branch tree including a user plane and a resource plane.
[0094] Since the longest application architecture multitree is a deduplicated application architecture multitree, mapping it with the longest application architecture multitree based on the association relationship can make the constructed two-dimensional multitree including the user plane and the resource plane more accurate.
[0095] Specifically, the mapping with the longest application architecture multitree based on the association relationship to obtain a two-dimensional multitree including a user plane and a resource plane may be implemented as follows:
[0096] Based on the association relationship, the user's identity is mapped one by one with each node of the longest application architecture multi-branch tree, and the number of subscriptions of the application subscribed by the user is mapped one by one with each node of the longest application architecture multi-branch tree, to obtain a two-dimensional multi-branch tree including a user plane and a resource plane.
[0097] In addition, the mapping with the longest application architecture multitree based on the association relationship to obtain a two-dimensional multitree including a user plane and a resource plane may also be implemented as follows:
[0098] Based on the association relationship, the user's identity is mapped one by one to each node of the longest application architecture multi-branch tree, and the application resource volume of the application subscribed by the user is mapped one by one to each node of the longest application architecture multi-branch tree, so as to obtain a two-dimensional multi-branch tree including a user plane and a resource plane, wherein the application resource volume is measured based on the usage of the tool components called by the user for the corresponding full application.
[0099] Specifically, based on the association relationship, the user's identity identifier is mapped one by one with each node of the longest application architecture multi-branch tree, and the application resource amount of the application subscribed by the user is mapped one by one with each node of the longest application architecture multi-branch tree, and a specific implementation method of obtaining a two-dimensional multi-branch tree including a user plane and a resource plane may be:
[0100] Based on the association relationship, the user's identity identifier is mapped one by one with the tool component called by the application in the longest application architecture multi-branch tree, other tools associated with the tool component, component modules corresponding to the tool component and other tools, and the IP address of the component module, and the application resource quantity corresponding to the application subscribed by the user is mapped one by one with the tool component called by the application in the longest application architecture multi-branch tree, other tools associated with the tool component, component modules of the tool component, and the IP address of the component, to obtain a two-dimensional multi-branch tree including a user plane and a resource plane.
[0101] It should be noted that the specific mapping method can be summarized as numerical replacement, that is, the platform tools with a depth of 1, the tool components with a depth of 2, the component modules with a depth of 3 and the IP addresses with a depth of 4 in the longest application architecture multi-branch tree are replaced with numerical values in sequence using the user ID in the association relationship, the application ID subscribed by the user, and the amount of resources of the application to form a user-side and resource-side multi-branch tree.
[0102] For example, for a set K containing k applications, each application object Ki has N components, then Ki can be recorded as {Uyi, Ki, {Ti1, Ui1, Si1}, {Ti2, Ui2, Si2}, ..., {Tin, Uin, Sin}}, where Uyi represents the y-th user name of the ith application, Tin, Uin, Sin represent the n-th component name, component ID name and component resource quota value (array) of the ith application, respectively, i is greater than or equal to 1 and less than or equal to k, and n is greater than or equal to 1 and less than or equal to N.
[0103] Specifically, during the numerical replacement process, the longest application architecture multitree is TA (a total of S objects), and for each element TAs (s is a positive integer greater than or equal to 1 and less than or equal to S) in the longest application architecture multitree, it is recorded as Xst, where Xst represents the depth set Xst, t is greater than or equal to 1 and less than or equal to 4, where the number of Xst applications when the depth is 2 is Q, and each element is represented by Xs2q, p is a positive integer greater than or equal to 1 and less than equal to Q, and the number of components with a depth of 3 corresponding to the Xs2q application is Bq, where Bq is a positive integer greater than or equal to 1.
[0104] During the value replacement process, it is necessary to traverse each tree node in the longest application architecture multi-branch tree, specifically, the following steps are included:
[0105] Step 1, t=1, p=1, q=1, i=1, output q;
[0106] Step 2: Traverse the set F. If Fj is equal to Xs2q, then m=j, d=1, and output m.
[0107] Step 3: The components with a depth of 3 corresponding to the Xs2q application are Tmbq, where bq is a positive integer greater than or equal to 1 and less than or equal to Bq, and the array Tmbq is output;
[0108] Step 4, q=q+1, determine whether q is greater than Q, if so, execute step 4, otherwise execute step 2;
[0109] Step 5, t=t+1, determine whether t is greater than 4, if so, execute step 5, otherwise execute step 2.
[0110] Based on the above method, the traversal of each tree node in the longest application architecture multi-branch tree and the replacement of the value are realized, the mapping is completed, and a two-dimensional multi-branch tree including the user plane and the resource plane is constructed.
[0111] Specifically, assuming that user 1 has subscribed to Hadoop resources, the longest application architecture multitree of the application corresponding to user 1 is US1 = {user 1, Hadoop1, {HDFS1, keytab1, Quota1}, {Yarn1, queue1, {CPU-count1, memory-count1}}}; if the user 1's ID at the business level is Y1 and the Hadoop platform ID is HN1, then in the two-dimensional multitree including the user plane and the resource plane after numerical substitution, the user's business name Y1 is used as the root node with a depth of 0, and in the node with a depth of 1, the part involving the Hadoop platform is recorded with the user's ID name HN1 in the Hadoop platform as the tree node, and in the node with a depth of 3, {keytab1, Quota1} is recorded as the HDFS tree node, and in the node with a depth of 3, {queue1, {CPU-count1, memory-count1}} is recorded as the Yarn tree node, and so on, to form a multi-dimensional multitree of the user plane and the resource plane.
[0112] Furthermore, the step of modifying the usage corresponding to each node in the two-dimensional multi-branch tree based on the application subscription record and the call record to obtain the master data multi-branch tree of the system includes at least one of the following:
[0113] Based on the application subscription record and the call record, the usage of applications not subscribed by the user and unused tool components in the two-dimensional multi-branch tree including the user plane and the resource plane are recorded as zero, so as to obtain the master data multi-branch tree corresponding to the full amount of applications of the user: based on the application subscription record and the call record, each node in the two-dimensional multi-branch tree including the user plane and the resource plane is traversed, and the usage corresponding to each node of the two-dimensional multi-branch tree is modified to obtain the master data multi-branch tree corresponding to the full amount of applications of the user.
[0114] Among them, by recording the usage of applications not subscribed by the user and unused tool components in the two-dimensional multi-branch tree including the user plane and the resource plane as zero, a two-dimensional multi-branch tree that retains the applications subscribed by the user and the tool components used can be obtained, that is, the master data multi-branch tree corresponding to the full amount of applications of the user is obtained.
[0115] Furthermore, based on the application subscription record and the call record, the longest application architecture multitree TA of user A (a total of S objects) traverses s in the 1-S value range for each element TAs in the longest application architecture multitree to form the main data multitree TK of user A; and modifies the usage corresponding to each node of the two-dimensional multitree to obtain the main data multitree of the full application corresponding to the user.
[0116] For example, for the full application F, the full application involved by user A, each element TAs in the longest application architecture multitree TA, the application object set contained in TAs is U, and the object with component resource quantity marked as 0 is described as follows:
[0117] Traverse the set K, and for the element Fh that does not belong to the set U, record {Th1, Uh1, 0}, {Th2, Uh2, 0}, ..., {Thn, Uhn, 0}.
[0118] In this embodiment, the user and application subscription relationship, as well as the business data are integrated into data units, and the nodes with a depth of 2 in the application architecture multi-tree are associated to replace the original multi-tree node values with data units, thereby building system master data. This aims to solve the problem of application metadata standardization and unified logical access. Compared with the current method 2, this embodiment does not rely on the complexity of the master data, is more versatile, and is more suitable for standard acquisition and unified management of master data in ultra-large-scale systems and complex business operation scenarios, and is suitable for module operation entities and master data management of different systems and applications.
[0119] Furthermore, the nodes of the application architecture multitree are associated with the multidimensional array to realize the construction of the master data multitree of the architecture, users and resources. After data injection, the data is multidimensionally reorganized and single-valued replaced to realize the construction of the master data multitree, which can improve the maintenance and management efficiency of the system master data.
[0120] This application also provides a system master data storage device, please refer to Figure 4 , the system main data storage device comprises:
[0121] The application architecture multi-branch tree construction module 10 is used to construct the application architecture multi-branch tree corresponding to the user's full application based on the application set included in the system and the call records of the application subscribed by the user to the tool component;
[0122] A two-dimensional multi-branch tree construction module 20, for mapping users to nodes in the application architecture multi-branch tree based on the association relationship between users and historically ordered applications, to obtain a two-dimensional multi-branch tree including a user plane and a resource plane, wherein the association relationship is determined based on application ordering records;
[0123] The master data multi-branch tree construction module 30 is used to modify the usage corresponding to each node in the two-dimensional multi-branch tree based on the application ordering record and the call record to obtain the master data multi-branch tree of the system, so as to associate and store the system master data based on the master data multi-branch tree.
[0124] Optionally, the two-dimensional multi-branch tree construction module 20 includes:
[0125] A first construction submodule is used to construct the longest application architecture multi-branch tree of the application corresponding to the user based on the application architecture multi-branch tree of the full application and the data storage set, wherein the data storage set includes each node element of the application architecture multi-branch tree of the full application;
[0126] The second construction submodule is used to map the user to each node in the longest application architecture multi-branch tree based on the association relationship to obtain a two-dimensional multi-branch tree including a user plane and a resource plane.
[0127] The second construction submodule includes:
[0128] The first multi-branch tree construction unit is used to map the user's identity identifier with the tool component called by the application in the longest application architecture multi-branch tree, other tools associated with the tool component, component modules corresponding to the tool component and other tools, and the IP address of the component module one by one based on the association relationship, and map the application resource quantity corresponding to the application ordered by the user with the tool component called by the application in the longest application architecture multi-branch tree, other tools associated with the tool component, component modules of the tool component, and the IP address of the component one by one to obtain a two-dimensional multi-branch tree including a user plane and a resource plane, wherein the application resource quantity is measured based on the usage of the tool component called by the user corresponding to the full amount of applications.
[0129] The first construction submodule includes:
[0130] A binary group construction unit, configured to construct a binary group based on a plurality of application nodes in the multi-branch tree of the application architecture of the full application and each tool component node corresponding to each of the application nodes;
[0131] The deduplication unit is used to determine whether the entities corresponding to the two tuples are consistent. If they are consistent, the consistent two tuples are deduplicated.
[0132] An arranging unit, used to arrange the deduplicated binary groups in a calling order to obtain the longest calling logic chain of each of the application nodes;
[0133] A logic chain construction unit, configured to construct the longest call logic chain of the user's corresponding full application based on the longest call logic chain of each of the application nodes and the call relationship between each of the tool component nodes and the corresponding components and component addresses;
[0134] The second multi-branch tree construction unit is used to construct the longest application architecture multi-branch tree of the full application corresponding to the user based on the longest call logic chain of the full application corresponding to the user.
[0135] The main data multi-branch tree construction module 30 includes at least one of the following:
[0136] A usage determination submodule is used to record the usage of applications not subscribed by the user and unused tool components in the two-dimensional multi-branch tree including the user plane and the resource plane as zero based on the application subscription record and the call record, so as to obtain a master data multi-branch tree corresponding to all applications of the user;
[0137] The usage modification submodule is used to traverse each node in the two-dimensional multi-branch tree including the user plane and the resource plane based on the application subscription record and the call record, and modify the usage corresponding to each node of the two-dimensional multi-branch tree to obtain the master data multi-branch tree corresponding to the full application of the user.
[0138] The application architecture multi-tree construction module 10 includes:
[0139] A calling submodule, which is used to determine, based on the application set included in the system, the tool component required to be called for the application to run, other tools associated with the tool component, the component module of the tool component, and the specific instance of the component module during operation;
[0140] A traversal submodule, used to traverse the call records of the tool component corresponding to the full application of the user, other tools associated with the tool component, component modules of the tool component, and specific instances of the component during operation, to determine the tool component, other tools, component modules and IP addresses of the component modules corresponding to the full application respectively;
[0141] The third construction submodule is used to construct an application architecture multi-branch tree of the full application based on the tool components, other tools, component modules and IP addresses of the component modules respectively corresponding to the full application.
[0142] The system master data storage device provided by the present application adopts the system master data storage method in the above embodiment, which can solve the technical problem of system master data storage. Compared with the prior art, the beneficial effects of the system master data storage device provided by the present application are the same as the beneficial effects of the system master data storage method provided by the above embodiment, and other technical features in the system master data storage device are the same as the features disclosed in the above embodiment method, which will not be repeated here.
[0143] The present application provides a system master data storage device, which includes: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute the system master data storage method in the above-mentioned embodiment one.
[0144] Reference below Figure 5 , which shows a schematic diagram of the structure of a system master data storage device suitable for implementing the embodiment of the present application. The system master data storage device in the embodiment of the present application may include but is not limited to mobile terminals such as mobile phones, laptop computers, digital broadcast receivers, PDAs (Personal Digital Assistants), PADs (Portable Application Descriptions), PMPs (Portable Media Players), vehicle-mounted terminals (such as vehicle-mounted navigation terminals), etc., and fixed terminals such as digital TVs, desktop computers, etc. Figure 5 The system master data storage device shown is merely an example and should not bring any limitation to the functions and scope of use of the embodiments of the present application.
[0145] like Figure 5As shown, the system main data storage device may include a processing device 1001 (e.g., a central processing unit, a graphics processor, etc.), which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM: Read Only Memory) 1002 or a program loaded from a storage device 1003 to a random access memory (RAM: Random Access Memory) 1004. In RAM1004, various programs and data required for the operation of the system main data storage device are also stored. The processing device 1001, ROM1002, and RAM1004 are connected to each other through a bus 1005. An input / output (I / O) interface 1006 is also connected to the bus. Generally, the following systems can be connected to the I / O interface 1006: an input device 1007 including, for example, a touch screen, a touch pad, a keyboard, a mouse, an image sensor, a microphone, an accelerometer, a gyroscope, etc.; an output device 1008 including, for example, a liquid crystal display (LCD: Liquid Crystal Display), a speaker, a vibrator, etc.; a storage device 1003 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 1009. The communication device 1009 can allow the system master data storage device to communicate with other devices wirelessly or by wire to exchange data. Although the figure shows a system master data storage device with various systems, it should be understood that it is not required to implement or have all the systems shown. More or fewer systems can be implemented or have alternatively.
[0146] In particular, according to the embodiments disclosed in the present application, the process described above with reference to the flowchart can be implemented as a computer software program. For example, the embodiments disclosed in the present application include a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network through a communication device, or installed from a storage device 1003, or installed from a ROM 1002. When the computer program is executed by the processing device 1001, the above-mentioned functions defined in the method of the embodiment disclosed in the present application are executed.
[0147] The system master data storage device provided by the present application adopts the system master data storage method in the above embodiment, which can solve the technical problem of system master data storage. Compared with the prior art, the beneficial effects of the system master data storage device provided by the present application are the same as the beneficial effects of the system master data storage method provided by the above embodiment, and other technical features in the system master data storage device are the same as the features disclosed in the method of the previous embodiment, which will not be repeated here.
[0148] It should be understood that the various parts disclosed in this application can be implemented by hardware, software, firmware or a combination thereof. In the description of the above embodiments, specific features, structures, materials or characteristics can be combined in any one or more embodiments or examples in a suitable manner.
[0149] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art who is familiar with the present technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.
[0150] The present application provides a computer-readable storage medium having computer-readable program instructions (ie, computer programs) stored thereon, wherein the computer-readable program instructions are used to execute the system master data storage method in the above-mentioned embodiment.
[0151] The computer-readable storage medium provided in the present application may be, for example, a USB flash drive, but is not limited to electrical, magnetic, optical, electromagnetic, infrared, or semiconductor systems, systems or devices, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In this embodiment, the computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, system or device. The program code contained on the computer-readable storage medium may be transmitted using any appropriate medium, including but not limited to: wires, optical cables, RF (Radio Frequency), etc., or any suitable combination of the above.
[0152] The computer-readable storage medium may be included in the system main data storage device; or may exist independently without being assembled into the system main data storage device.
[0153] The computer-readable storage medium carries one or more programs. When the one or more programs are executed by the system main data storage device, the system main data storage device becomes: system main data storage.
[0154] Computer program code for performing the operations of the present application may be written in one or more programming languages or a combination thereof, including object-oriented programming languages such as Java, Smalltalk, C++, and conventional procedural programming languages such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., via the Internet using an Internet service provider).
[0155] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present application. In this regard, each square box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and the module, the program segment or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the square box can also occur in a sequence different from that marked in the accompanying drawings. For example, two square boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.
[0156] The modules involved in the embodiments described in this application may be implemented by software or hardware. The system master data storage method, device, equipment, storage medium and program product of the module do not constitute a limitation on the unit itself under certain circumstances.
[0157] The readable storage medium provided by the present application is a computer-readable storage medium, which stores computer-readable program instructions (i.e., computer programs) for executing the above-mentioned system master data storage method, and can solve the technical problem of system master data storage. Compared with the prior art, the beneficial effects of the computer-readable storage medium provided by the present application are the same as the beneficial effects of the system master data storage method provided by the above-mentioned embodiment, and will not be described in detail here.
[0158] The present application also provides a computer program product, including a computer program, which implements the steps of the system master data storage method as described above when executed by a processor.
[0159] The computer program product provided by this application can solve the technical problem of system master data storage. Compared with the prior art, the beneficial effects of the computer program product provided by this application are the same as the beneficial effects of the system master data storage method provided by the above embodiment, which will not be repeated here.
[0160] The above descriptions are only some embodiments of the present application, and are not intended to limit the patent scope of the present application. All equivalent structural changes made using the contents of the present application specification and drawings under the technical concept of the present application, or direct / indirect applications in other related technical fields are included in the patent protection scope of the present application.
Claims
1. A method for storing system master data, It is characterized in that The method includes: Based on the application set included in the system and the call records of the tool components of the applications subscribed by the user, a multi-branch tree of the application architecture corresponding to the user's full application is constructed; Based on the association relationship between the user and the historically subscribed application, the user is mapped to each node in the multi-branch tree of the application architecture to obtain a two-dimensional multi-branch tree including a user plane and a resource plane, wherein the association relationship is determined based on the application subscription record; Based on the application ordering record and the calling record, the usage corresponding to each node in the two-dimensional multi-branch tree is modified to obtain the master data multi-branch tree of the system, so as to associate and store the system master data based on the master data multi-branch tree.
2. The method according to claim 1, It is characterized in that The step of mapping the user to each node in the multi-branch tree of the application architecture based on the association relationship between the user and the historical subscription application to obtain a two-dimensional multi-branch tree including a user plane and a resource plane includes: Based on the application architecture multitree of the full application and the data storage set, construct the longest application architecture multitree of the application corresponding to the user, wherein the data storage set includes each node element of the application architecture multitree of the full application; Based on the association relationship, the user is mapped to each node in the longest application architecture multi-branch tree to obtain a two-dimensional multi-branch tree including a user plane and a resource plane.
3. The method according to claim 2, It is characterized in that The step of mapping the user to each node in the longest application architecture multitree based on the association relationship to obtain a two-dimensional multitree including a user plane and a resource plane includes: Based on the association relationship, the user's identity is mapped one by one with the tool components called by the application in the longest application architecture multi-branch tree, other tools associated with the tool components, component modules corresponding to the tool components and other tools, and the IP addresses of the component modules, and the application resource quantities corresponding to the applications subscribed by the user are mapped one by one with the tool components called by the application in the longest application architecture multi-branch tree, other tools associated with the tool components, component modules of the tool components, and the IP addresses of the components, to obtain a two-dimensional multi-branch tree including a user plane and a resource plane, wherein the application resource quantity is measured based on the usage of the tool components called by the user corresponding to the full amount of applications.
4. The method according to claim 2, It is characterized in that The step of constructing the longest application architecture multitree of the user's corresponding application based on the application architecture multitree of the full application and the data storage set includes: Constructing a tuple based on multiple application nodes in the multi-branch tree of the application architecture of the full application and each tool component node corresponding to each application node; Determine whether the entities corresponding to each pair of binary tuples are consistent. If they are consistent, perform deduplication on the consistent binary tuples. Arrange the deduplicated tuples in the order of calling to obtain the longest calling logic chain of each application node; Based on the longest call logic chain of each of the application nodes and the call relationship between each of the tool component nodes and the corresponding components and component addresses, the longest call logic chain of the user's corresponding full application is constructed; Based on the longest calling logic chain of the full application corresponding to the user, a longest application architecture multi-branch tree of the full application corresponding to the user is constructed.
5. The method according to claim 1, It is characterized in that The step of modifying the usage corresponding to each node in the two-dimensional multi-branch tree based on the application subscription record and the call record to obtain the master data multi-branch tree of the system includes at least one of the following: Based on the application subscription record and the call record, the usage of the applications not subscribed by the user and the unused tool components in the two-dimensional multi-branch tree including the user plane and the resource plane are recorded as zero, so as to obtain the master data multi-branch tree corresponding to the full amount of applications of the user; Based on the application subscription record and the call record, each node in the two-dimensional multi-branch tree including the user plane and the resource plane is traversed, and the usage corresponding to each node of the two-dimensional multi-branch tree is modified to obtain the master data multi-branch tree of the full application corresponding to the user.
6. The method according to claim 1, It is characterized in that The step of constructing a multi-branch tree of application architecture corresponding to the full amount of applications of the user based on the application set included in the system and the call record of the tool component by the application subscribed by the user includes: Based on the application set included in the system, determine the tool component required to be called for the application to run, other tools associated with the tool component, component modules of the tool component, and specific instances of the component modules during operation; Traverse the call records of the tool component corresponding to the full application of the user, other tools associated with the tool component, component modules of the tool component, and specific instances of the component during operation, and determine the tool component, other tools, component modules and IP addresses of the component modules corresponding to the full application respectively; Based on the tool components, other tools, component modules and IP addresses of component modules respectively corresponding to the full application, a multi-branch tree of the application architecture of the full application is constructed.
7. A system master data storage device, It is characterized in that The device comprises: The application architecture multi-tree construction module is used to build the application architecture multi-tree corresponding to the user's full application based on the application set included in the system and the call records of the tool components of the application subscribed by the user; A two-dimensional multi-branch tree construction module, used to map users to each node in the application architecture multi-branch tree based on the association relationship between users and historically ordered applications, to obtain a two-dimensional multi-branch tree including a user plane and a resource plane, wherein the association relationship is determined based on application ordering records; The master data multi-branch tree construction module is used to modify the usage corresponding to each node in the two-dimensional multi-branch tree based on the application ordering record and the call record to obtain the master data multi-branch tree of the system, so as to associate and store the system master data based on the master data multi-branch tree.
8. A system master data storage device, It is characterized in that The device comprises: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the computer program is configured to implement the steps of the system master data storage method according to any one of claims 1 to 6.
9. A storage medium, It is characterized in that The storage medium is a computer-readable storage medium, and a computer program is stored on the storage medium. When the computer program is executed by a processor, the steps of the system master data storage method according to any one of claims 1 to 6 are implemented.
10. A computer program product, It is characterized in that The computer program product comprises a computer program, and when the computer program is executed by a processor, the steps of the system master data storage method according to any one of claims 1 to 6 are implemented.
