Data merging method and apparatus, electronic device, and storage medium

Abstract

This invention discloses a data merging and display method, apparatus, electronic device, and storage medium. Its features include: receiving full-path diagnostic data input by a user, extracting data from the full-path diagnostic data, and determining diagnostic indicator field objects; constructing node objects corresponding to the diagnostic indicator field objects based on the diagnostic indicator field objects, and determining the node names and node relationships of the node objects; wherein the node relationships include a list of child nodes and a parent node object of the node object; merging the diagnostic indicator field objects according to the node names and node relationships using a preset recursive method, and determining the target data path for merging the diagnostic indicator field objects. This achieves rapid merging processing of diagnostic data, improves the efficiency of data merging, and enables data to be displayed by path, thereby achieving efficient utilization of diagnostic data.

Description

Technical Field

[0001] This invention relates to the field of data processing, and more particularly to a data merging method, apparatus, electronic device, and storage medium. Background Technology

[0002] Data flow analysis is an important tool in data analysis. In clinical medicine, medical professionals often need multiple types of diagnostic data for treatment, resulting in a flow of diagnostic data generated during patient visits. By analyzing the flow of diagnostic data, medical professionals can make accurate intervention decisions based on clinical phenomena during diagnosis. However, diagnostic data contains multiple data types, and the data indicators corresponding to each type are different, with significant differences between the data, making it difficult to accurately merge and analyze the diagnostic data.

[0003] Current technologies typically involve staff merging and analyzing diagnostic data, which is labor-intensive, inefficient, and wastes significant human and material resources. Summary of the Invention

[0004] This invention provides a data merging method, apparatus, electronic device, and storage medium to achieve rapid and accurate merging of diagnostic data and generate data paths for the diagnostic data.

[0005] According to one aspect of the present invention, a data merging method is provided, comprising:

[0006] Receive full-path diagnostic data input by the user, extract data from the full-path diagnostic data, and determine diagnostic indicator field objects;

[0007] Based on the diagnostic indicator field object, construct the node object corresponding to the diagnostic indicator field object, and determine the node name and node relationship of the node object; wherein, the node relationship includes the list of child nodes and the parent node object of the node object;

[0008] Using a pre-defined recursive method, the diagnostic indicator field objects are merged based on the node name and node relationship to determine the target data path for merging the diagnostic indicator field objects.

[0009] According to another aspect of the present invention, a data merging apparatus is provided, comprising:

[0010] The data preprocessing module is used to receive the full-path diagnostic data input by the user, extract data from the full-path diagnostic data, and determine the diagnostic indicator field objects.

[0011] A node construction module is used to construct a node object corresponding to the diagnostic indicator field object based on the diagnostic indicator field object, and to determine the node name and node relationship of the node object; wherein, the node relationship includes the list of child nodes and the parent node object of the node object;

[0012] The data merging module is used to merge the diagnostic indicator field objects according to the node name and node relationship using a preset recursive method, and to determine the target data path for merging the diagnostic indicator field objects.

[0013] According to another aspect of the present invention, an electronic device is provided, the electronic device comprising:

[0014] At least one processor; and

[0015] A memory communicatively connected to the at least one processor; wherein,

[0016] The memory stores a computer program that can be executed by the at least one processor, the computer program being executed by the at least one processor to enable the at least one processor to perform the data merging method according to any embodiment of the present invention.

[0017] According to another aspect of the present invention, a computer-readable storage medium is provided, the computer-readable storage medium storing computer instructions for causing a processor to execute and implement the data merging method described in any embodiment of the present invention.

[0018] The technical solution of this invention receives full-path diagnostic data input by the user, extracts data from the full-path diagnostic data, and determines diagnostic indicator field objects. By obtaining the full-path diagnostic data, all diagnostic data can be intuitively obtained, which is beneficial for rapid data retrieval and reuse. Data extraction from the full-path diagnostic data determines each diagnostic indicator field object, and each diagnostic indicator field object corresponds to a diagnostic parameter, which can intuitively reflect the data content. Based on the diagnostic indicator field objects, node objects corresponding to the diagnostic indicator field objects are constructed, and the node names and node relationships of the node objects are determined. The node relationships include the list of child nodes and the parent node objects of the node objects. Based on the node objects constructed in the path according to the diagnostic indicator field objects, determining the path of the node objects determines the diagnostic indicator field objects, which improves the efficiency of data merging. Through a preset recursive method, the diagnostic indicator field objects are merged according to the node names and node relationships to determine the target data path for merging the diagnostic indicator field objects. By using node names and node relationships, the target data path for merging diagnostic data can be accurately determined, and the efficiency of data merging can be improved by using node relationships. This solves the technical problem in existing technologies that cannot quickly and accurately merge diagnostic data paths, improving the efficiency and accuracy of diagnostic data path merging. Furthermore, the data paths can be efficiently displayed through display devices, further enabling efficient utilization of diagnostic data.

[0019] It should be understood that the description in this section is not intended to identify key or essential features of the embodiments of the present invention, nor is it intended to limit the scope of the invention. Other features of the invention will become readily apparent from the following description. Attached Figure Description

[0020] To more clearly illustrate the technical solutions in the embodiments of the present invention, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0021] Figure 1 This is a flowchart of a data merging method provided in Embodiment 1 of the present invention;

[0022] Figure 2 A schematic diagram of a target data path provided for the implementation of this invention;

[0023] Figure 3 This is a flowchart of another data merging method provided in Embodiment 2 of the present invention;

[0024] Figure 4This is a flowchart illustrating another data merging method provided in an embodiment of the present invention.

[0025] Figure 5 This is a schematic diagram of the structure of a data merging device provided in Embodiment 3 of the present invention;

[0026] Figure 6 This is a schematic diagram of the structure of an electronic device that implements the data merging method of this invention. Detailed Implementation

[0027] To enable those skilled in the art to better understand the present invention, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings of the embodiments of the present invention. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort should fall within the scope of protection of the present invention.

[0028] Example 1

[0029] Figure 1 This is a flowchart of a data merging method provided in Embodiment 1 of the present invention. This embodiment is applicable to the merging of diagnostic data. The method can be executed by a data merging device, which can be implemented in hardware and / or software and can be configured in an electronic device. Figure 1 As shown, the method includes:

[0030] S110. Receive the full path diagnostic data input by the user, extract the data from the full path diagnostic data, and determine the diagnostic indicator field object.

[0031] The full-path diagnostic data can consist of all of a patient's diagnostic data. It should be noted that in the medical field, a patient possesses multiple diagnostic data points. Each diagnostic data point has at least one fixed data range used to determine whether the current diagnostic instruction record is within the normal range, thereby assessing the patient's health status. Diagnostic data points within a range are set as different diagnostic indicator field objects. All diagnostic indicator field objects within different data ranges are concatenated to determine the full-path diagnostic data for data merging.

[0032] Optionally, before obtaining the full-path diagnostic data, the data structure corresponding to the full-path diagnostic data can be stored using a preset method. For example, a key / value store can be used for data indexing. For instance, an Object or Map structure can be used in JavaScript. The diagnostic data for path merging is obtained, along with the data range corresponding to each diagnostic data point. A diagnostic indicator field object is generated for each diagnostic data point based on the data range. All diagnostic indicator field objects are concatenated to form the ID for storing the full-path diagnostic data, and the number of patients corresponding to the full-path diagnostic data is used as the attribute value for storing the full-path diagnostic data.

[0033] The diagnostic indicator field object can be the diagnostic indicator field object corresponding to each diagnostic data point. It should be noted that the full-path diagnostic data is composed of all concatenated diagnostic indicator field objects. Each diagnostic record has a corresponding diagnostic indicator field object used to store the diagnostic data, and then the full-path diagnostic data is iteratively extracted to extract the diagnostic indicator field objects.

[0034] Specifically, it receives full-path diagnostic data input from the user, extracts data from the input full-path diagnostic data, and sequentially extracts diagnostic indicator field objects from the full-path diagnostic data.

[0035] S120. Construct a node object corresponding to the diagnostic indicator field object based on the diagnostic indicator field object, and determine the node name and node relationship of the node object.

[0036] In this context, a node object can be an object that corresponds one-to-one with a diagnostic indicator field object in the data path. It's important to note that each diagnostic indicator field object has a corresponding node in the data path; the node object represents the positional relationship of the diagnostic indicator field object within the data path.

[0037] The node name can be the name displayed by the node in the data path. The node relationship can be the relationship between a node and other nodes in the data path. It can be understood that there are corresponding relationships between each node in the data path. Usually, the relationship between adjacent nodes is represented by the parent node and child node. The child node is used to represent the next level node of the current node, and the parent node is used to represent the previous level node of the current node. It is worth noting that the current node can have multiple child nodes, but has one and only one parent node.

[0038] The node relationship includes a list of child nodes and a parent node object of the node object; the list of child nodes can be used to record the names of all child nodes included in the node; the parent node object can be the object corresponding to the parent node of the current node.

[0039] When constructing a node object, obtain the diagnostic indicator field object, determine the node name of the node object based on the diagnostic indicator field object, and obtain the number of patients in the diagnostic indicator field object as the attribute value of the node object; determine the next level node of the node object based on the diagnostic indicator field object, determine the list of child nodes of the node object, and determine the parent node of the node object as the parent node object of the node object.

[0040] Specifically, obtain the diagnostic indicator field object, construct the corresponding node object based on the diagnostic indicator field object, determine the node name of the node object through the diagnostic indicator field object, and obtain the parent node object and child node list of the node object as the node relationship of the node object.

[0041] S130. Using a preset recursive method, the diagnostic indicator field objects are merged according to the node name and node relationship to determine the target data path for merging the diagnostic indicator field objects.

[0042] The preset recursive method can be understood as a pre-defined recursive method used to determine the data path of all diagnostic indicator field objects. For example, the preset recursive method may include a loop recursive method and / or a tail recursive method.

[0043] Optionally, by using a preset recursive method, after determining the target data path of the current diagnostic indicator field object, if there are still diagnostic indicator field objects that need to be merged, the next diagnostic indicator field object can be obtained and merged.

[0044] The target data path can be the data path of the diagnostic indicator field objects being merged.

[0045] Specifically, the corresponding node object is determined based on the diagnostic indicator field object. The node of the node object in the data path is determined by the node name and node relationship through a preset recursive method. The diagnostic indicator field objects corresponding to the node objects are merged to determine the target data path for merging the diagnostic indicator field objects.

[0046] Optionally, in another optional embodiment of the present invention, after merging all diagnostic indicator field objects, a target data path diagram corresponding to the merged target data path is determined based on the merged target data path. This target data path diagram displays the overall distribution of the diagnostic data flow, providing an intuitive and visual basis for medical-related prediction and analysis research. For example, Figure 2 This is a schematic diagram of a target data path provided for the implementation of the present invention. For example... Figure 2As shown, the target data path is constructed from PIMA (Pima Indians Diabetes Data Set) diagnostic data. The relationship between PIMA diagnostic data is displayed in a tree diagram, where the PIMA field serves as a virtual root node. Starting from the PIMA field, the data path is formed by all diagnostic indicator field objects.

[0047] The technical solution of this invention receives full-path diagnostic data input by the user, extracts data from the full-path diagnostic data, and determines diagnostic indicator field objects. By obtaining the full-path diagnostic data, all diagnostic data can be intuitively obtained, which is beneficial for rapid data retrieval and reuse. Data extraction from the full-path diagnostic data determines each diagnostic indicator field object, and each diagnostic indicator field object corresponds to a diagnostic parameter, which can intuitively reflect the data content. Based on the diagnostic indicator field objects, node objects corresponding to the diagnostic indicator field objects are constructed, and the node names and node relationships of the node objects are determined. The node relationships include the list of child nodes and the parent node objects of the node objects. Based on the node objects constructed in the path according to the diagnostic indicator field objects, determining the path of the node objects determines the diagnostic indicator field objects, which improves the efficiency of data merging. Through a preset recursive method, the diagnostic indicator field objects are merged according to the node names and node relationships to determine the target data path for merging the diagnostic indicator field objects. By using node names and node relationships, the target data path for merging diagnostic data can be accurately determined, and the efficiency of data merging can be improved by using node relationships. This solves the technical problem in existing technologies that cannot quickly and accurately merge diagnostic data paths, improving the efficiency and accuracy of diagnostic data path merging. Furthermore, the data paths can be efficiently displayed through display devices, further enabling efficient utilization of diagnostic data.

[0048] Example 2

[0049] Figure 3 This is a flowchart of another data merging method provided in Embodiment 2 of the present invention. The relationship between this embodiment and the above embodiments illustrates how to merge diagnostic indicator field objects based on node name and node relationship using the recursive method described above. Figure 3 As shown, the data merging method includes:

[0050] S310. Receive the full path diagnostic data input by the user, extract data from the full path diagnostic data, and determine the diagnostic indicator field object.

[0051] S320. Construct node objects corresponding to the pre-defined diagnostic indicator field objects, and determine the node names and node relationships of the node objects.

[0052] S330. Determine the objects to be merged in the diagnostic indicator field object through a preset recursive method, and obtain the node names and node relationships of the objects to be merged.

[0053] The objects to be merged can be diagnostic indicator field objects that need to be merged during the iterative merging process.

[0054] Optionally, in the data path, all data paths are child nodes of the root node of the data path. Starting from the root node of the data path, a data path including all diagnostic indicator field objects is formed. In this embodiment of the invention, the root node of the data is a pre-constructed virtual node. Therefore, when performing cyclic recursive merging through a cyclic recursive method, a diagnostic indicator field object needs to be determined as the object to be merged.

[0055] Specifically, a diagnostic indicator field object is determined as the object to be merged from the diagnostic indicator field objects through a recursive loop, and the node object corresponding to the diagnostic indicator field object is obtained. The node name and node relationship of the node object are used as the node name and node relationship of the object to be merged.

[0056] S340. Merge the diagnostic indicator field objects according to the node names and node relationships of the objects to be merged, determine the target data path for merging the diagnostic indicator field objects, and determine the node attribute value of the node object of each diagnostic indicator field object in the target data path.

[0057] The node attribute value can be the attribute value of the node object corresponding to the diagnostic indicator field object; the node attribute value is used to represent the number of patients included in the current node. Optionally, each diagnostic indicator field object has a corresponding number of patients. After merging the diagnostic indicator field objects and determining the nodes of the diagnostic indicator field objects in the data path, the node attribute values ​​of the node objects corresponding to the diagnostic indicator field objects are updated according to the patient data of the diagnostic indicator field objects. It is also necessary to update the node attribute values ​​corresponding to the parent node objects of the current node. Since the node attribute values ​​of the parent node objects of the current node have changed, the node attribute values ​​of the grandparent node objects and the great-grandparent node objects also need to be updated. Thus, the node attribute values ​​of each node object in the current data path are updated through a recursive loop.

[0058] Specifically, the objects to be merged are determined through a recursive loop. Based on the node names and node relationships of the objects to be merged, the nodes of the objects to be merged in the data path are determined. The diagnostic indicator field objects corresponding to the objects to be merged are merged, and the target data path for merging the diagnostic indicator field objects is determined. After determining the target data path for merging the diagnostic indicator field objects, the node attribute values ​​of the node objects corresponding to each diagnostic indicator field object in the target data path are determined.

[0059] Optionally, in another optional embodiment of the present invention, the step of merging the diagnostic indicator field objects according to the node names and node relationships of the objects to be merged, and determining the target data path for merging the diagnostic indicator field objects, includes:

[0060] If there is no target node object with the same node name as the object to be merged in the target data path, then the target data path for merging the diagnostic indicator field object is determined according to the node name and node relationship of the object to be merged, and the object to be merged is updated according to the recursive method.

[0061] The target node object can be a node object with the same name as the node object to be merged; the target node object is used to determine the target data path of the object to be merged.

[0062] Optionally, during the recursive merging process, the target data paths that have already been merged are obtained, all data paths that have been merged are determined, and then the node names of the objects to be merged are obtained. The node names of the objects to be merged are filtered in the target data paths, and it is determined whether there are any node objects with the same node names as the objects to be merged in the target data paths that have already been merged.

[0063] Specifically, the process involves obtaining the objects to be merged and determining their node names. The node names of the objects to be merged are then filtered through the target data path. It is determined whether any target data path already merged contains a node with the same node name as the object to be merged. If no target data path contains a node with the same node name as the object to be merged, the object to be merged is considered a new data path. A new data path is then determined based on the node name and node relationships of the object to be merged, serving as the target data path for the current diagnostic indicator field object. Finally, the object to be merged is updated according to the recursive loop method.

[0064] Optionally, after determining the target data path of the diagnostic indicator field object, the already merged target data path is updated according to the target data path of the diagnostic indicator field object through the recursive method, and the next object to be merged is merged according to the updated target data path.

[0065] Optionally, in another optional embodiment of the present invention, the step of recursively merging the diagnostic indicator field objects according to the node name and node relationship to determine the target data path for merging the diagnostic indicator field objects includes:

[0066] If a target node object with the same node name as the object to be merged exists in the target data path, then obtain the child node list of the target node object and the child node list of the object to be merged; determine the target data path for merging the object to be merged based on the child node list of the target node object and the child node list of the object to be merged.

[0067] Optionally, if a target node object with the same node name as the object to be merged exists in the target data path, it is necessary to obtain the child node objects of the object to be merged and the child node objects of the target node object. The target data path of the object to be merged is determined based on the child node objects of the object to be merged and the child node objects of the target node object, and the child node objects of the object to be merged and the child node objects of the target node object are obtained through the child node list of the object to be merged and the child node list of the target node object.

[0068] Specifically, the process involves obtaining the objects to be merged and determining their node names. The node names of the objects to be merged are then filtered through the target data path. It is determined whether any node objects with the same node name as the objects to be merged exist in the already merged target data path. If a target node object with the same node name as the object to be merged exists in the target data path, the child node objects of the objects to be merged and the child node objects of the target node object are obtained through the child node lists of the objects to be merged and the target node object. Finally, the target data path for merging the objects to be merged is determined based on the child node objects of the objects to be merged and the child node objects of the target node object.

[0069] Optionally, in another optional embodiment of the present invention, the step of recursively merging the diagnostic indicator field objects according to the node name and node relationship to determine the target data path for merging the diagnostic indicator field objects includes:

[0070] If the list of child nodes of the object to be merged does not contain any child node objects, the object to be merged is updated according to a preset recursive method.

[0071] Specifically, obtain the list of child nodes of the object to be merged, determine whether there are child node objects in the list of child nodes of the object to be merged, if there are no child node objects in the list of child nodes of the object to be merged, it means that the current object to be merged has been merged and no further merging is needed, then update the object to be merged according to the preset recursive method.

[0072] Optionally, in another optional embodiment of the present invention, the step of recursively merging the diagnostic indicator field objects according to the node name and node relationship to determine the target data path for merging the diagnostic indicator field objects includes:

[0073] If the child node list of the object to be merged contains child node objects, then the object to be merged is updated according to the child node list of the object to be merged; if the child node list of the target node object does not contain a child node object with the same node name as the object to be merged, then the object to be merged is added to the child node list of the target node object; the target data path for merging the diagnostic indicator field objects is determined according to the target data path of the target node object and the child node list, and the object to be merged is updated according to a preset recursive method.

[0074] Optionally, obtain the list of child nodes of the object to be merged. If there are child node objects in the list of child nodes of the object to be merged, since there are target node objects with the same node names as the object to be merged in the target data path that has already been merged, it is necessary to determine the target data path of the object to be merged based on the child nodes of the object to be merged and the child nodes of the target node objects, and then obtain the child node objects in the list of child nodes and update the child node objects to the object to be merged.

[0075] Specifically, the process involves obtaining the list of child nodes of the object to be merged, determining whether any child node objects exist in the list, and updating the object to be merged according to its child node list. The process also involves determining whether any child node objects with the same name as the object to be merged exist in the target node object's child node list. If no such child node object exists, it indicates that the object to be merged is a new data path within the target node object, and the object to be merged is added to the target node object's child node list. Finally, the target data path for merging the diagnostic indicator field objects is determined based on the target data path and child node list of the target node object, and the object to be merged is updated according to a preset recursive method.

[0076] Optionally, after adding the object to be merged to the child node list of the target node object, the node relationship of the object to be merged is modified according to the target data path and child node list of the target node object, and the parent node object of the object to be merged is modified to the target node object.

[0077] Optionally, in another optional embodiment of the present invention, the step of recursively merging the diagnostic indicator field objects according to the node name and node relationship to determine the target data path for merging the diagnostic indicator field objects includes:

[0078] If the target node object's child node list contains a child node object with the same name as the object to be merged, then the child node object of the object to be merged is determined based on the child node list of the object to be merged; the object to be merged is updated based on the child node object using the recursive loop method, and the operation of obtaining the node name and node relationship of the object to be merged is returned.

[0079] Optionally, if there is a child node object with the same name as the node object to be merged in the child node list of the target node object, it means that there is a child node object in the target data path that corresponds to the node object of the diagnostic indicator field object in the previous loop, and the loop needs to be continued through the recursive method.

[0080] Specifically, the process involves obtaining the list of child nodes of the object to be merged, determining whether any child node objects exist in the list, and updating the object to be merged based on its child node list. The process also involves determining whether any child node objects with the same name as the target object exist in its child node list. If such child node objects exist, the list of child nodes determines the child node objects of the target object. A pre-defined recursive method is then used to continue updating the target object based on its child node objects, and the process returns to retrieve the node names and relationships of the target object.

[0081] The technical solution of this invention receives full-path diagnostic data input by the user, extracts data from the full-path diagnostic data, and determines diagnostic indicator field objects; constructs node objects corresponding to the diagnostic indicator field objects based on the diagnostic indicator field objects, and determines the node names and node relationships of the node objects; determines the objects to be merged in the diagnostic indicator field objects through a recursive loop method, and obtains the node names and node relationships of the objects to be merged; improves the efficiency of data merging by recursively merging the diagnostic indicator field objects sequentially by determining the objects to be merged; merges the diagnostic indicator field objects according to the node names and node relationships of the objects to be merged, determines the target data path for merging the diagnostic indicator field objects, and determines the node attribute values ​​of the node objects of each diagnostic indicator field object in the target data path. By using node names and node relationships, the target data path for merging diagnostic data can be accurately determined. Furthermore, by leveraging node relationships, the efficiency of data merging can be improved. During the merging process, the node attribute values ​​of node objects are updated, further reducing the merging steps and increasing efficiency. This solves the technical problem of existing technologies being unable to quickly and accurately merge diagnostic data paths, improving the efficiency and accuracy of diagnostic data path merging. Moreover, the data paths can be efficiently displayed through display devices, further enabling efficient utilization of diagnostic data.

[0082] Optional, Figure 4 This is a flowchart illustrating another data merging method provided in an embodiment of the present invention. Wherein, as... Figure 4 As shown:

[0083] S410, Define the data structure.

[0084] Specifically, an array for storing data paths is pre-established, and each data path is stored sequentially in the array; based on the Map structure, the diagnostic data for the entire path is pre-established, and all diagnostic indicator field objects are concatenated as the ID for storing the diagnostic data for the entire path. The number of patients corresponding to the diagnostic data for the entire path is used as the attribute value for storing the diagnostic data for the entire path. An object structure for storing the diagnostic indicator field objects is also established.

[0085] S420, full-path diagnostic data loading.

[0086] Specifically, input the medical diagnosis record, and load the corresponding full-path diagnosis data based on the medical record.

[0087] In this example, a Map data structure is used: the key in the Map is the full-path diagnostic data ID, and the value in the Map is the number of patients common to all full-path diagnostic data. The full-path diagnostic data ID is obtained by concatenating the diagnostic indicator word ID of the diagnostic indicator field object. Furthermore, the full-path diagnostic data ID can be split into the diagnostic indicator word IDs of the diagnostic indicator field objects. The advantages of using the Map data structure are: with the same amount of memory, a Map can store more key-value pairs; inserting into a Map is relatively fast in all browsers, especially suitable for large-scale insert operations; and the Map interface and performance are also better for deletion operations. Therefore, a Map data structure is used as a memory function, providing the physical support for the data in memory.

[0088] It should be noted that the technical solution of this embodiment of the invention also supports memory functions and provides data caching. If the data has been processed before, the processed data can be used directly for content display without the need for reading and data processing again.

[0089] S430: Has the segmentation processing of the full-path diagnostic data been completed? If yes, proceed to S450; otherwise, proceed to S440.

[0090] Specifically, the full-path diagnostic data is split into separate diagnostic indicator field objects, and it is determined whether the full-path diagnostic data has been split completely. If the split is complete, step S450 is executed; otherwise, step S440 is executed.

[0091] S440, Construct node objects.

[0092] Specifically, the split diagnostic indicator field objects are iteratively constructed to determine the corresponding node objects and their basic information. The basic information of each node object includes: its display name, attribute values, list of child nodes, and parent node object.

[0093] In this embodiment, a loop is used to construct the basic information of each node object, which mainly includes the display name; the attribute values ​​of the node object, which are mainly used for display purposes. In the subsequent recursive merge algorithm, the attribute values ​​of the node object can be updated according to the number of child nodes of the node object; the list of child nodes of the node object, since there may be multiple child nodes of the node object, an array can be used to store the list of child nodes of the node object; and the parent node object of the node object, which can only have one parent node object.

[0094] Establish the parent-child relationship of node objects. Since the newly created node object is the next node on the data path, this node object will be a child node of the previous node object. Finally, it is necessary to record the number of patients in the root node. The number of patients in the root node is the sum of the number of patients under the root node.

[0095] S450. Has path merging been completed? If yes, proceed to S470; otherwise, proceed to S460.

[0096] S460. Perform cyclic recursive merging using a preset recursive method.

[0097] Specifically, during data path merging, a virtual root node is created to serve as the starting point for all data paths. All diagnostic indicator field objects are processed recursively. The recursive processing process is as follows: First, find the node object corresponding to the first diagnostic indicator field object as the object to be merged. Then, filter out the target node objects with the same node name as the object to be merged from the merged target data paths. If such a target node object exists, enter the recursive search process.

[0098] Alternatively, the recursive search process is as follows:

[0099] Check if the child nodes of the object to be merged are the same as the child nodes of the target object. If both the object to be merged and the target object have child nodes, loop through the child node list of the object to be merged and check if the node names of the child nodes in the two lists are the same. If the child node names in the child node lists of the two lists are exactly the same, end the loop.

[0100] If the object to be merged has no child nodes, the loop ends.

[0101] If there are child node objects with different names in the child node lists of the two objects, it indicates that the current child node object is a new path. The current child node object is then added to the child node list of the target node object, and its node relationships are modified. Since the object to be merged is added to the target node object, the attribute values ​​of the parent node object of the object to be merged change. The attribute values ​​of the object to be merged need to be added to the attribute values ​​of the target node object. This process is repeated from the target node object to the root node of the target data path, updating the attribute values ​​of other node objects from bottom to top.

[0102] If the target node object's child node list contains a child node object with the same name as the object to be merged, then the child node object of the object to be merged is determined based on the child node list of the object to be merged. The object to be merged is then updated based on the child node object using a preset recursive method, and the operation of executing the recursive search process is returned.

[0103] If the target node object does not exist, it means that the object to be merged is a new path, so it needs to be saved and added to the merged target data path. The target data path is then updated for later use, and the current loop ends.

[0104] If the amount of data being processed is large, and there are many diagnostic indicator fields to handle, there is a risk of stack overflow during recursive path lookup. In cases where stack overflow is a risk, the default recursive algorithm can be a tail-recursive method, employing a PTC (Proper Tail Call) approach. The advantage of this is that there is no stack depth limitation, ensuring fast path merging.

[0105] S470. Clean up the data. For the merged diagnostic indicator field objects, the diagnostic indicator field objects store the node relationships corresponding to the diagnostic indicator field objects. The node relationships of the diagnostic indicator field objects will affect the display of the tree diagram corresponding to the target data path. The node relationships corresponding to the diagnostic indicator field objects can be deleted in a loop recursively to remove circular references, release memory, and improve the efficiency of data merging.

[0106] Furthermore, data sorting can be performed. The node names of the corresponding node objects for the diagnostic indicator field objects are sorted in ascending order, and then the sorted diagnostic indicator field object segments are displayed for easy browsing and viewing according to common habits.

[0107] The technical solution of this invention can solve the technical problem of the inability to quickly and accurately merge diagnostic data paths in the prior art, improve the efficiency and accuracy of diagnostic data path merging, and enable efficient display of data paths through display devices, thereby further realizing the efficient utilization of diagnostic data.

[0108] Example 3

[0109] Figure 5 This is a schematic diagram of a data merging device provided in Embodiment 3 of the present invention. Figure 5 As shown, the device includes: a data preprocessing module 510, a node construction module 520, and a data merging module 540, wherein,

[0110] The data preprocessing module 510 is used to receive the full-path diagnostic data input by the user, and to extract data from the full-path diagnostic data to determine the diagnostic indicator field object.

[0111] The node construction module 520 is used to construct a node object corresponding to the diagnostic indicator field object based on the diagnostic indicator field object, and to determine the node name and node relationship of the node object; wherein, the node relationship includes the child node list and parent node object of the node object;

[0112] The data merging module 530 is used to merge the diagnostic indicator field objects according to the node name and node relationship using a preset recursive method, and to determine the target data path for merging the diagnostic indicator field objects.

[0113] The technical solution of this invention receives full-path diagnostic data input by the user, extracts data from the full-path diagnostic data, and determines diagnostic indicator field objects. By obtaining the full-path diagnostic data, all diagnostic data can be intuitively obtained, which is beneficial for rapid data retrieval and reuse. Data extraction from the full-path diagnostic data determines each diagnostic indicator field object, and each diagnostic indicator field object corresponds to a diagnostic parameter, which can intuitively reflect the data content. Based on the diagnostic indicator field objects, node objects corresponding to the diagnostic indicator field objects are constructed, and the node names and node relationships of the node objects are determined. The node relationships include the list of child nodes and the parent node objects of the node objects. Based on the node objects constructed in the path according to the diagnostic indicator field objects, determining the path of the node objects determines the diagnostic indicator field objects, which improves the efficiency of data merging. Through a preset recursive method, the diagnostic indicator field objects are merged according to the node names and node relationships to determine the target data path for merging the diagnostic indicator field objects. By using node names and node relationships, the target data path for merging diagnostic data can be accurately determined, and the efficiency of data merging can be improved by using node relationships. This solves the technical problem in existing technologies that cannot quickly and accurately merge diagnostic data paths, improving the efficiency and accuracy of diagnostic data path merging. Furthermore, the data paths can be efficiently displayed through display devices, further enabling efficient utilization of diagnostic data.

[0114] Optionally, the data merging module is specifically used for:

[0115] The method described above is used to determine the objects to be merged in the diagnostic indicator field object and to obtain the node names and node relationships of the objects to be merged.

[0116] The diagnostic indicator field objects are merged according to the node names and node relationships of the objects to be merged, the target data path for merging the diagnostic indicator field objects is determined, and the node attribute values ​​of the node objects of each diagnostic indicator field object in the target data path are determined.

[0117] Optionally, the data merging module is further used for:

[0118] If there is no target node object with the same node name as the object to be merged in the target data path, then the target data path for merging the diagnostic indicator field object is determined according to the node name and node relationship of the object to be merged, and the object to be merged is updated according to the recursive method.

[0119] Optionally, the data merging module is further used for:

[0120] If a target node object with the same node name as the object to be merged exists in the target data path, then obtain the child node list of the target node object and the child node list of the object to be merged.

[0121] The target data path for merging the objects to be merged is determined based on the list of child nodes of the target node object and the list of child nodes of the objects to be merged.

[0122] Optionally, the data merging module is further used for:

[0123] The child node objects of the objects to be merged are determined based on the list of child nodes of the objects to be merged;

[0124] If the child node list of the child node objects of the object to be merged does not contain any child node objects, then obtain the node names and node relationships of the child node objects of the object to be merged.

[0125] The target data path for merging the diagnostic indicator field objects is determined based on the node names and node relationships of the child node objects of the object to be merged, and the object to be merged is updated according to a preset recursive method.

[0126] Optionally, the data merging module is further used for:

[0127] If the child node list of the child node object contains child node objects, then update the object to be merged according to the child node list of the child node object;

[0128] If there is no child node object with the same name as the node to be merged in the child node list of the target node object, then the object to be merged is added to the child node list of the target node object.

[0129] The target data path for merging the diagnostic indicator field objects is determined based on the target data path and child node list of the target node object, and the objects to be merged are updated according to the recursive method.

[0130] Optionally, the data merging module is further used for:

[0131] If the target node object's child node list contains a child node object with the same name as the node object to be merged, then the child node object of the object to be merged is determined based on the child node list of the object to be merged.

[0132] Using a pre-defined recursive method, the object to be merged is updated based on the child node object, and the process returns to retrieve the node name and node relationship of the object to be merged.

[0133] The data merging device provided in the embodiments of the present invention can execute the data merging method provided in any embodiment of the present invention, and has the corresponding functional modules and beneficial effects of the method execution.

[0134] Example 4

[0135] Figure 6 A schematic diagram of an electronic device 10 that can be used to implement embodiments of the present invention is shown. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital processors, cellular phones, smartphones, wearable devices (e.g., helmets, glasses, watches, etc.), and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely illustrative and are not intended to limit the implementation of the invention described and / or claimed herein.

[0136] like Figure 6 As shown, the electronic device 10 includes at least one processor 11 and a memory, such as a read-only memory (ROM) 12 or a random access memory (RAM) 13, communicatively connected to the at least one processor 11. The memory stores computer programs executable by the at least one processor. The processor 11 can perform various appropriate actions and processes based on the computer program stored in the ROM 12 or loaded from storage unit 18 into the RAM 13. The RAM 13 may also store various programs and data required for the operation of the electronic device 10. The processor 11, ROM 12, and RAM 13 are interconnected via a bus 14. An input / output (I / O) interface 15 is also connected to the bus 14.

[0137] Multiple components in electronic device 10 are connected to I / O interface 15, including: input unit 16, such as keyboard, mouse, etc.; output unit 17, such as various types of displays, speakers, etc.; storage unit 18, such as disk, optical disk, etc.; and communication unit 19, such as network card, modem, wireless transceiver, etc. Communication unit 19 allows electronic device 10 to exchange information / data with other devices through computer networks such as the Internet and / or various telecommunications networks.

[0138] Processor 11 can be a variety of general-purpose and / or special-purpose processing components with processing and computing capabilities. Some examples of processor 11 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various special-purpose artificial intelligence (AI) computing chips, various processors running machine learning model algorithms, a digital signal processor (DSP), and any suitable processor, controller, microcontroller, etc. Processor 11 performs the various methods and processes described above, such as data merging methods.

[0139] In some embodiments, the data merging method may be implemented as a computer program tangibly contained in a computer-readable storage medium, such as storage unit 18. In some embodiments, part or all of the computer program may be loaded and / or mounted on electronic device 10 via ROM 12 and / or communication unit 19. When the computer program is loaded into RAM 13 and executed by processor 11, one or more steps of the data merging method described above may be performed. Alternatively, in other embodiments, processor 11 may be configured to perform the data merging method by any other suitable means (e.g., by means of firmware).

[0140] Various embodiments of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field-programmable gate arrays (FPGAs), application-specific integrated circuits (ASICs), application-specific standard products (ASSPs), systems-on-a-chip (SoCs), payload-programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various embodiments may include implementations in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which may be a dedicated or general-purpose programmable processor, capable of receiving data and instructions from a storage system, at least one input device, and at least one output device, and transmitting data and instructions to the storage system, the at least one input device, and the at least one output device.

[0141] Computer programs used to implement the methods of the present invention may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device, such that when executed by the processor, the computer programs cause the functions / operations specified in the flowcharts and / or block diagrams to be performed. The computer programs may be executed entirely on a machine, partially on a machine, or as a standalone software package, partially on a machine and partially on a remote machine, or entirely on a remote machine or server.

[0142] In the context of this invention, a computer-readable storage medium can be a tangible medium that may contain or store a computer program for use by or in conjunction with an instruction execution system, apparatus, or device. A computer-readable storage medium may include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatus, or devices, or any suitable combination thereof. Alternatively, a computer-readable storage medium may be a machine-readable signal medium. More specific examples of machine-readable storage media include electrical connections based on one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fibers, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination thereof.

[0143] To provide interaction with a user, the systems and techniques described herein can be implemented on an electronic device having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and pointing device (e.g., a mouse or trackball) through which the user provides input to the electronic device. Other types of devices can also be used to provide interaction with the user; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including sound input, voice input, or tactile input).

[0144] The systems and technologies described herein can be implemented in computing systems that include backend components (e.g., as data servers), or computing systems that include middleware components (e.g., application servers), or computing systems that include frontend components (e.g., user computers with graphical user interfaces or web browsers through which users can interact with implementations of the systems and technologies described herein), or any combination of such backend, middleware, or frontend components. The components of the system can be interconnected via digital data communication of any form or medium (e.g., communication networks). Examples of communication networks include local area networks (LANs), wide area networks (WANs), blockchain networks, and the Internet.

[0145] A computing system can include clients and servers. Clients and servers are generally located far apart and typically interact through communication networks. The client-server relationship is created by computer programs running on the respective computers and having a client-server relationship with each other. The server can be a cloud server, also known as a cloud computing server or cloud host, which is a hosting product within the cloud computing service system to address the shortcomings of traditional physical hosts and VPS services, such as high management difficulty and weak business scalability.

[0146] It should be understood that the various forms of processes shown above can be used, with steps reordered, added, or deleted. For example, the steps described in this invention can be executed in parallel, sequentially, or in different orders, as long as the desired result of the technical solution of this invention can be achieved, and this is not limited herein.

[0147] Example 5

[0148] This embodiment provides a computer-readable storage medium storing a computer program thereon. When executed by a processor, the program implements the data merging method steps provided in any embodiment of the present invention. The method includes:

[0149] Receive full-path diagnostic data input by the user, extract data from the full-path diagnostic data, and determine diagnostic indicator field objects;

[0150] Based on the diagnostic indicator field object, construct the node object corresponding to the diagnostic indicator field object, and determine the node name and node relationship of the node object; wherein, the node relationship includes the list of child nodes and the parent node object of the node object;

[0151] Based on the node name and node relationship, the diagnostic indicator field objects are recursively merged to determine the target data path for merging the diagnostic indicator field objects.

[0152] The computer storage medium of this invention can be any combination of one or more computer-readable media. A computer-readable medium can be a computer-readable signal medium or a computer-readable storage medium. For example, a computer-readable storage medium can be, but is not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples (a non-exhaustive list) of computer-readable storage media include: an electrical connection having one or more wires, a portable computer disk, a hard disk, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage device, magnetic storage device, or any suitable combination thereof. In this document, a computer-readable storage medium can be any tangible medium that contains or stores a program that can be used by or in conjunction with an instruction execution system, apparatus, or device.

[0153] Computer-readable signal media may include data signals propagated in baseband or as part of a carrier wave, carrying computer-readable program code. Such propagated data signals may take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. Computer-readable signal media may also be any computer-readable medium other than computer-readable storage media, capable of sending, propagating, or transmitting programs for use by or in connection with an instruction execution system, apparatus, or device.

[0154] Program code contained on a computer-readable medium may be transmitted using any suitable medium, including but not limited to: wireless, wire, optical fiber, RF, etc., or any suitable combination thereof.

[0155] Computer program code for performing the operations of this invention can be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages ​​such as Java, Smalltalk, and C++, as well as conventional procedural programming languages—such as the "C" language or similar programming languages. The program code can be executed entirely on the user's computer, partially on the user's computer, as a standalone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving remote computers, the remote computer can be connected to the user's computer via any type of network, including a local area network (LAN) or a wide area network (WAN), or it can be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0156] Those skilled in the art will understand that the modules or steps of the present invention described above can be implemented using general-purpose computing devices. They can be centralized on a single computing device or distributed across a network of multiple computing devices. Optionally, they can be implemented using computer-executable program code, thereby allowing them to be stored in a storage device for execution by a computing device, or they can be fabricated as separate integrated circuit modules, or multiple modules or steps can be fabricated as a single integrated circuit module. Thus, the present invention is not limited to any particular combination of hardware and software.

[0157] It should be understood that the various forms of processes shown above can be used, with steps reordered, added, or deleted. For example, the steps described in this invention can be executed in parallel, sequentially, or in different orders, as long as the desired result of the technical solution of this invention can be achieved, and this is not limited herein.

[0158] The specific embodiments described above do not constitute a limitation on the scope of protection of this invention. Those skilled in the art should understand that various modifications, combinations, sub-combinations, and substitutions can be made according to design requirements and other factors. Any modifications, equivalent substitutions, and improvements made within the spirit and principles of this invention should be included within the scope of protection of this invention.

Claims

1. A diagnostic data merging method characterized by, include: Receive full-path diagnostic data input by the user, extract data from the full-path diagnostic data, and determine diagnostic indicator field objects; Based on the diagnostic indicator field object, construct the node object corresponding to the diagnostic indicator field object, and determine the node name and node relationship of the node object; wherein, the node relationship includes the list of child nodes and the parent node object of the node object; Based on the node name and node relationship, the diagnostic indicator field objects are recursively merged to determine the target data path for merging the diagnostic indicator field objects. The node object also includes the number of patients per node; the step of recursively merging the diagnostic indicator field objects according to the node name and node relationship to determine the target data path for merging the diagnostic indicator field objects includes: The objects to be merged in the diagnostic indicator field object are determined by a preset recursive method, and the node names and node relationships of the objects to be merged are obtained. The diagnostic indicator field objects are merged according to the node names and node relationships of the objects to be merged, the target data path for merging the diagnostic indicator field objects is determined, and the node attribute values ​​of the node objects of each diagnostic indicator field object in the target data path are determined. After merging the diagnostic indicator field objects according to the node names and node relationships of the objects to be merged, and determining the target data path for merging the diagnostic indicator field objects, the method further includes: If the list of child nodes of the object to be merged contains child node objects, then the child node objects of the object to be merged are updated to the object to be merged.

2. The method of claim 1, wherein, The step of merging the diagnostic indicator field objects based on the node names and node relationships of the objects to be merged, and determining the target data path for merging the diagnostic indicator field objects, includes: If there is no target node object with the same node name as the object to be merged in the target data path, then the target data path for merging the diagnostic indicator field object is determined according to the node name and node relationship of the object to be merged, and the object to be merged is updated according to the recursive method.

3. The method of claim 1, wherein, The step of recursively merging the diagnostic indicator field objects based on the node name and node relationship to determine the target data path for merging the diagnostic indicator field objects includes: If a target node object with the same node name as the object to be merged exists in the target data path, then obtain the child node list of the target node object and the child node list of the object to be merged. The target data path for merging the objects to be merged is determined based on the list of child nodes of the target node object and the list of child nodes of the objects to be merged.

4. The method of claim 1, wherein, The step of using a preset recursive method to recursively merge the diagnostic indicator field objects based on the node names and node relationships, and determining the target data path for merging the diagnostic indicator field objects, includes: The child node objects of the objects to be merged are determined based on the list of child nodes of the objects to be merged; If the child node list of the child node objects of the object to be merged does not contain any child node objects, then obtain the node names and node relationships of the child node objects of the object to be merged. The target data path for merging the diagnostic indicator field objects is determined based on the node names and node relationships of the child node objects of the object to be merged, and the object to be merged is updated according to a preset recursive method.

5. The method of claim 1, wherein, The step of merging the diagnostic indicator field objects according to the node name and node relationship using a preset recursive method, and determining the target data path for merging the diagnostic indicator field objects, includes: If the child node list of the child node object contains child node objects, then update the object to be merged according to the child node list of the child node object; If there is no child node object with the same name as the node to be merged in the child node list of the target node object, then the object to be merged is added to the child node list of the target node object. The target data path for merging the diagnostic indicator field objects is determined based on the target data path and child node list of the target node object, and the objects to be merged are updated according to the recursive method.

6. The method of claim 1, wherein, The step of recursively merging the diagnostic indicator field objects according to the node name and node relationship using a preset recursive method to determine the target data path for merging the diagnostic indicator field objects further includes: If the target node object's child node list contains a child node object with the same name as the node object to be merged, then the child node object of the object to be merged is determined based on the child node list of the object to be merged. Using a pre-defined recursive method, the object to be merged is updated based on the child node object, and the process returns to retrieve the node name and node relationship of the object to be merged.

7. A data merging apparatus, characterized by comprising: include: The data preprocessing module is used to receive the full-path diagnostic data input by the user, extract data from the full-path diagnostic data, and determine the diagnostic indicator field objects. A node construction module is used to construct a node object corresponding to the diagnostic indicator field object based on the diagnostic indicator field object, and to determine the node name and node relationship of the node object; wherein, the node relationship includes the list of child nodes and the parent node object of the node object; The data merging module is used to merge the diagnostic indicator field objects according to the node name and node relationship using a preset recursive method, and to determine the target data path for merging the diagnostic indicator field objects. The data merging module is specifically used for: The objects to be merged in the diagnostic indicator field object are determined by a preset recursive method, and the node names and node relationships of the objects to be merged are obtained. The diagnostic indicator field objects are merged according to the node names and node relationships of the objects to be merged, the target data path for merging the diagnostic indicator field objects is determined, and the node attribute values ​​of the node objects of each diagnostic indicator field object in the target data path are determined. After merging the diagnostic indicator field objects according to the node names and node relationships of the objects to be merged, and determining the target data path for merging the diagnostic indicator field objects, the method further includes: If the list of child nodes of the object to be merged contains child node objects, then the child node objects of the object to be merged are updated to the object to be merged.

8. An electronic device, comprising: The electronic device includes: At least one processor; and A memory communicatively connected to the at least one processor; wherein, The memory stores a computer program that can be executed by the at least one processor to enable the at least one processor to perform the data merging method according to any one of claims 1-6.

9. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer instructions that cause a processor to execute the data merging method according to any one of claims 1-6.

Images