CN113380356A - Medical examination data recording method, query method and device based on branch chain type tracing - Google Patents
Medical examination data recording method, query method and device based on branch chain type tracing Download PDFInfo
- Publication number
- CN113380356A CN113380356A CN202110507445.9A CN202110507445A CN113380356A CN 113380356 A CN113380356 A CN 113380356A CN 202110507445 A CN202110507445 A CN 202110507445A CN 113380356 A CN113380356 A CN 113380356A
- Authority
- CN
- China
- Prior art keywords
- node
- result
- level
- branch
- content
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 83
- 238000012360 testing method Methods 0.000 claims description 14
- 238000012795 verification Methods 0.000 claims description 4
- 230000004044 response Effects 0.000 claims description 2
- 238000013500 data storage Methods 0.000 abstract description 2
- 238000007689 inspection Methods 0.000 description 9
- 238000003860 storage Methods 0.000 description 8
- 230000006870 function Effects 0.000 description 6
- 230000008569 process Effects 0.000 description 5
- 238000004458 analytical method Methods 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 3
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000001514 detection method Methods 0.000 description 3
- 238000010561 standard procedure Methods 0.000 description 3
- VOXZDWNPVJITMN-ZBRFXRBCSA-N 17β-estradiol Chemical compound OC1=CC=C2[C@H]3CC[C@](C)([C@H](CC4)O)[C@@H]4[C@@H]3CCC2=C1 VOXZDWNPVJITMN-ZBRFXRBCSA-N 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 238000007405 data analysis Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000011984 electrochemiluminescence immunoassay Methods 0.000 description 2
- 229960005309 estradiol Drugs 0.000 description 2
- 229930182833 estradiol Natural products 0.000 description 2
- 238000003018 immunoassay Methods 0.000 description 2
- 238000004949 mass spectrometry Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 239000008280 blood Substances 0.000 description 1
- 210000004369 blood Anatomy 0.000 description 1
- 238000002038 chemiluminescence detection Methods 0.000 description 1
- 238000003759 clinical diagnosis Methods 0.000 description 1
- 229910017052 cobalt Inorganic materials 0.000 description 1
- 239000010941 cobalt Substances 0.000 description 1
- GUTLYIVDDKVIGB-UHFFFAOYSA-N cobalt atom Chemical compound [Co] GUTLYIVDDKVIGB-UHFFFAOYSA-N 0.000 description 1
- 238000004590 computer program Methods 0.000 description 1
- 238000007418 data mining Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000003745 diagnosis Methods 0.000 description 1
- 239000003814 drug Substances 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000014509 gene expression Effects 0.000 description 1
- 230000036541 health Effects 0.000 description 1
- 230000036039 immunity Effects 0.000 description 1
- 239000010410 layer Substances 0.000 description 1
- 230000014759 maintenance of location Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 210000002966 serum Anatomy 0.000 description 1
- 239000002356 single layer Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
- G16H—HEALTHCARE INFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR THE HANDLING OR PROCESSING OF MEDICAL OR HEALTHCARE DATA
- G16H10/00—ICT specially adapted for the handling or processing of patient-related medical or healthcare data
- G16H10/60—ICT specially adapted for the handling or processing of patient-related medical or healthcare data for patient-specific data, e.g. for electronic patient records
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/242—Query formulation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/25—Integrating or interfacing systems involving database management systems
- G06F16/252—Integrating or interfacing systems involving database management systems between a Database Management System and a front-end application
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Medical Informatics (AREA)
- Mathematical Physics (AREA)
- Computational Linguistics (AREA)
- Public Health (AREA)
- Primary Health Care (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Epidemiology (AREA)
- Computing Systems (AREA)
- Medical Treatment And Welfare Office Work (AREA)
Abstract
The invention discloses a medical examination data recording method, an inquiry method and a device of branch chain type traceability, wherein the method comprises the following steps: responding to a first operation instruction, and establishing a first branch in a branch record table; the first branch comprises a number of different levels of first nodes, each first node having a first child I D, a first I D, first content, and a first end node state; the first end node state is used for representing whether the first node is a result node or not, and the result node is used for displaying result information including first content in the query result table; by setting the first I D, the first content and the first end node state for each first node, when retrieval and tracing are needed, the first content in the first node of the first end node state representation result node can be determined according to the retrieval content, and then the first content is directly displayed in the query result table as result information, so that the convenience and the effectiveness of tracing are improved, and the method can be applied to the field of data storage.
Description
Technical Field
The invention relates to the field of data storage, in particular to a branched chain type traceable medical examination data recording method, query method and device.
Background
With the rapid development of medical technology and ideas and the increasing concern of people about their health, the amount of medical data recorded by medical systems has increased dramatically, and the storage of medical data can be used for subsequent traceability and analysis. At present, a good recording system is not provided for the inspection result of medical data, all the inspection data of all the histories are simply recorded into a database for standby and analysis, including the situation that the LIS (inspection information system) and the HIS (hospital information system) of each large manufacturer are both the same, the data cannot be used for the analysis of large data at the later stage, and meanwhile, the existing data tracing mode is magnitude tracing, the basic idea of the magnitude tracing is that a methodology is accurate, other methodologies are compared by using a calibration product with uniform standard concentration, after the detection signal value of a certain method is obtained, the detection result represented by the signal value is drawn close to the standard method, so that the consistency of all the results is ensured, the tracing method has the problem of high centralization, and if the standard method cannot accurately represent the performance of a demand side, all methods may have the possibility of being evaluated incorrectly, such as: if the standard method is mass spectrometry, and mass spectrometry cannot completely explain the clinical performance of a patient, but an antibody of an immunoassay method is more consistent with the biological immunity condition of the patient and can explain the clinical performance better, the concept of explaining the clinical performance to guide clinical diagnosis and treatment is finally attributed based on evidence-based medicine and test results, and the value of the evaluated method cannot be accurately and objectively evaluated. Due to the above tracing problem, a large amount of data noise exists, and cannot be filtered, and finally, the result of big data analysis is unreliable, so a new data recording method is necessary to be provided, and the convenience and the effectiveness of tracing are improved.
Disclosure of Invention
In view of the above, in order to solve the above technical problems, the present invention provides a branched chain type tracing medical examination data recording method, query method and device.
The technical scheme adopted by the invention is as follows:
the medical examination data recording method of branch chain type tracing comprises the following steps:
responding to a first operation instruction, and establishing a first branch in a branch record table;
wherein the first branch comprises a number of first nodes of different levels, each of the first nodes having a first sub-ID, a first ID, first content, and a first end node status; the first ID of the first node of each level is determined according to the first ID of the first node of the previous level of the current level of the first node and the first sub-ID of the first node of the current level; the first ID of the first node of the highest level is determined according to the first child ID of the first node of the highest level and the parent ID of the virtual initial node; the first end node state is used for representing whether the first node is a result node or not, and the result node is used for displaying result information including the first content in a query result table; the first node of the lowest level is the result node.
Further, sequentially adding a first ID of a first node at a previous level of the current level of the first node and a first sub-ID of the first node at the current level based on preset characters to form a long integer or an integer first ID;
alternatively, the first and second electrodes may be,
and sequentially adding the parent ID of the virtual initial node and the first child ID of the first node at the highest level to form a long integer or a first ID of the integer as the first ID of the first node at the highest level based on preset characters.
Further, the result information includes at least one verification result having a second unique number, the method further comprising:
adding a first unique number to the first node, the first unique number being used for association with the second unique number of the verification result.
Further, the method further comprises:
responding to a second operation instruction, and establishing a second branch in the branch record table;
wherein the second branch comprises at least one second node having a second child ID, a second ID, second content, and a second end node status, the second ID of the highest level second node determined from the parent ID and the second child ID of the highest level second node; and the second end node state is used for representing whether the second node is a result node or not, and the result node is also used for displaying result information comprising the second content in a query result table.
Further, in response to a third operation instruction, adding a new first node in the first branch; the new first node comprises a new first ID, a new first sub-ID, new first content and a new first end node state, the new first ID is determined according to the first ID of the first node at the previous level of the current level and the new first sub-ID, and the new first sub-ID is determined according to a preset numerical value accumulated by the first sub-IDs of the first nodes at the same level as the new first node;
setting the new first end node state as a first numerical value, or setting the new first end node state as a first numerical value and updating the first end node state of the first node of the first level on the new first node to a second numerical value; the first value is used to characterize the resulting node and the second value is used to characterize the non-resulting node.
The invention also provides an inquiry method, which is applied to the data recorded by the branched chain type tracing medical examination data recording method and comprises the following steps:
acquiring retrieval information;
determining first content meeting the retrieval information according to the retrieval information, and determining a first node corresponding to the first content as a target node;
taking a first ID or a first unique number of the target node of a first terminal node state representation result node as a result ID set;
and displaying a query result table according to the result ID set.
Further, the target node of the first end node state representation result node further includes a result type state bit, and the displaying a query result table according to the result ID set includes:
and displaying a type result table of the type corresponding to the target node according to the result type state bit of the target node in the result ID set, wherein the query result table comprises the type result table.
Further, the acquiring the retrieval information includes:
taking the input initial information as retrieval information;
alternatively, the first and second electrodes may be,
and adjusting the input initial information by adding or deleting preset characters in the first ID, and taking the adjusted initial information as retrieval information.
The present invention also provides a recording apparatus comprising:
the establishing module is used for responding to the first operation instruction and establishing a first branch in the branch record table;
wherein the first branch comprises a number of first nodes of different levels, each of the first nodes having a first sub-ID, a first ID, first content, and a first end node status; the first ID of the first node of each level is determined according to the first ID of the first node of the previous level of the current level of the first node and the first sub-ID of the first node of the current level; the first ID of the first node of the highest level is determined according to the first child ID of the first node of the highest level and the parent ID of the virtual initial node; the first end node state is used for representing whether the first node is a result node or not, and the result node is used for displaying result information including the first content in a query result table; the first node of the lowest level is the result node.
The invention also provides an inquiry device, which is applied to the data recorded by the branched chain type tracing medical examination data recording method, and comprises the following steps:
the acquisition module is used for acquiring retrieval information;
the target node module is used for determining first content meeting the retrieval information according to the retrieval information and determining a first node corresponding to the first content as a target node;
the collection module is used for taking a first ID or a first unique number of the target node of a first terminal node state representation result node as a result ID collection;
and the result module is used for displaying the query result table according to the result ID set.
The invention also provides a device, comprising a processor and a memory;
the memory stores a program;
the processor executes the program to realize the branch chain type tracing medical examination data recording method or the query method.
The present invention also provides a computer-readable storage medium storing a program which, when executed by a processor, implements the branched chain tracing medical examination data recording method or the query method.
The invention has the beneficial effects that: responding to a first operation instruction, and establishing a first branch in a branch record table; wherein the first branch comprises a number of first nodes of different levels, each of the first nodes having a first sub-ID, a first ID, first content, and a first end node status; the first ID of the first node of each level is determined according to the first ID of the first node of the previous level of the current level of the first node and the first sub-ID of the first node of the current level; the first ID of the first node of the highest level is determined according to the first child ID of the first node of the highest level and the parent ID of the virtual initial node; the first end node state is used for representing whether the first node is a result node or not, and the result node is used for displaying result information including the first content in a query result table; the first node of the lowest level is a result node; according to the invention, the unique first ID, the corresponding first content and the first end node state are set for each first node, when the retrieval traceability is required, the first content in the first node with the lowest level of the first end node state representation result node can be determined according to the retrieval content, and then the first content is directly displayed in the query result table as the result information, so that the convenience and the effectiveness of the traceability are improved.
Drawings
FIG. 1 is a schematic flow chart illustrating the steps of the method for recording medical examination data according to the present invention;
FIG. 2 is a first diagram of a branch record table according to an embodiment of the present invention;
FIG. 3 is a second diagram of a branch record table according to an embodiment of the present invention;
FIG. 4 is a flowchart illustrating steps of the query method according to the present invention.
Detailed Description
In order to make the technical solutions better understood by those skilled in the art, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only partial embodiments of the present application, but not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The terms "first," "second," "third," and "fourth," etc. in the description and claims of this application and in the accompanying drawings are used for distinguishing between different objects and not for describing a particular order. Furthermore, the terms "include" and "have," as well as any variations thereof, are intended to cover non-exclusive inclusions. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not limited to only those steps or elements listed, but may alternatively include other steps or elements not listed, or inherent to such process, method, article, or apparatus.
Reference herein to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the application. The appearances of the phrase in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. It is explicitly and implicitly understood by one skilled in the art that the embodiments described herein can be combined with other embodiments.
As shown in fig. 1, an embodiment of the present invention provides a branched chain type tracing medical examination data recording method, including step S100:
s100, responding to the first operation instruction, and establishing a first branch in the branch record table.
In this embodiment of the present invention, the first operation instruction may be an instruction generated by a keyboard, a mouse, or voice, and may include a plurality of first operation sub-instructions having a sequence, for example, each of the operation sub-instructions is used to establish a first node (including first content), and a plurality of first nodes are generated by the plurality of first operation sub-instructions to form a first branch. The branch record table refers to a record table for recording node information of branches and nodes in the branches, and one branch record table may include a plurality of branches, and each branch may include a plurality of nodes. In particular, the first branch may comprise several first nodes of different levels, each of said first nodes having a first sub-ID, a first content and a first end node status; the first ID of the first node of each level is determined according to the first ID of the first node of the previous level of the current level of the first node and the first sub-ID of the first node of the current level; the first ID of the first node of the highest level is determined according to the first child ID of the first node of the highest level and the parent ID of a virtual initial node, wherein the virtual initial node is a starting point; the first end node state is used for representing whether the first node is a result node or not, and the result node is used for displaying result information including the first content in a query result table; the first node of the lowest level is the result node.
Specifically, when the user searches and traces the source, the first content contained in the corresponding result node is used as result information to be displayed in the query result table.
Optionally, the first content may include a node title and a node detail (s _ tips _ detail), the node detail being a refined description corresponding to the node, the node title may be character type or long integer type, and the node detail may be character type. In addition, the first end node state may be integer, the parent ID and the first ID may be long character type, and the first child ID may be long integer type.
It should be noted that, each first node automatically generates the first end node state, a sub-ID and the first ID according to its own level and location whenever generating/establishing a first node. The level of the first node refers to a level determined by a position of the first node, for example, when the first branch is a chain extending from top to bottom, the level of the first node located above is higher than the level of the first node located below, and when the first node is established, the level is established from top to bottom. It is to be understood that, assuming that there is a first node a, the first node B located above and adjacent to the first node a in the current level (i.e., the first node in the previous level of the current level) is the parent node of the first node a, the first node C located below and adjacent to the first node a in the current level (i.e., the first node in the next level of the current level) is the parent node of the first node a, and so on.
In this embodiment of the present invention, the first end node state has a first value and a second value, for example, the first value is 1, the second value is 0, the first end node state is defined as i _ end _ flag, when i _ end _ flag of a first node is 1, it indicates that i _ end _ flag is true, and at this time, it indicates that the first node is a result node; when i _ end _ flag of a first node is 0, it indicates that i _ end _ flag is false, and this indicates that the first node is a non-result node, that is, the first node is actually an intermediate node.
It should be noted that, taking the example of recording the relevant information of the instrument, in the existing scheme, by establishing an instrument table, the instrument table contains the information of the instrument and contains the main key of the instrument table, and each instrument record is independent and has no relevant meaning, can be increased at will and does not have unified planning and planning, that is, the instrument table is only equivalent to a container of the inspection record, equivalent to an identifier and has no practical meaning; the table for recording the results corresponds to the information of the instrument, and the results are simply classified according to the container of the instrument, and each result is actually an independent, unrelated and nonexistent branch concept. In the embodiment of the invention, the existing instrument table is recorded as a branch recording table with a branch relation, the main key (such as the unique number and the ID of the node) of the branch table is provided, each record (each node) has strict correlation and needs to be increased by unified planning and overall planning, not only is a container, but also is a container, the result information belongs to which node has the strict plan and the relevance, and the branch recording table is a traceable branch recording map and can be effectively applied to big data analysis data mining; therefore, each test result in the query result table can be associated with the node in the branch record table by setting the branch record table and the query result table and the association relationship established between the branch record table and the query result table, and the test result corresponds to the branch tracing function contained in the branch record table.
Specifically, the determining of the first ID of the first node includes step S110:
s110, sequentially adding a first ID of a first node at a previous level of a current level of the first node and a first sub-ID of the first node at the current level based on preset characters to form a long integer or an integer first ID;
alternatively, the first and second electrodes may be,
and sequentially adding the parent ID of the virtual initial node and the first child ID of the first node at the highest level to form a long integer or a first ID of the integer as the first ID of the first node at the highest level based on preset characters.
Specifically, as shown in fig. 2, the virtual initial node 300 and the branch record table 200 are provided as starting points, the branch record table 200 has the first branch 210, the first node 211 having the highest level (first level) in the first branch 210, the first node 212 of the second level, and the first node 213 of the third level, and assuming that the parent ID of the virtual initial node is "0" and the first child ID of the first node 211 is "1", the parent ID "0" of the virtual initial node and the first child ID "1" of the first node 211 are sequentially added to form the first ID of the first node 211 of the long integer type as "0 _ 1", and the oak preset character is "_" in the present embodiment as an example. Assuming that the first sub-ID of the first node 212 is "1", the first ID "0 _ 1" of the first node 212 of the first node 211 of the previous level of the current level of the first node 212 and the first sub-ID "1" of the first node of the current level are sequentially added to form a long and integer first ID "0 _1_ 1"; and the first sub-ID of the first node 213 is "1", thereby determining that the first ID of the first node 213 is "0 _1_1_ 1".
It should be noted that the node of each level needs to be determined according to the sub-ID of the node and the ID of the node of the previous level, but is not limited to the sequential addition manner, and may also be determined according to other generation methods, and the embodiment of the present invention is not particularly limited. It is understood that the node at the highest level is the first node 211, the node at the lowest level is the first node 213, and the first end node state i _ end _ flag of the first node 211 is 0, the first end node state i _ end _ flag of the first node 212 is 0, the first end node state i _ end _ flag of the first node 213 is 1, and the first node 213 is the result node. The first branch refers to a branch established by extending downward with the first node 211 as the highest level node. It should be noted that the lowest level node may have one or more nodes, and the lowest level node means that no other node extends below a node, that is, the node does not serve as a parent node of any node.
Specifically, the medical examination data recording method of branch chain tracing in the embodiment of the present invention further includes step S120:
and S120, responding to the second operation instruction, and establishing a second branch in the branch record table.
Wherein the second branch comprises at least one second node having a second child ID, a second ID, second content, and a second end node status, the second ID of the highest level second node determined from the parent ID and the second child ID of the highest level second node; and the second end node state is used for representing whether the second node is a result node or not, and the result node is also used for displaying result information comprising the second content in a query result table.
Similarly, the second content may also include a node title and a node detail (s _ tips _ detail), the format and definition of the second node are the same as those of the first node, the format and definition of the second sub-ID, the second ID and the second end node state are the same as those of the first sub-ID, the first ID and the first end node state, and the generation method is the same as that of the first node, which is not described again. It should be noted that, an execution sequence is not defined between the second operation instruction and the first operation instruction, when the first operation instruction includes a plurality of first operation sub-instructions with a sequential order, for example, each first operation sub-instruction is used to establish a first node, the second operation instruction includes a plurality of second operation sub-instructions with a sequential order, for example, each second operation sub-instruction is used to establish a second node, and the sequence of the first operation sub-instruction and the second operation sub-instruction is not limited. It is understood that the second operation instruction may also be an instruction generated by a keyboard, a mouse, or voice.
For example, as shown in fig. 2, the branch record table 200 has a second branch 220, and when the parent ID of the virtual initial node is "0" and the second child ID of the second node 221 is "2", the second node 221 having the highest level (first level) and the second node 221 having the second level 222 in the second branch 220 sequentially adds the parent ID "0" of the virtual initial node and the second child ID "2" of the second node 221 to form a long integer, and the second ID is "0 _ 2". Assuming that the second sub-ID of the second node 222 is "1", the second ID "0 _ 2" of the second node 221 of the previous level of the current level of the second node 222 and the second sub-ID "1" of the second node of the current level are sequentially added to the second ID "0 _2_ 1" forming a long integer. It is understood that the highest level nodes are two first nodes 211 and second nodes 221, the lowest level nodes are two first nodes 213 and second nodes 222, the second end node state i _ end _ flag of the second node 221 is 0, the second end node state i _ end _ flag of the second node 222 and the first end node state i _ end _ flag of the first node 213 are 1, and the second node 222 and the first node 213 are both result nodes. It should be noted that the second branch refers to a branch established by extending downward with the second node 221 as the highest level node. It is understood that the nth node may be established by a number of operational instructions to generate N branches. Therefore, through the setting of the embodiment of the invention, all the nodes are stored in the branch record table, and the intermediate nodes and the branches can be arbitrarily added in the branch record table, and then the tracing can be realized through the data in the branch record table. Alternatively, the content of the node, for example, the node details in the first content of the first node, may not be stored in the node record table, but may be stored in a database, a data table or a series of storages independently, and are associated with and uniquely correspond to the first ID of the first node, where the branch record table corresponds to a description content or a dictionary represented by the description, and then may be called according to the first ID to display the first content in a subsequent query, and it is understood that, when the first node includes the first content, it means that the first node includes information that may be called and associated with the first content, for example, the first ID.
Specifically, the medical examination data recording method of branch chain tracing in the embodiment of the present invention further includes steps S131 to S132:
s131, responding to a third operation instruction, and adding a new first node in the first branch; the new first node comprises a new first ID, a new first sub-ID, new first content and a new first end node state, the new first ID is determined according to the first ID of the first node of the previous level of the current level and the new first sub-ID, and the new first sub-ID is determined according to a preset numerical value accumulated by the first sub-IDs of the first nodes located at the same level as the new first node.
Similarly, the third operation command may be generated by a keyboard, a mouse, or voice, and the third operation command, the first operation command, and the second operation command do not limit the execution order. It should be noted that the format and definition of the new first ID, the new first sub-ID, the new first content, and the new first end node state are the same as those of the first node, and are not described again.
S132, setting the new first end node state as the first value, or setting the new first end node state as the first value and updating the first end node state of the first node of the first level on the new first node to the second value.
For example, as shown in fig. 3, a new first node 214 is added in the first branch 210, when the first node 214 is located at the lowest level, when the new first end node state of the first node 214 is set to the first value, i.e. the new first end node state i _ end _ flag is 1. Or in another case, a new first node 215 is added to the first branch 210, when the first node 215 is located at the lowest level, the new first end node state of the first node 215 is set to the first value, i.e. the new first end node state i _ end _ flag is 1, and the first node 213 changes from the position of the lowest level to the position of the intermediate level, i.e. the position of the first level on the first node 215, when the first end node state of the first node 213 needs to be updated, so that the first end node state of the first node 213 is updated from the first value to the second value, i.e. the first end _ flag changes from 1 to 0, and as a result the node changes from the first node 213 to the first node 215. It can be understood that, when the second branch or the nth branch establishes a new node, the principle is similar and will not be described again.
In the embodiment of the present invention, the preset value includes, but is not limited to "1". As shown in fig. 3, the new sub-ID of the first node 214 is "2", that is, determined by accumulating a preset value "1" according to the first sub-DI "1" of the first node 212 located at the same level as the first node 214, the first ID of the first node 212 is "0 _1_ 1", and the first ID of the first node 214 is "0 _1_ 2"; and the ID of the first node 213 is "0 _1_1_ 1", the new sub-ID of the first node 215 is "1", i.e. the new first ID of the first node 215 is "0 _1_1_1_ 1".
The recording method according to the embodiment of the present invention further provides an adjustment function, for example, as shown in fig. 3, if the second node 222 is to be moved to the right position of the first node 214 of the first branch 210, the second node 222 may be moved to the right position of the first node 214, and the first ID of the second node 222 is automatically changed to "0 _1_ 3".
In summary, by providing the branch record table, the relationship that the nodes under a plurality of branches continuously extend is realized, and the effects of classifying the data of a result table which originally contains various states and has serious noise, and quickly classifying, searching and retrieving are achieved.
Specifically, the result information includes at least one test result, and the test result has a second unique number, and the branched chain tracing medical examination data recording method according to the embodiment of the present invention further includes step S140:
and adding a first unique number to the first node, wherein the first unique number is used for being associated with a second unique number of the check result.
It should be noted that, when one first node corresponds to a plurality of inspection results, each type of inspection result has a corresponding result type status bit and a second unique number, and the second unique number establishes a relationship with the first unique number, and by using the first unique number as a tracing number, when query tracing is subsequently performed, different inspection results can be retrieved and associated with the first unique number through the second unique number of the inspection result, and an association table is established, so that the first content inspection result of the first node corresponding to the first unique number is displayed. Wherein the result node in each branch may be configured with a corresponding first unique number associated with a second unique number of the test result.
As shown in fig. 4, an embodiment of the present invention further provides an inquiry method, which is applied to data recorded by the branched chained medical examination data recording method, and includes steps S210 to S240:
and S210, acquiring retrieval information.
Optionally step S210 may comprise the steps of: s211 or S212:
s211, the input initial information is used as search information.
Alternatively, the input initial information is determined as a search field determined by means of a keyboard, a mouse, or voice recognition, etc., the search field including, but not limited to, a single word, or sentence, etc., and then the input initial information is determined as the search information.
S212, adding or deleting preset characters in the first ID to adjust the input initial information, and taking the adjusted initial information as retrieval information.
When the input initial information already exists, the input initial information is adjusted through a preset character _' in the first ID of the input initial information, and the adjusted initial information is used as retrieval information to facilitate searching the subset and the parent set, for example: searching, judging and processing the subset, wherein the parent id of the node is added with the child id of the node and then is matched with the _'; the parent set is searched, judged and processed only by removing the matching of the last _ 'and the last _' segmented elements, the times of database searching can be reduced in actual operation, even the dictionary can be searched manually, the whole tracing chain is not required to be restored recursively by program traversal, and the daily work is very convenient.
S220, determining first content meeting the retrieval information according to the retrieval information, and determining a first node corresponding to the first content as a target node.
Specifically, matching is performed from the contents of all nodes according to the retrieval information, the contents satisfying the retrieval information are determined, and the node having the contents satisfying the retrieval information is determined as the target node. It should be noted that the content satisfying the search information includes, but is not limited to, content having the search information or content having an association with the search information. In the embodiment of the present invention, only the first node in the branch record table is taken as an example for explanation, specifically, the first content meeting the search information is determined according to the search information, and then the corresponding first node having the first content is determined as the target node.
For example, as shown in fig. 3, it is assumed that the first node 213, the first node 215, and the first node 214 have the first content satisfying the retrieval information, and the target nodes are the first node 213, the first node 215, and the first node 214.
And S230, taking the first ID or the first unique number of the target node of the first terminal node state representation result node as a result ID set.
Specifically, the first nodes whose result nodes, i.e., first end node status i _ end _ flag, is 1 are the first node 214 and the first node 215, the first ID of the first node 214 is "0 _1_ 2", the first ID of the first node 215 is "0 _1_1_1_ 1", and "0 _1_ 2" and "0 _1_1_1_ 1" are taken as the result ID set. Or when the first node is configured with the first unique number, taking the first unique number of the target node of the final node state representation result node as the ID set.
And S240, displaying a query result table according to the result ID set.
Specifically, the query result table refers to a table containing a matching result displayed after search matching is performed in the branch record table according to the retrieval information. Optionally, the target node of the first end node state representation result node further includes a result type state bit, for example, the result type state bit i _ type ═ 1 represents the test result, i _ type ═ 2 represents the diagnosis result, i _ type ═ 3 represents the customer service query, and i _ type ═ n represents the content "… …", which may be set according to requirements. It should be noted that all nodes in the branch record table have a type status bit, and the first node at the lowest level is automatically set as the result type status bit, i _ type ═ 1, which is the type status bit of the verification result at the time of setup.
Step S240 further includes step S241:
s241, displaying a type result table of the type corresponding to the target node according to the result type state bit of the target node in the result ID set.
In the embodiment of the present invention, when the status bits of the result types of the nodes are different, that is, different nodes represent different result types, when the query result table is displayed, the test results corresponding to different result types may be respectively displayed in the type result tables of the corresponding types, and then the type result tables are merged, or the type result tables are displayed in different window pages after being separated, or the type result tables separated by a certain distance are displayed in one page, where the query result table includes the type result table. Specifically, it is assumed that i _ type of the first node 214 is 1, i _ type of the first node 215 is 2, and then a type result table containing the first content of the first node 214 is displayed with i _ type being 1, and a type result table containing the first content of the second node 215 is displayed with i _ type being 2, thereby realizing display of a query result table. It should be noted that, when one first node corresponds to multiple test results, different test results can be retrieved and associated with the first unique number through the second unique number of the test result, so that the first content test result of the first node corresponding to the first unique number is displayed, and the display manner is similar and is not repeated.
It should be noted that the type result table may also display the related information of the node, such as the sub ID, the ID, or the first unique number and the second unique number. When the user wants to know the related contents of the first node 214 and the first node 215, such as common or identical contents, as in the above example, the ID "0 _1_ 2" of the first node 214 and the ID "0 _1_1_1_ 1" of the first node 215 may be used to find the ID "0 _ 1" located at a higher level of the first node 214 and the first node 215, i.e., the first ID of the first node 211, so as to view the related information of the first node 211 or all the first nodes including the first node 211 and nodes having the highest level of the first node 211 extending downward according to "0 _ 1". It should be noted that the related information includes, but is not limited to, the first content, the first ID, and the first sub-ID.
Referring to fig. 3, the method will be described with medical data, for example, the first node 211 is titled as a brand immunoassay device, the first node 212 and the first node 214 are titled as different models of the brand, the node details may be parameters or results of the detection process, etc., when a laboratory is conducting research, the sample is a serum sample that is repeatedly frozen and thawed 3 times, at this time, the user may add a first node 213, and the node is titled as "repeatedly frozen and thawed 3 times".
For example, when query tracing is performed, the following ID refers to a complete ID (first ID) of a node. Assuming that the virtual initial node has an ID of (0), a sub-node "immunodetection" below, an ID of (0_1), a next sub-node "chemiluminescence detection" below, an ID of (0_1_2), then an "electrochemiluminescence" ID (0_1_2_3), then a "brand" ID (0_1_2_3_1), then a "Roche" ID (0_1_2_3_1_2), then a "model" ID (0_1_2_3_1_2_3), then a "base 411 full-automatic electrochemiluminescence immunoassay" ID (0_1_2_3_1_2_3_1), then possibly two identical sub-branches ("conventional blood draw", "freeze-thaw 3 times"), then several sub-branches ("under 25", "under 35", "over 35"), and so on, at the moment, if all estradiol results below 25 years old detected by the Roche cobalt 411 full-automatic electrochemiluminescence immunoassay analyzer are required to be obtained, all father id chains and specific father ids meeting the conditions can be searched from the branch recording table at the moment, the father id chains and the specific father ids are integrated after single-layer or multi-layer retrieval according to the father ids, and finally, all estradiol items in the subsets are correspondingly screened from the query result table, namely, no matter how the retrieval is carried out, the result table is only a result table set finally, and the method is very clear and quick.
An embodiment of the present invention further provides a recording apparatus, including:
the establishing module is used for responding to the first operation instruction and establishing a first branch in the branch record table;
wherein the first branch comprises a number of first nodes of different levels, each of the first nodes having a first sub-ID, a first ID, first content, and a first end node status; the first ID of the first node of each level is determined according to the first ID of the first node of the previous level of the current level of the first node and the first sub-ID of the first node of the current level; the first ID of the first node of the highest level is determined according to the first child ID of the first node of the highest level and the parent ID of the virtual initial node; the first end node state is used for representing whether the first node is a result node or not, and the result node is used for displaying result information including the first content in a query result table; the first node of the lowest level is the result node.
The content in the embodiment of the branched and chained medical examination data recording method is applicable to the embodiment of the device, the functions specifically realized by the embodiment of the device are the same as those in the embodiment of the branched and chained medical examination data recording method, and the beneficial effects achieved by the embodiment of the branched and chained medical examination data recording method are also the same as those achieved by the embodiment of the branched and chained medical examination data recording method.
The invention also provides an inquiry device, which is applied to the data recorded by the branched chain type tracing medical examination data recording method, and comprises the following steps:
the acquisition module is used for acquiring retrieval information;
the target node module is used for determining first content meeting the retrieval information according to the retrieval information and determining a first node corresponding to the first content as a target node;
the collection module is used for taking a first ID or a first unique number of the target node of a first terminal node state representation result node as a result ID collection;
and the result module is used for displaying the query result table according to the result ID set.
The contents in the foregoing query method embodiment are all applicable to this apparatus embodiment, the functions specifically implemented by this apparatus embodiment are the same as those in the foregoing query method embodiment, and the beneficial effects achieved by this apparatus embodiment are also the same as those achieved by the foregoing query method embodiment.
The embodiment of the invention also provides a device, and the equipment comprises a processor and a memory;
the memory is used for storing programs;
the processor is used for executing programs to realize the branch chain type tracing medical examination data recording method or the query method of the embodiment of the invention. The device of the embodiment of the invention can realize the function of data recording or data query. The device can be any intelligent terminal including a mobile phone, a tablet computer, a computer and the like.
The contents in the above method embodiments are all applicable to the present apparatus embodiment, the functions specifically implemented by the present apparatus embodiment are the same as those in the above method embodiments, and the advantageous effects achieved by the present apparatus embodiment are also the same as those achieved by the above method embodiments.
The embodiment of the present invention further provides a computer-readable storage medium, where a program is stored in the computer-readable storage medium, and the program is executed by a processor to implement the branch chain type source tracing medical examination data recording method or the query method according to the foregoing embodiment of the present invention.
Embodiments of the present invention further provide a computer program product including instructions, which when run on a computer, causes the computer to execute the medical examination data recording method or the query method of branch chain tracing in the foregoing embodiments of the present invention.
The terms "first," "second," "third," "fourth," and the like in the description of the application and the above-described figures, if any, are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the application described herein are capable of operation in sequences other than those illustrated or described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
It should be understood that in the present application, "at least one" means one or more, "a plurality" means two or more. "and/or" for describing an association relationship of associated objects, indicating that there may be three relationships, e.g., "a and/or B" may indicate: only A, only B and both A and B are present, wherein A and B may be singular or plural. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship. "at least one of the following" or similar expressions refer to any combination of these items, including any combination of single item(s) or plural items. For example, at least one (one) of a, b, or c, may represent: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", wherein a, b, c may be single or plural.
In the several embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, a division of a unit is merely a logical division, and an actual implementation may have another division, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form. Units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment. In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be substantially implemented or contributed to by the prior art, or all or part of the technical solution may be embodied in a software product, which is stored in a storage medium and includes multiple instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method of the embodiments of the present application. And the aforementioned storage medium includes: various media capable of storing programs, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
The above embodiments are only used to illustrate the technical solutions of the present application, and not to limit the same; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions in the embodiments of the present application.
Claims (10)
1. The medical examination data recording method of branch chain type tracing is characterized by comprising the following steps:
responding to a first operation instruction, and establishing a first branch in a branch record table;
wherein the first branch comprises a number of first nodes of different levels, each of the first nodes having a first sub-ID, a first ID, first content, and a first end node status; the first ID of the first node of each level is determined according to the first ID of the first node of the previous level of the current level of the first node and the first sub-ID of the first node of the current level; the first ID of the first node of the highest level is determined according to the first child ID of the first node of the highest level and the parent ID of the virtual initial node; the first end node state is used for representing whether the first node is a result node or not, and the result node is used for displaying result information including the first content in a query result table; the first node of the lowest level is the result node.
2. The branched chain type traceable medical examination data recording method according to claim 1, wherein: the first ID of the first node is determined by:
sequentially adding a first ID of a first node at a previous level of a current level of the first node and a first sub-ID of the first node at the current level based on preset characters to form a long integer or an integer first ID;
alternatively, the first and second electrodes may be,
and sequentially adding the parent ID of the virtual initial node and the first child ID of the first node at the highest level to form a long integer or a first ID of the integer as the first ID of the first node at the highest level based on preset characters.
3. The branched chain type traceable medical examination data recording method according to claim 1, wherein: the result information includes at least one test result, the test result having a second unique number, the method further comprising:
adding a first unique number to the first node, the first unique number being used for association with the second unique number of the verification result.
4. The branched chain type traceable medical examination data recording method according to claim 1, wherein: the method further comprises the following steps:
responding to a second operation instruction, and establishing a second branch in the branch record table;
wherein the second branch comprises at least one second node having a second child ID, a second ID, second content, and a second end node status, the second ID of the highest level second node determined from the parent ID and the second child ID of the highest level second node; and the second end node state is used for representing whether the second node is a result node or not, and the result node is also used for displaying result information comprising the second content in a query result table.
5. The branched chain type traceable medical examination data recording method according to claim 1, wherein: the method further comprises the following steps:
adding a new first node in the first branch in response to a third operation instruction; the new first node comprises a new first ID, a new first sub-ID, new first content and a new first end node state, the new first ID is determined according to the first ID of the first node at the previous level of the current level and the new first sub-ID, and the new first sub-ID is determined according to a preset numerical value accumulated by the first sub-IDs of the first nodes at the same level as the new first node;
setting the new first end node state as a first numerical value, or setting the new first end node state as a first numerical value and updating the first end node state of the first node of the first level on the new first node to a second numerical value; the first value is used to characterize the resulting node and the second value is used to characterize the non-resulting node.
6. A query method applied to data recorded by the branched chain traceability medical examination data recording method according to any one of claims 1 to 5, comprising:
acquiring retrieval information;
determining first content meeting the retrieval information according to the retrieval information, and determining a first node corresponding to the first content as a target node;
taking a first ID or a first unique number of the target node of a first terminal node state representation result node as a result ID set;
and displaying a query result table according to the result ID set.
7. The query method of claim 6, wherein: the target node of the first end node state representation result node further includes a result type state bit, the displaying a query result table according to the result ID set includes:
and displaying a type result table of the type corresponding to the target node according to the result type state bit of the target node in the result ID set, wherein the query result table comprises the type result table.
8. The query method of claim 6, wherein: the acquiring retrieval information includes:
taking the input initial information as retrieval information;
alternatively, the first and second electrodes may be,
and adjusting the input initial information by adding or deleting preset characters in the first ID, and taking the adjusted initial information as retrieval information.
9. A recording apparatus, characterized by comprising:
the establishing module is used for responding to the first operation instruction and establishing a first branch in the branch record table;
wherein the first branch comprises a number of first nodes of different levels, each of the first nodes having a first sub-ID, a first ID, first content, and a first end node status; the first ID of the first node of each level is determined according to the first ID of the first node of the previous level of the current level of the first node and the first sub-ID of the first node of the current level; the first ID of the first node of the highest level is determined according to the first child ID of the first node of the highest level and the parent ID of the virtual initial node; the first end node state is used for representing whether the first node is a result node or not, and the result node is used for displaying result information including the first content in a query result table; the first node of the lowest level is the result node.
10. An inquiry apparatus, applied to data recorded by the branched chain type medical examination data recording method according to any one of claims 1 to 5, comprising:
the acquisition module is used for acquiring retrieval information;
the target node module is used for determining first content meeting the retrieval information according to the retrieval information and determining a first node corresponding to the first content as a target node;
the collection module is used for taking a first ID or a first unique number of the target node of a first terminal node state representation result node as a result ID collection;
and the result module is used for displaying the query result table according to the result ID set.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110507445.9A CN113380356B (en) | 2021-05-10 | 2021-05-10 | Branch chain type traceable medical examination data recording method, inquiring method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110507445.9A CN113380356B (en) | 2021-05-10 | 2021-05-10 | Branch chain type traceable medical examination data recording method, inquiring method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113380356A true CN113380356A (en) | 2021-09-10 |
| CN113380356B CN113380356B (en) | 2024-04-16 |
Family
ID=77572385
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110507445.9A Active CN113380356B (en) | 2021-05-10 | 2021-05-10 | Branch chain type traceable medical examination data recording method, inquiring method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113380356B (en) |
Citations (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101535990A (en) * | 2006-08-23 | 2009-09-16 | 创新解决方案公司 | Efficient search result update mechanism |
| CN102402602A (en) * | 2011-11-18 | 2012-04-04 | 航天科工深圳（集团）有限公司 | B+ tree indexing method and device of real-time database |
| US20120173585A1 (en) * | 2010-12-30 | 2012-07-05 | Yue Pan | Obtaining hierarchical information of planar data |
| CN102819536A (en) * | 2011-09-27 | 2012-12-12 | 金蝶软件（中国）有限公司 | Processing method and device of tree type data |
| CN103049556A (en) * | 2012-12-28 | 2013-04-17 | 中国科学院深圳先进技术研究院 | Fast statistical query method for mass medical data |
| JP2013105401A (en) * | 2011-11-15 | 2013-05-30 | Enegate:Kk | Ontology construction support device, program for the same and computer-readable recording medium recording program |
| EP2782054A1 (en) * | 2013-03-18 | 2014-09-24 | Optimal Medicine Ltd | Personalised medicine system for context based advisory information |
| CN105488043A (en) * | 2014-09-15 | 2016-04-13 | 南京理工大学 | Data query method and system based on Key-Value data blocks |
| CN105959419A (en) * | 2016-07-15 | 2016-09-21 | 浪潮(北京)电子信息产业有限公司 | Establishment method and system for distributed storage structure based on consensus tree |
| KR20170133692A (en) * | 2016-05-26 | 2017-12-06 | 아주대학교산학협력단 | Method and Apparatus for generating association rules between medical words in medical record document |
| US20180025131A1 (en) * | 2010-04-28 | 2018-01-25 | Stc.Unm | System and methods for performing medical physics calculations |
| US20180039760A1 (en) * | 2015-02-23 | 2018-02-08 | Smart Reporting Gmbh | Apparatus and method for producing a medical report |
| US20180165415A1 (en) * | 2016-12-09 | 2018-06-14 | International Business Machines Corporation | Method and system for automatic knowledge-based feature extraction from electronic medical records |
| US20180165281A1 (en) * | 2016-12-09 | 2018-06-14 | Salesforce.Com, Inc. | Match index creation |
| CN109947892A (en) * | 2017-12-04 | 2019-06-28 | 阿里巴巴集团控股有限公司 | Analysis path determines method and system, interface, log tree constructing method |
| EP3537454A1 (en) * | 2018-03-07 | 2019-09-11 | Siemens Healthcare GmbH | Healthcare network |
| CN110727737A (en) * | 2019-10-29 | 2020-01-24 | 南京邮电大学 | Intelligent medical data storage method based on multi-level block chain system architecture |
| CN111128325A (en) * | 2019-12-23 | 2020-05-08 | 南京医睿科技有限公司 | Medical data storage method and device, electronic equipment and storage medium |
| CN111339382A (en) * | 2020-03-11 | 2020-06-26 | 腾讯科技（深圳）有限公司 | Character string data retrieval method and device, computer equipment and storage medium |
-
2021
- 2021-05-10 CN CN202110507445.9A patent/CN113380356B/en active Active
Patent Citations (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101535990A (en) * | 2006-08-23 | 2009-09-16 | 创新解决方案公司 | Efficient search result update mechanism |
| US20180025131A1 (en) * | 2010-04-28 | 2018-01-25 | Stc.Unm | System and methods for performing medical physics calculations |
| US20120173585A1 (en) * | 2010-12-30 | 2012-07-05 | Yue Pan | Obtaining hierarchical information of planar data |
| CN102819536A (en) * | 2011-09-27 | 2012-12-12 | 金蝶软件（中国）有限公司 | Processing method and device of tree type data |
| JP2013105401A (en) * | 2011-11-15 | 2013-05-30 | Enegate:Kk | Ontology construction support device, program for the same and computer-readable recording medium recording program |
| CN102402602A (en) * | 2011-11-18 | 2012-04-04 | 航天科工深圳（集团）有限公司 | B+ tree indexing method and device of real-time database |
| CN103049556A (en) * | 2012-12-28 | 2013-04-17 | 中国科学院深圳先进技术研究院 | Fast statistical query method for mass medical data |
| EP2782054A1 (en) * | 2013-03-18 | 2014-09-24 | Optimal Medicine Ltd | Personalised medicine system for context based advisory information |
| CN105488043A (en) * | 2014-09-15 | 2016-04-13 | 南京理工大学 | Data query method and system based on Key-Value data blocks |
| US20180039760A1 (en) * | 2015-02-23 | 2018-02-08 | Smart Reporting Gmbh | Apparatus and method for producing a medical report |
| KR20170133692A (en) * | 2016-05-26 | 2017-12-06 | 아주대학교산학협력단 | Method and Apparatus for generating association rules between medical words in medical record document |
| CN105959419A (en) * | 2016-07-15 | 2016-09-21 | 浪潮(北京)电子信息产业有限公司 | Establishment method and system for distributed storage structure based on consensus tree |
| US20180165415A1 (en) * | 2016-12-09 | 2018-06-14 | International Business Machines Corporation | Method and system for automatic knowledge-based feature extraction from electronic medical records |
| US20180165281A1 (en) * | 2016-12-09 | 2018-06-14 | Salesforce.Com, Inc. | Match index creation |
| CN109947892A (en) * | 2017-12-04 | 2019-06-28 | 阿里巴巴集团控股有限公司 | Analysis path determines method and system, interface, log tree constructing method |
| EP3537454A1 (en) * | 2018-03-07 | 2019-09-11 | Siemens Healthcare GmbH | Healthcare network |
| CN110727737A (en) * | 2019-10-29 | 2020-01-24 | 南京邮电大学 | Intelligent medical data storage method based on multi-level block chain system architecture |
| CN111128325A (en) * | 2019-12-23 | 2020-05-08 | 南京医睿科技有限公司 | Medical data storage method and device, electronic equipment and storage medium |
| CN111339382A (en) * | 2020-03-11 | 2020-06-26 | 腾讯科技（深圳）有限公司 | Character string data retrieval method and device, computer equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113380356B (en) | 2024-04-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111401066B (en) | Artificial intelligence-based word classification model training method, word processing method and device | |
| WO2018200135A1 (en) | Intent-based organisation of apis | |
| CN108664599B (en) | Intelligent question-answering method and device, intelligent question-answering server and storage medium | |
| US9824088B2 (en) | Active knowledge guidance based on deep document analysis | |
| US20070282940A1 (en) | Thread-ranking apparatus and method | |
| CN102243647A (en) | Extracting higher-order knowledge from structured data | |
| CN110781204B (en) | Identification information determining method, device, equipment and storage medium of target object | |
| JP2020135891A (en) | Methods, apparatus, devices and media for providing search suggestions | |
| Whaley et al. | Knowledge organization systems for systematic chemical assessments | |
| Baskaran et al. | Automated scraping of structured data records from health discussion forums using semantic analysis | |
| CN107861753A (en) | APP generations index, search method and system and readable storage medium storing program for executing | |
| CN110188165A (en) | Contract template acquisition methods, device, storage medium and computer equipment | |
| Rajabi et al. | An empirical study on the evaluation of interlinking tools on the Web of Data | |
| CN110245242B (en) | Medical knowledge graph construction method and device and terminal | |
| KR20160120583A (en) | Knowledge Management System and method for data management based on knowledge structure | |
| AU2022201117B2 (en) | Frameworks and methodologies for enabling searching and/or categorisation of digitised information, including clinical report data | |
| CN111126034A (en) | Medical variable relation processing method and device, computer medium and electronic equipment | |
| Sun et al. | A scenario model aggregation approach for mobile app requirements evolution based on user comments | |
| CN113380356A (en) | Medical examination data recording method, query method and device based on branch chain type tracing | |
| CN113704422A (en) | Text recommendation method and device, computer equipment and storage medium | |
| Porter et al. | The long COVID research literature | |
| Kasegn et al. | Spatial locality based identifier name recommendation | |
| Schindler et al. | An annotation scheme for references to research artefacts in scientific publications | |
| Wang et al. | WikiMed-DE: Constructing a Silver-Standard Dataset for German Biomedical Entity Linking using Wikipedia and Wikidata | |
| Marshall et al. | Aggregating automatically extracted regulatory pathway relations |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |