System data structured coding and addressing method

Abstract

The invention discloses a system data structured coding and addressing method. The method comprises the steps that a structure addressing space is constructed, an addressing space composed of multiple levels of nodes is established, the addressing space is used for representing a recording object of system data, a unique code is distributed to each node, and the unique codes are used for distinguishing different parts, organizations or recording units; reading the unique code, and acquiring the system data of the recording object from the corresponding node according to the unique code; node expansion: newly adding a subordinate node in the existing hierarchical structure according to the new system data of the recording object, and distributing a unique code for the newly added subordinate node; wherein before the structure nodes are expanded, quoted in a cross-system mode or used for automatic processing, a preset prepositive confirmation condition needs to be met.

Description

Technical Field

[0001] This invention relates to the field of systematic information data management technology, and in particular to a method for structured encoding and addressing of system data. Background Technology

[0002] With the continuous growth of modern systematic data, systematic data exhibits characteristics of multiple sources, multiple formats, and cross-periods. This is particularly evident in the medical field, where a large amount of medical diagnosis, treatment, and follow-up information is growing explosively. Moreover, these data come from multiple sources, have inconsistent formats, and span a wide time period.

[0003] Existing medical information systems primarily rely on text records, site descriptions, lesion descriptions, and manual input, lacking a unified structured coding method. This leads to the following common problems: inconsistent recording methods for the same site or tissue across different systems, making it difficult to establish data associations; medical imaging, pathology, examination, and follow-up data are stored in a decentralized manner, lacking structured referencing capabilities; data sharing across hospital areas, equipment, and time periods is costly and prone to semantic bias; there is a lack of compatibility and scalability for future additions to medical records or sub-levels; and electronic medical records, imaging systems, and pathology systems each use independent naming methods, lacking a unified retrieval and computation addressing mechanism.

[0004] Therefore, existing technologies urgently need a method for structured encoding and addressing of system data to improve the efficiency of system data utilization and long-term management capabilities. Summary of the Invention

[0005] To overcome the shortcomings of existing technologies, this invention provides a method for structured encoding and addressing of system data, which can improve data utilization efficiency and long-term management capabilities.

[0006] The technical solution adopted by this invention to solve its technical problem is: A method for structured encoding and addressing of system data includes: Construct a structural addressing space, establishing an addressing space composed of multi-level nodes to represent the recording objects of system data; assign a unique code to each node, the unique code being used to distinguish different parts, organizations, or recording units; Read the unique code, and based on the unique code, obtain the system data of the record object from the corresponding node; Node expansion involves adding sub-nodes to the existing hierarchical structure based on the new system data of the record object, and assigning a new unique code to the new sub-nodes. Before the structural node is extended, referenced across systems, or used for automated processing, it must meet preset pre-confirmation conditions.

[0007] Furthermore, the system data includes state records corresponding to nodes in the hierarchical structure. The state records are stored in chronological order to support the temporal backtracking or process presentation of node-related records in the structure addressing space.

[0008] Furthermore, the step of “establishing an addressing space composed of multi-level nodes” includes: hierarchical division, which divides the recording objects into several levels according to the recording requirements of the system data.

[0009] Furthermore, the addressing space is a tree-structured addressing space, and the nodes have a parent-child hierarchical relationship.

[0010] Furthermore, the step of "assigning a unique code to the newly added subordinate node" includes: generating an additional code for the newly added subordinate node, wherein the additional code is combined with the unique code of the superior node to form the unique code of the newly added subordinate node.

[0011] Furthermore, the unique code of the current level node is formed by combining the additional code of the current level node and the additional codes of each superior node in sequence according to the parent-child hierarchical relationship of each node.

[0012] Furthermore, the unique code can be transmitted across systems and maintain consistent referencing.

[0013] Furthermore, when the recording unit reads and references the unique code, it can reference and locate a specified node to obtain the corresponding system data.

[0014] Furthermore, each unique code synchronizes the data timing via a timestamp.

[0015] Furthermore, the unique code can add a record dimension.

[0016] Furthermore, the step of "constructing a structural addressing space, establishing an addressing space composed of multi-level nodes to characterize the recording objects of system data; assigning a unique code to each node, the unique code being used to distinguish different parts, organizations, or recording units" includes: Define the hierarchical framework and establish multiple levels based on the system's data recording habits; Define nodes at each level and establish a mapping relationship between each node and system data; Establish node association rules so that each child node belongs to only one parent node.

[0017] Furthermore, the step of "reading the unique code and obtaining the system data of the record object from the corresponding node based on the unique code" includes: In response to the requesting operation, obtain the unique code of the input; Locate the corresponding node based on the code; Associate data storage addresses to retrieve data across systems; Send the data to the requesting end.

[0018] Furthermore, the step of "node expansion, adding lower-level nodes in the existing hierarchical structure based on the new system data of the record object, and assigning a unique code to the new lower-level nodes" includes: New system data was detected, triggering node expansion; Locate the parent node position and, based on the attributes of the new system data, match the most suitable node in the existing hierarchy as the parent node; Assign a unique code to each new node; The system is configured to add new nodes and associate data with those nodes.

[0019] The present invention also discloses a system for structured encoding and addressing of system data, comprising a processor, wherein the processor runs a program for the system data structured encoding and addressing method described in any one of the above-mentioned methods.

[0020] The beneficial effects of this invention are: improving the clarity of hierarchical management of medical data; supporting cross-system and cross-time period reference of medical data; reducing information misreading and recording deviations; improving the scalability and long-term compatibility of medical data structures; and providing a unified addressing basis for future medical data management tools. Attached Figure Description

[0021] 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. 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.

[0022] The present invention will be further described below with reference to the accompanying drawings and embodiments.

[0023] Figure 1 This is a flowchart of the algorithm of the method of the present invention; Figure 2 This is a flowchart of the subdivision algorithm for step S100 of the method of the present invention; Figure 3 This is a flowchart of the subdivision algorithm for step S200 of the method of the present invention; Figure 4 This is a flowchart of the subdivision algorithm for step S300 of the method of the present invention. Detailed Implementation

[0024] The embodiments of this application are described in detail below, and examples of the embodiments are shown in the accompanying drawings.

[0025] In the description of this specification, the references to "certain embodiments," "one embodiment," "some embodiments," "illustrative embodiment," "example," "specific example," or "some examples" refer to specific features, structures, materials, or characteristics described in connection with the described embodiment or example, which are included in at least one embodiment or example of this application. In this specification, the illustrative expressions of the above terms do not necessarily refer to the same embodiment or example. Furthermore, the specific features, structures, materials, or characteristics described may be combined in any suitable manner in one or more embodiments or examples.

[0026] Reference Figure 1-4 A method for structured encoding and addressing of system data, comprising: Step S100: Construct a structural addressing space, establish an addressing space composed of multi-level nodes to characterize the recording objects of system data, and assign a unique code to each node, the unique code being used to distinguish different parts, organizations or recording units.

[0027] The specific execution process of S100 includes the following: S101-S103: Step S101: Determine the hierarchical framework and establish multiple levels according to the system's data recording habits; For example, when the system data is human medical data, multiple levels can be established by combining human physiological structure and medical data recording habits. Specifically, at least one core level can be established, including: ① The root node is the unique top-level node, which can generally represent the entirety of human medical data; ②System-level nodes refer to specific physiological systems of the human body, such as the respiratory system, digestive system, and urinary system, corresponding to major categories of medical data recording fields.

[0028] ③Regional-level nodes are the corresponding human body parts / tissues under specific physiological systems, such as the lungs and trachea under the respiratory system, corresponding to specific medical target areas; ④ Record unit-level nodes, divided according to medical data types, including CT examinations, pathology records, follow-up records, etc., corresponding to "specific data record types".

[0029] Step S102: Define nodes at each level and establish a mapping relationship between nodes at each level and system data; For example, when the system data is human medical data, a mapping relationship is established between the specific physiological systems of the human body, the corresponding human body parts / tissues under each physiological system, the types of medical data, etc., and the nodes at each level, so that each node at each level corresponds one-to-one with the data. Specifically, the root node uses 01 to represent the overall medical data of patient Zhao, the system-level node uses 01 to represent the respiratory system, the regional-level node uses 03 to represent the lungs, and the record unit-level node uses 01 to represent the CT examination. The complete code is 01-01-03-01, establishing a unique correspondence between the data and the code. The information that can be obtained based on this code is the lung CT examination result of Zhao.

[0030] Step S103: Establish node association rules so that each child node belongs to only one parent node; Each parent node corresponds to multiple child nodes, and each child node belongs to only one parent node. By binding parent and child nodes, we can ensure that each code corresponds to a unique node and prevent confusion when referencing data corresponding to a node based on the code.

[0031] Step S200: Read the unique code, and obtain the system data of the record object from the corresponding node based on the unique code; The specific execution process of S200 includes the following: S201-S204: Step S201: In response to the requesting operation, obtain the unique input code; Step S202: Determine whether there is a node corresponding to the unique code. If the determination result is yes, proceed to step S203. If the determination result is no, proceed to step S206. Step S203: Locate the corresponding node based on the code; Step S204: Associate data storage address and retrieve data across systems; Step S205: Send the data to the requesting end; Step S206: Send an error message indicating that the encoding does not exist to the requesting end.

[0032] For example, when the system data is human medical data, a doctor can enter the code 01-01-03-01 on a computer or other terminal. The system obtains a unique code, locates the corresponding node based on this unique code, retrieves the data from the corresponding data storage address across systems, and sends the patient Zhao's lung CT scan results back to the requesting end (the doctor's computer). Through these steps, cross-system encoding and data transmission can be achieved while maintaining consistent referencing. Furthermore, if the entered code does not have a corresponding node, the system will also send a "code not found" message to the requesting end.

[0033] Step S300, node expansion: add a new lower-level node in the existing hierarchical structure based on the new system data of the record object, and assign a unique code to the new lower-level node.

[0034] The specific execution process of S300 includes the following: S301-S303: S301, New system data detected, triggering node expansion; S302, Locate the parent node position and match the most suitable node in the existing hierarchy as the parent node based on the attributes of the new system data; S303 assigns a unique code to the newly added node; S304, the system configures the addition of a new node and associates data with the node.

[0035] When new system data belongs to a sub-item of an existing node or is added to an existing dimension, node expansion is triggered. Taking human medical data as an example: Example 1: Patient Zhao underwent a lung MRI examination. New system data, "lung MRI examination," was detected, triggering node expansion. This data is a sub-item of the existing node "lung," making the existing node "lung" the parent node. According to the coding rules, a unique code 01-01-03-04 is assigned to the new node (lung MRI examination). It is important to note that the new code cannot overlap with existing codes to ensure the unique correspondence of the data. The system configures the new node and associates this data with the node, making it convenient to locate the node and obtain the corresponding data later through the code. Example 2: Patient Zhao underwent a low-dose lung CT screening. Low-dose lung CT screening is a sub-item of the existing node - Lung CT Examination. This triggers node expansion. The existing node - Lung CT Examination is the parent node. According to the coding rules, a unique code 01-01-03-01-01 is assigned to the new node (Low-dose lung CT screening). The system configures the new node and associates this data with the node, making it convenient to locate the node and obtain the corresponding data through the code in the future. This step allows for the addition of new system dimensions, supporting unlimited hierarchical expansion to include data types not present in the existing medical system. As long as new data that may exist in the future is categorized into the existing system framework according to the coding rules, it can be easily expanded subsequently. It is applicable to future additions of record dimensions, and new data has its own dedicated storage node, which will not crowd out old nodes. It can meet the new data storage needs while maintaining the stability of the original hierarchical structure, and can also refine data classification, improving the accuracy of data retrieval through unique codes.

[0036] Before the structural node is extended, referenced across systems, or used for automated processing, it must meet preset pre-confirmation conditions.

[0037] In the medical field, pre-defined pre-confirmation conditions are generally designed around medical data security, coding uniqueness, operational compliance, and cross-system compatibility to avoid node confusion, data leakage, or cross-system conflicts, and to adapt to the rigorous requirements of medical scenarios.

[0038] For example, in step S301, after new system data is detected and node expansion is triggered, it is necessary to determine whether the pre-confirmation conditions are met—generally whether the data submitter has the authority to expand the node and whether the new system data conforms to the original rules. If the result is yes, the subsequent node expansion steps S302-S304 are executed.

[0039] For example, in step S201, in response to the requesting end operation, after obtaining the unique input code, it is necessary to determine whether the pre-confirmation conditions are met—generally whether the requesting end has the right to reference, whether it has obtained patient authorization, etc. If the result is yes, the subsequent cross-system reference steps S202-S206 are executed.

[0040] In this embodiment, the system data includes state records corresponding to nodes in the hierarchical structure. These state records are stored in chronological order to support temporal backtracking or process presentation of node-related records in the structure addressing space. In this embodiment (a state-time backtracking embodiment based on human structure), the scenario still focuses on human lung-related medical data management. Relying on a predefined static human structure tree (i.e., the structure addressing space), state records after clinical diagnosis / treatment are bound to corresponding structural nodes and stored in chronological order to achieve temporal backtracking and complete process presentation of lung-related medical processes. For example, the above embodiment uses a unique code. The 01-01-03-01 corresponds to Zhao's lung CT scan. Accordingly, the status record is confirmed and entered into the system by the licensed physician after completing the diagnosis, treatment or follow-up, based on the actual clinical results. This status record is then bound to the structural node corresponding to the unique code 01-01-03-01. The status record includes the node code, status description, confirmation information and timestamp, so the corresponding status record for Zhao's lung CT scan can be given as: "01-01-03-01--Right upper lobe ground-glass nodule, size 5mm×4mm, uniform density, benign tendency--Li Si (Radiology Department)--2021-09-18 7:30". When it's necessary to trace back and find corresponding records, the system can directly input the corresponding unique code. All status descriptions and confirmation information for that node will then be sorted chronologically. For example, inputting the unique code 01-01-03-01 will retrieve all of Zhao's lung CT scan records. Clicking on the record from 2021-09-18 7:30 will provide information such as "Right upper lobe ground-glass nodule, size 5mm×4mm, uniform density, benign tendency, input physician Li Si (radiology department)." Furthermore, the system can select to retrieve the CT images stored within the corresponding node. This method enables a bidirectional mapping between the timeline and the structure tree, allowing for the display of the treatment process chronologically and the tracking of disease progression based on specific locations and nodes, facilitating doctors' understanding of the patient's condition. Moreover, through the bound unique codes and corresponding nodes, cross-system data retrieval is possible, simplifying doctor operations, enabling rapid information retrieval, and providing a basis for subsequent diagnosis and treatment.

[0041] In this embodiment, the addressing space is a tree-structured addressing space, and the nodes have a parent-child hierarchical relationship.

[0042] In this embodiment, the step of "assigning a unique code to the newly added subordinate node" includes: generating an additional code for the newly added subordinate node, and combining the additional code with the unique code of the superior node to form the unique code of the newly added subordinate node.

[0043] In this embodiment, the unique code of the local node is formed by combining the additional code of the local node and the additional codes of each superior node in sequence according to the parent-child hierarchical relationship of each node.

[0044] In this embodiment, the unique code can be transmitted across systems and maintains a consistent reference.

[0045] In this embodiment, when the recording unit reads and references the unique code, it can reference and locate a specified node to obtain the corresponding system data.

[0046] In this embodiment, each unique code synchronizes the data timing through a timestamp.

[0047] In this embodiment, the unique code can add a record dimension.

[0048] The beneficial effects of this invention are: improving the clarity of hierarchical management of medical data; supporting cross-system and cross-time period reference of medical data; reducing information misreading and recording deviations; improving the scalability and long-term compatibility of medical data structures; and providing a unified addressing basis for future medical data management tools.

[0049] This application also discloses a system for system data structure encoding and addressing, including a processor, wherein the processor runs a program for the system data structure encoding and addressing method described in any one of the above embodiments.

[0050] Although embodiments of this application have been shown and described above, it is understood that the above embodiments are exemplary and should not be construed as limiting this application. Those skilled in the art can make changes, modifications, substitutions and variations to the above embodiments within the scope of this application. The above embodiments are merely illustrative examples of the present invention and do not constitute a limitation on the scope of protection of the present invention. Equivalent modifications or substitutions made by those skilled in the art without departing from the concept of the present invention should all fall within the scope of protection of the present invention.

Claims

1. A method of system data structuring coding and addressing characterized by, include: Construct a structural addressing space, establish an addressing space composed of multi-level nodes, which is used to characterize the recording objects of system data, and assign a unique code to each node, the unique code being used to distinguish different parts, organizations or recording units; Read the unique code, and based on the unique code, obtain the system data of the record object from the corresponding node; Node expansion involves adding sub-nodes to the existing hierarchical structure based on the new system data of the record object, and assigning a unique code to the new sub-nodes. Before the structural node is extended, referenced across systems, or used for automated processing, it must meet preset pre-confirmation conditions.

2. The method of system data structured coding and addressing according to claim 1, characterized in that, The system data includes state records corresponding to nodes in the hierarchical structure. The state records are stored in chronological order to support the temporal backtracking or process presentation of node-related records in the structure addressing space.

3. The method for system data structure encoding and addressing according to claim 1, characterized in that, The step of "establishing an addressing space composed of multi-level nodes" includes: hierarchical division, dividing the recording objects into several levels according to the system data recording requirements, and the addressing space is a tree-structured addressing space, and the nodes have parent-child hierarchical relationships.

4. The method for system data structure encoding and addressing according to claim 3, characterized in that, The step of "assigning a unique code to the newly added subordinate node" includes: generating an additional code for the newly added subordinate node, and combining the additional code with the unique code of the superior node to form the unique code of the newly added subordinate node.

5. The method for system data structure encoding and addressing according to claim 4, characterized in that, The unique code of the local node is formed by combining the additional code of the local node and the additional codes of each superior node in sequence according to the parent-child hierarchical relationship of each node.

6. The method for system data structure encoding and addressing according to claim 1, characterized in that, The unique code can be transmitted across systems and maintains a consistent reference.

7. The method for system data structure encoding and addressing according to claim 1, characterized in that, When the recording unit reads and references the unique code, it can reference and locate a specified node to obtain the corresponding system data.

8. The method for system data structure encoding and addressing as described in claim 1, characterized in that, Each unique code synchronizes the data timing via timestamps.

9. The system data structure encoding and addressing method according to claim 1, characterized in that, The unique code can add new record dimensions.

10. A system for structured encoding and addressing of system data, characterized in that, The system includes a memory, a processor, and a system data structuring and addressing program stored on the memory, wherein the system data structuring and addressing program is executed by the processor to implement the steps of the method as described in any one of claims 1-9.

Images