CN113380356B - Branch chain type traceable medical examination data recording method, inquiring method and device - Google Patents
Branch chain type traceable medical examination data recording method, inquiring method and device Download PDFInfo
- Publication number
- CN113380356B CN113380356B CN202110507445.9A CN202110507445A CN113380356B CN 113380356 B CN113380356 B CN 113380356B CN 202110507445 A CN202110507445 A CN 202110507445A CN 113380356 B CN113380356 B CN 113380356B
- Authority
- CN
- China
- Prior art keywords
- node
- result
- branch
- level
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 79
- 230000004044 response Effects 0.000 claims abstract description 8
- 238000012360 testing method Methods 0.000 claims description 24
- 230000002776 aggregation Effects 0.000 claims description 3
- 238000004220 aggregation Methods 0.000 claims description 3
- 238000012512 characterization method Methods 0.000 claims description 3
- 238000003860 storage Methods 0.000 description 8
- 230000006870 function Effects 0.000 description 5
- 230000008569 process Effects 0.000 description 5
- 230000009286 beneficial effect Effects 0.000 description 4
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000007405 data analysis Methods 0.000 description 3
- 238000010561 standard procedure Methods 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 238000001514 detection method Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000011984 electrochemiluminescence immunoassay Methods 0.000 description 2
- 238000004949 mass spectrometry Methods 0.000 description 2
- 238000011022 operating instruction Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 239000002356 single layer Substances 0.000 description 2
- 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 1
- 239000008280 blood Substances 0.000 description 1
- 210000004369 blood Anatomy 0.000 description 1
- 238000003759 clinical diagnosis Methods 0.000 description 1
- 238000004590 computer program Methods 0.000 description 1
- 238000007418 data mining Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000001419 dependent effect Effects 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
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 229960005309 estradiol Drugs 0.000 description 1
- 229930182833 estradiol Natural products 0.000 description 1
- 230000036541 health Effects 0.000 description 1
- 230000036039 immunity Effects 0.000 description 1
- 238000003018 immunoassay Methods 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
- 210000002966 serum Anatomy 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000010257 thawing Methods 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
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 branch chain traceability medical examination data recording method, a query method and a device, wherein the method comprises the following steps: establishing a first branch in a branch record table in response to a first operation instruction; the first branch includes a number of different levels of first nodes, each having a first child I D, a first I D, first content, and a first end node state; the first final 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 comprising first content in a query result table; by setting the first I D, the first content and the first terminal node state for each first node, when the searching and tracing are needed, the first content in the first node of the first terminal node state representation result node can be determined according to the searching content, then the first content is directly displayed in a query result table as result information, and the tracing convenience and effectiveness are improved.
Description
Technical Field
The invention relates to the field of data storage, in particular to a branch chain traceability medical examination data recording method, a query method and a device.
Background
With the rapid development of medical technology and ideas and the growing concern about 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, no good record system exists for the test result of medical data, all historical test data are simply recorded into a database for standby and backup analysis, the condition of LIS (test information system) and HIS (hospital information system) of each large manufacturer is included, the data cannot be used for later large data analysis, meanwhile, the basic idea of the magnitude tracing is that one methodology is assumed to be accurate because the existing data tracing mode is magnitude tracing, other methodologies take a calibrator with uniform standard concentration as a reference, after the test signal value of a certain method is obtained, the test result represented by the signal value is close to the standard method, so that consistency of all results is ensured, the tracing method has the problem of high centralization, and if the standard method cannot accurately represent the performance of a demander, the possibility of being wrongly evaluated can appear in all methods, for example: if the standard method is mass spectrometry, and if mass spectrometry itself cannot fully explain the clinical manifestation of a patient, an antibody of an immunoassay method is more consistent with the biological immunity situation of the patient, and if the clinical manifestation can be explained, the quantitative tracing is not a better choice and the value of the evaluated method cannot be evaluated accurately and objectively based on the concept that evidence-based medicine and test results are ultimately used for explaining the clinical manifestation to guide clinical diagnosis. Due to the tracing problem, a large amount of data noise exists and cannot be filtered, and finally, the result of large data analysis is unreliable, so that a new data recording method is necessary to be arranged, and the tracing convenience and effectiveness are improved.
Disclosure of Invention
In view of the above, the present invention aims to provide a branch chain traceability medical examination data recording method, a query method and a device thereof.
The technical scheme adopted by the invention is as follows:
a branch chain traceable medical examination data recording method comprises the following steps:
establishing a first branch in a branch record table in response to a first operation instruction;
the first branch comprises a plurality of first nodes with different levels, and each first node is provided with a first sub-ID, a first ID, first content and a first terminal node state; the first ID of the first node of each level is determined according to the first ID of the first node of the level previous to 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 at the highest level is determined according to the first child ID of the first node at the highest level and the father ID of the virtual initial node; the first final 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 comprising the first content in a query result table; the first node at the lowest level is the result node.
Further, sequentially adding a first ID of a first node at a level previous to the current level of the first node and a first sub-ID of the first node at the current level to form a first ID of a long integer or an integer based on preset characters;
or,
and sequentially adding the father ID of the virtual initial node and the first child ID of the first node at the highest level based on preset characters to form a first ID of a long integer or an integer as the first ID of the first node at the highest level.
Further, the result information includes at least one test result, the test result having a second unique number, the method further comprising:
a first unique number is added to the first node, the first unique number being used to associate with the second unique number of the verification result.
Further, the method further comprises:
establishing a second branch in the branch record table in response to the second operation instruction;
wherein the second branch comprises at least one second node, the second node has a second child ID, a second ID, second content and a second end node state, and the second ID of the highest level of the second node is determined according to the parent ID and the second child ID of the highest level of the second node; the second final node state is used for representing whether the second node is a result node, and the result node is further used for displaying result information including 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 terminal node state, wherein 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 the accumulated preset value of the first sub-ID of the first node of the same level as the new first node;
setting the new first final node state to a first value, or setting the new first final node state to the first value and updating the first final node state of the first node of the first level on the new first node to a second value; the first value is used to characterize the result node and the second value is used to characterize the non-result node.
The invention also provides a query method applied to the data recorded by the branch chain traceability medical examination data recording method, which comprises the following steps:
acquiring retrieval information;
determining first content meeting the search information according to the search 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 the first final 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 final node state characterization result node further includes a result type state bit, and the displaying the 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 status bit of the target node in the result ID set, wherein the query result table comprises the type result table.
Further, the acquiring the search information includes:
taking the input initial information as retrieval information;
or,
and adjusting the input initial information by adding or deleting preset characters in the first ID, and taking the adjusted initial information as search information.
The present invention also 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;
the first branch comprises a plurality of first nodes with different levels, and each first node is provided with a first sub-ID, a first ID, first content and a first terminal node state; the first ID of the first node of each level is determined according to the first ID of the first node of the level previous to 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 at the highest level is determined according to the first child ID of the first node at the highest level and the father ID of the virtual initial node; the first final 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 comprising the first content in a query result table; the first node at the lowest level is the result node.
The invention also provides a query device which is applied to the data recorded by the branch chain traceability medical examination data recording method, and comprises the following steps:
the acquisition module is used for acquiring the retrieval information;
the target node module is used for determining first content meeting the search information according to the search information and determining a first node corresponding to the first content as a target node;
the aggregation module is used for taking a first ID or a first unique number of the target node of the first final node state representation result node as a result ID set;
and the result module is used for displaying a query result table according to the result ID set.
The invention also provides a device, which comprises a processor and a memory;
the memory stores a program;
the processor executes the program to implement the branch chain traceability medical examination data recording method or the query method.
The invention also provides a computer readable storage medium storing a program which when executed by a processor implements the branch chain traceability medical examination data recording method or the query method.
The beneficial effects of the invention are as follows: establishing a first branch in a branch record table in response to a first operation instruction; the first branch comprises a plurality of first nodes with different levels, and each first node is provided with a first sub-ID, a first ID, first content and a first terminal node state; the first ID of the first node of each level is determined according to the first ID of the first node of the level previous to 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 at the highest level is determined according to the first child ID of the first node at the highest level and the father ID of the virtual initial node; the first final 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 comprising the first content in a query result table; the first node of the lowest level is a result node; according to the invention, by setting the unique first ID, the corresponding first content and the first terminal node state for each first node, when the searching and tracing are needed, the first content in the first node of the lowest level of the first terminal node state representation result node can be determined according to the searching content, and then the first content is directly displayed in the query result table as the result information, so that the tracing convenience and effectiveness are improved.
Drawings
FIG. 1 is a schematic flow chart of steps of a branch chain traceability medical examination data recording method of the present invention;
FIG. 2 is a first schematic diagram of a branch table according to an embodiment of the present invention;
FIG. 3 is a second diagram of a branch table according to an embodiment of the present invention;
FIG. 4 is a flow chart illustrating the steps of the query method of the present invention.
Detailed Description
In order to make the present application solution better understood by those skilled in the art, the following description will be made in detail and with reference to the accompanying drawings in the embodiments of the present application, it is apparent that the described embodiments are only some embodiments of the present application, not all embodiments. All other embodiments, which can be made by one of ordinary skill in the art based on the embodiments herein without making any inventive effort, shall fall within the scope of the present application.
The terms "first," "second," "third," and "fourth" and the like in the description and in the claims of this application and in the drawings, are used for distinguishing between different objects and not for describing a particular sequential order. Furthermore, the terms "comprise" and "have," as well as any variations thereof, are intended to cover a non-exclusive inclusion. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not limited to only those listed steps or elements but may 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 may be included in at least one embodiment of the present application. The appearances of such phrases 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. Those of skill in the art will explicitly and implicitly appreciate that the embodiments described herein may be combined with other embodiments.
As shown in fig. 1, an embodiment of the present invention provides a branch chain traceability medical examination data recording method, which includes step S100:
s100, responding to a first operation instruction, and establishing a first branch in a branch record table.
In the embodiment of the present invention, the first operation instruction may be an instruction generated by a keyboard, a mouse, or a voice, and may include a plurality of first operation sub-instructions having a sequence, for example, each operation sub-instruction is used to create a first node (including a first content), and a plurality of first nodes are generated to form a first branch through the plurality of first operation sub-instructions. The branch record table refers to a record table for recording the branches and node information of 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 a number of different levels of first nodes, each having a first sub-ID, a first content and a first end node state; the first ID of the first node of each level is determined according to the first ID of the first node of the level previous to 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 at the highest level is determined according to the first child ID of the first node at the highest level and the father ID of the virtual initial node, wherein the virtual initial node is the starting point; the first final 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 comprising the first content in a query result table; the first node at the lowest level is the result node.
Specifically, when a user performs retrieval and tracing, first content contained in a corresponding result node is displayed in a query result table as result information.
Optionally, the first content may include a node header and node details (s_tips_details), where the node details are detailed descriptions corresponding to the node, the node header may be a character type or a long integer type, and the node details may be a character type. In addition, the first end node state may be integer, the parent ID and the first ID may be long characters, and the first child ID may be long integer.
It should be noted that, each time a first node is generated/built, each first node automatically generates a first end node state, a child ID, and a first ID according to its own level and location. 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 that is extended from top to bottom, the level of the first node located above is higher than the first level located below, and when the first node is established, the first node is established from top to bottom. It will be appreciated that, assuming that there is a first node a, a first node B located above and adjacent to the first node a at the current level (i.e., a first node at a level previous to the current level) is a parent node of the first node a, a first node C located below and adjacent to the first node a at the current level (i.e., a first node at a level next to the current level) is a parent node of the first node a, and so on.
In the 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=1 of a first node, i_end_flag is true, and the first node is represented as a result node; when i_end_flag=0 of a first node, i_end_flag is false, the first node is represented as a non-result node, i.e. the first node is actually an intermediate node.
It should be noted that, taking the related information of the recording instrument as an example, 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 related meaning, and can be increased at will, and no unified planning and overall planning are realized, namely, the instrument table is just equivalent to a container for checking and recording, is equivalent to an identifier, and has no practical meaning; the table of recorded 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 independent and not related in nature and is not a concept of branches. In the embodiment of the invention, the existing instrument table is recorded as a branch record table with a branch relation, a main key (such as a unique number, an ID (identity) and the like) of the branch table is provided, each record (each node) has strict correlation, unified planning and overall planning are needed to be added, the record is not only a container, the result information belongs to which node has strict planning and correlation, and the branch record table is a traceable branch record map and can be effectively applied to big data analysis data mining; in the result table, there is a primary key (including but not limited to a unique number), which no longer corresponds to a certain instrument record, but corresponds to a certain node of the branch table (the terminal status bit of the node is true, and the node can still extend downwards to add the node.
Specifically, the determination of the first ID of the first node includes step S110:
s110, sequentially adding a first ID of a first node of a level previous to the current level of the first node and a first sub-ID of the first node of the current level based on preset characters to form a long integer or a first ID of the integer;
or,
and sequentially adding the father ID of the virtual initial node and the first child ID of the first node at the highest level based on preset characters to form a first ID of a long integer or an integer as the first ID of the first node at the highest level.
Specifically, as shown in fig. 2, there is a virtual initial node 300 as a starting point and a branch record table 200, the branch record table 200 has a first branch 210, the first branch 210 has a first node 211 of the highest level (first level), the first node 212 of the second level and the first node 213 of the third level, and if 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 with the first ID of the first node 211 formed as a long integer being "0_1", and in this embodiment, a preset character of oak is illustrated as an example. Assuming that the first child ID of the first node 212 is "1", the first node 212 first ID "0_1" of the first node 211 of the level previous to the current level of the first node 212 and the first child ID "1" of the first node of the current level are sequentially added with the first ID "0_1_1" forming a long integer; and the first child 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 its own child ID and the ID of the node of the previous level, but the method is not limited to the manner of adding sequentially, and may be determined according to other generating methods, and the embodiment of the present invention is not limited specifically. It will be appreciated that, at this time, the node at the highest level is the first node 211, the node at the lowest level is the first node 213, and at this time, the first terminal node state i_end_flag=0 of the first node 211, the first terminal node state i_end_flag=0 of the first node 212, and the first terminal node state i_end_flag=1 of the first node 213, at this time, the first node 213 is the result node. Wherein 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 node at the lowest level may have one or more, and the node at the lowest level refers to a node below which no other node extends, that is, the node is not a parent node of any node.
Specifically, the branch chain traceability medical examination data recording method of the embodiment of the present invention further includes step S120:
s120, 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, the second node has a second child ID, a second ID, second content and a second end node state, and the second ID of the highest level of the second node is determined according to the parent ID and the second child ID of the highest level of the second node; the second final node state is used for representing whether the second node is a result node, and the result node is further used for displaying result information including the second content in a query result table.
Similarly, the second content may also include a node header and node details (s_tips_details), where the format and definition of the second node are the same as those of the first node, and 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 manner is the same as that of the first node, and will not be described again. It should be noted that, the execution sequence is not limited between the second operation instruction and the first operation instruction, when the first operation instruction includes a plurality of first operation sub-instructions having a sequence, for example, each first operation sub-instruction is used for establishing a first node, the second operation instruction includes a plurality of second operation sub-instructions having a sequence, for example, each second operation sub-instruction is used for establishing a second node, and the sequence of the first operation sub-instruction and the second operation sub-instruction is not limited. It will be appreciated that the second operating instruction may equally be an instruction generated by means of a keyboard, mouse or voice, etc.
For example, as shown in fig. 2, the branch record table 200 has a second branch 220, and a second node 221 with the highest level (first level) and a second node 222 with the second level in the 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 parent ID "0" of the virtual initial node and the second child ID "2" of the second node 221 are sequentially added to form a long integer type of second ID of "0_2". Assuming that the second child ID of the second node 222 is "1", the second ID "0_2" of the second node 221 of the level previous to the current level of the second node 222 and the second child ID "1" of the second node of the current level are sequentially added with the second ID "0_2_1" forming a long integer. It can be understood that, at this time, there are two nodes at the highest level, namely the first node 211 and the second node 221, and two nodes at the lowest level, namely the first node 213 and the second node 222, at this time, the second end node state i_end_flag=0 of the second node 221, the second end node state of the second node 222, and the first end node state of the first node 213 are both i_end_flag=1, and at this time, the second node 222 and the first node 213 are both result nodes. The second branch refers to a branch established by extending downward with the second node 221 as the highest level node. It will be appreciated that through several operating instructions, an nth node may be established, generating N branches. Therefore, through the setting of the embodiment of the invention, all nodes are stored in the branch record table, intermediate nodes and 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 node details in the content of the node, for example, the first content of the first node, may be stored in a database, a data table or a series of storages, instead of being stored in the node record table, and associated with and uniquely corresponding to the first ID of the first node, where the branch record table corresponds to a dictionary describing the content or representation, and then may be called according to the first ID to display the first content when the subsequent query is performed, and it is understood that when the first node includes the first content, this means that the first node includes information that may be called and associated with the first content, for example, the first ID.
Specifically, the branch chain traceability medical examination data recording method of the embodiment of the invention further comprises steps S131-S132:
s131, responding to a third operation instruction, and adding a new first node in the first branch; the new first node includes 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 new first ID and the new first sub-ID of the first node of the previous level of the current level, and the new first sub-ID is determined according to a preset value accumulated with the first sub-ID of the first node of the same level as the new first node.
Similarly, the third operation instruction may be an instruction generated by a keyboard, a mouse, or voice, and the third operation instruction, the first operation instruction, and the second operation instruction do not limit the execution order. It should be noted that, the new first ID, the new first sub-ID, the new first content, and the new first end node status are the same as the format and definition of the first node, and will not be described again.
And S132, setting the new first final node state as a first value, or setting the new first final node state as the first value and updating the first final node state of the first node of the upper level of the new first node as a second value.
For example, as shown in fig. 3, a new first node 214 is added to the first branch 210, where the first node 214 is located at the lowest level, and where the new first end node state of the first node 214 is set to a 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, where the first node 215 is located at the lowest level, the new first end node state of the first node 215 is set to a first value, i.e. the new first end node state i_end_flag is 1, and the first node 213 is changed from the lowest level to the middle level, i.e. the level above the first node 215, where 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 i_end_flag is changed from 1 to 0, and the node is changed from the first node 213 to the first node 215. It will be appreciated that the principle is similar when the second branch or the nth branch establishes a new node, and will not be described again.
In the embodiment of the present invention, the preset values include, but are not limited to, "1". As shown in fig. 3, the new child ID of the first node 214 is "2", that is, determined by accumulating the preset value "1" according to the first child 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"; while the ID of the first node 213 is "0_1_1_1", the new child 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 of the first node 214 of the first branch 210, the second node 222 may be moved to the right of the first node 214 at this time, 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 plurality of branches and the nodes under the plurality of branches continuously extend is realized, and the effects of classifying the data of the 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, the test result has a second unique number, and the branch chain traceable medical examination data recording method according to the embodiment of the present invention further includes step S140:
a first unique number is added to the first node, the first unique number being used to associate with a second unique number of the test result.
It should be noted that, when one first node corresponds to a plurality of test results, each type of test result has a corresponding result type status bit and a second unique number, and the second unique number has an association relationship with the first unique number. Wherein the result node in each branch may be configured to associate the corresponding first unique number with the second unique number of the test result.
As shown in fig. 4, the embodiment of the present invention further provides a query method applied to data recorded by the above-mentioned branch chain traceability medical examination data recording method, including steps S210-S240:
s210, acquiring search information.
Optionally step S210 may include the steps of: s211 or S212:
s211, taking the input initial information as search information.
Alternatively, the input initial information is determined by means of a keyboard, a mouse, or voice recognition, etc., and the search field includes, but is not limited to, a single text, a word, a 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 search information.
When the input initial information 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 search information, so that the subset and the father set can be conveniently searched, for example: searching, judging and processing the subset, and only matching the father id of the node with the child id of the node and with the "_"; the parent set is searched, judged and processed, only the last "_and the last" _split element are needed to be removed for matching, the number of times of searching the database can be reduced in actual operation, and even the dictionary can be manually searched, the whole tracing chain is not needed to be recursively restored by program traversal, and the method is very convenient in daily work.
S220, determining first content meeting the search information according to the search information, and determining a first node corresponding to the first content as a target node.
Specifically, matching is performed from the contents of all the nodes according to the search information, the contents satisfying the search information are determined, and the node having the contents satisfying the search 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 a relationship 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 satisfying 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 first contents satisfying the retrieval information, and the target nodes are the first node 213, the first node 215, and the first node 214.
S230, taking the first ID or the first unique number of the target node of the first final node state representation result node as a result ID set.
Specifically, the result node, i.e., the first node of the first end node state i_end_flag=1, is 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", and "0_1_2" and "0_1_1_1" are taken as the result ID set. Alternatively, when the first node is configured with a first unique number, the first unique number of the destination node of the final node state characterization result node is taken as the ID set.
S240, displaying a query result table according to the result ID set.
Specifically, the query result table refers to a table containing matching results displayed after searching and matching in the branch record table according to the search information. Optionally, the target node of the first final node state representation result node further includes a result type state bit, for example, the result type state bit i_type=1 represents a test result, i_type=2 represents a diagnosis result, i_type=3 represents a customer service query, i_type=n represents "… …" content, which may be set according to requirements. It should be noted that all nodes in the branch table have a type status bit, and the first node at the lowest level is automatically set to the type status bit of the test result, i.e., the result type status bit, i_type=1 at the time of establishment.
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 status bit of the target node in the result ID set.
In the embodiment of the invention, when the status bits of the result types of the nodes are different, i.e. different nodes represent different result types, when the query result table is displayed, the test results corresponding to the different result types can be respectively displayed in the type result tables of the corresponding types, then the type result tables are combined, or the type result tables are separated and then displayed in different window pages, or the type result tables separated by a certain distance are displayed in one page, wherein the query result table comprises the type result tables. Specifically, assuming that i_type=1 of the first node 214, i_type=2 of the first node 215, then a type result table of i_type=1 including the first content of the first node 214 is displayed, and a type result table of i_type=2 including the first content of the second node 215 is displayed, thereby realizing the display of the query result table. It should be noted that, when one first node corresponds to a plurality of test results, different test results can be searched and all the test results can be associated with the first unique number through the second unique number of the test result, so that the first content test result of the corresponding first unique number of the first node is displayed, and the display mode is similar and will not be repeated.
It should be noted that, the type result table may also display 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, for example, the 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" of the first node 215 can 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 first node 211 or the related information including the first node 211 and all the first nodes extending downward with the first node 211 as the highest level node 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.
As shown in fig. 3, the method is described below with reference to medical data, for example, the title of the first node 211 is a brand of immunodetector, the titles of the first node 212 and the first node 214 represent different models of the brand, the node details can be parameters or results in the detection process, and the like, when a laboratory performs scientific research, the sample of the scientific research is a serum sample repeatedly frozen and thawed for 3 times, and the user can add a first node 213, and the node title is "repeatedly frozen and thawed for 3 times".
For example, in performing query tracing, the following ID refers to the complete ID (first ID) of the node. Assuming that the ID of the virtual initial node is (0), there is a child node "immunodetection" ID (0_1), there is a child node "chemiluminescent detection method" ID (0_1_2), then "electrochemiluminescence" ID (0_1_2_3), then "brand" ID (0_1_2_3_1), then "rogowski" ID (0_1_2_3_2), then "model" ID (0_1_2_3_1_2_3), then "cobase411 fully automatic electrochemiluminescence immunoassay instrument" ID (0_1_2_3_1_2_3), then there may be two equal child branches ("normal blood drawing", "repeated freeze thawing 3 times"), then there are several child branches ("under 25 years", "under 35 years", "over 35 years of age"), if only "rogowski 411 fully automatic electrochemiluminescence immunoassay instrument detects all estradiol under 25 years of age, then the results can be retrieved from a single-layer table and the search table, and the results can be searched for the results, and the results can be retrieved by a single-layer table, and the search table is only, and the results are all the table are searched for the results are searched for.
The embodiment of the invention also provides a recording device, which comprises:
the establishing module is used for responding to the first operation instruction and establishing a first branch in the branch record table;
the first branch comprises a plurality of first nodes with different levels, and each first node is provided with a first sub-ID, a first ID, first content and a first terminal node state; the first ID of the first node of each level is determined according to the first ID of the first node of the level previous to 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 at the highest level is determined according to the first child ID of the first node at the highest level and the father ID of the virtual initial node; the first final 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 comprising the first content in a query result table; the first node at the lowest level is the result node.
The content in the embodiment of the branch chain tracing medical examination data recording method is applicable to the embodiment of the device, the functions of the embodiment of the device are the same as those of the embodiment of the branch chain tracing medical examination data recording method, and the achieved beneficial effects are the same as those of the embodiment of the branch chain tracing medical examination data recording method.
The invention also provides a query device which is applied to the data recorded by the branch chain tracing medical examination data recording method, and comprises the following steps:
the acquisition module is used for acquiring the retrieval information;
the target node module is used for determining first content meeting the search information according to the search information and determining a first node corresponding to the first content as a target node;
the aggregation module is used for taking a first ID or a first unique number of the target node of the first final node state representation result node as a result ID set;
and the result module is used for displaying a query result table according to the result ID set.
The content in the above query method embodiment is applicable to the embodiment of the present device, and the functions specifically implemented by the embodiment of the present device are the same as those of the above query method embodiment, and the beneficial effects achieved by the embodiment of the present device are the same as those achieved by the above query method embodiment.
The embodiment of the invention also provides a device, which comprises a processor and a memory;
the memory is used for storing programs;
the processor is used for executing a program to realize the branch chain traceability 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 functions of data recording or data query. The device can be any intelligent terminal including a mobile phone, a tablet personal computer, a computer and the like.
The content in the method embodiment is applicable to the embodiment of the device, and the functions specifically realized by the embodiment of the device are the same as those of the method embodiment, and the obtained beneficial effects are the same as those of the method embodiment.
The embodiment of the invention also provides a computer readable storage medium, wherein the computer readable storage medium stores a program, and the program is executed by a processor to complete the branch chain tracing medical examination data recording method or the query method according to the embodiment of the invention.
The embodiment of the invention also provides a computer program product comprising instructions, which when run on a computer, cause the computer to execute the branch chain traceability medical examination data recording method or the query method of the embodiment of the invention.
The terms "first," "second," "third," "fourth," and the like in the description of the present application and in the above-described figures, if any, are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that embodiments of the present application described herein may be implemented in sequences other than those illustrated or otherwise 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 this application, "at least one" means one or more, and "a plurality" means two or more. "and/or" for describing the association relationship of the association object, the representation may have three relationships, for example, "a and/or B" may represent: only a, only B and both a and B are present, wherein a, B may be singular or plural. The character "/" generally indicates that the context-dependent object is an "or" relationship. "at least one of" or the like means any combination of these items, including any combination of single item(s) or plural items(s). 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 this application, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative, e.g., the division of elements is merely a logical functional division, and there may be additional divisions of actual implementation, e.g., multiple elements or components may be combined or integrated into another system, or some features may be omitted, or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices or units, which may be in electrical, mechanical or other form. The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed over a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment. In addition, each functional unit in each embodiment of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in software functional units.
The integrated units, if implemented in the form of software functional units and sold or used as stand-alone products, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be embodied in essence or a part contributing to the prior art or all or part of the technical solution in the form of a software product stored in a storage medium, including multiple instructions to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the methods of the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (Random Access Memory, RAM), a magnetic disk, or an optical disk, or other various media capable of storing a program.
The above embodiments are only for illustrating the technical solution of the present application, and not for limiting 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 scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the corresponding technical solutions.
Claims (8)
1. The branch chain type traceable medical examination data recording method is characterized by comprising the following steps of:
establishing a first branch in a branch record table in response to a first operation instruction;
the first branch comprises a plurality of first nodes with different levels, and each first node is provided with a first sub-ID, a first ID, first content and a first terminal node state; the first ID of the first node of each level is determined according to the first ID of the first node of the level previous to 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 at the highest level is determined according to the first child ID of the first node at the highest level and the father ID of the virtual initial node; the first final 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 comprising the first content in a query result table; the first node at the lowest level is a result node, the result information comprises at least one check result, the check result has a second unique number, the first content is used for matching retrieval information, the result node is further used for generating a query result table, the result node further comprises a result type status bit, the query result table comprises a type result table, and the result node is further used for generating the type result table;
The method further comprises the steps of: a first unique number is added to the first node, the first unique number being for association with the second unique number of the test result, the first unique number and the second unique number being for associating the first node of the branch record table with the result node of the query result table.
2. The branching chain traceability 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 of a level previous to the current level of the first node and a first sub-ID of the first node of the current level based on preset characters to form a first ID of a long integer or an integer;
or,
and sequentially adding the father ID of the virtual initial node and the first child ID of the first node at the highest level based on preset characters to form a first ID of a long integer or an integer as the first ID of the first node at the highest level.
3. The branching chain traceability medical examination data recording method according to claim 1, wherein: the method further comprises the steps of:
establishing a second branch in the branch record table in response to the second operation instruction;
Wherein the second branch comprises at least one second node, the second node has a second child ID, a second ID, second content and a second end node state, and the second ID of the highest level of the second node is determined according to the parent ID and the second child ID of the highest level of the second node; the second final node state is used for representing whether the second node is a result node, and the result node is further used for displaying result information including the second content in a query result table.
4. The branching chain traceability medical examination data recording method according to claim 1, wherein: the method further comprises the steps of:
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 terminal node state, wherein 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 the accumulated preset value of the first sub-ID of the first node of the same level as the new first node;
setting the new first final node state to a first value, or setting the new first final node state to the first value and updating the first final node state of the first node of the first level on the new first node to a second value; the first value is used to characterize the result node and the second value is used to characterize the non-result node.
5. A query method applied to data recorded by the branch chain traceable medical examination data recording method according to any one of claims 1 to 4, comprising:
acquiring retrieval information;
determining first content meeting the search information according to the search 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 the first final node state representation result node as a result ID set;
displaying a query result table according to the result ID set, wherein the query result table comprises result information, the result information comprises at least one checking result, the checking result has a second unique number, and the second unique number is used for being associated with the first unique number of the result node;
the target node of the first final node state representation result node further comprises a result type state bit, and the displaying the query result table according to the result ID set comprises: and displaying a type result table of the type corresponding to the target node according to the result type status bit of the target node in the result ID set, wherein the query result table comprises the type result table.
6. The query method as claimed in claim 5, wherein: the obtaining the search information includes:
taking the input initial information as retrieval information;
or,
and adjusting the input initial information by adding or deleting preset characters in the first ID, and taking the adjusted initial information as search information.
7. 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;
the first branch comprises a plurality of first nodes with different levels, and each first node is provided with a first sub-ID, a first ID, first content and a first terminal node state; the first ID of the first node of each level is determined according to the first ID of the first node of the level previous to 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 at the highest level is determined according to the first child ID of the first node at the highest level and the father ID of the virtual initial node; the first final 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 comprising the first content in a query result table; the first node at the lowest level is a result node, the result information comprises at least one check result, the check result has a second unique number, the first content is used for matching retrieval information, the result node is further used for generating a query result table, the result node further comprises a result type status bit, the query result table comprises a type result table, and the result node is further used for generating the type result table;
The recording device is further configured to: a first unique number is added to the first node, the first unique number being for association with the second unique number of the test result, the first unique number and the second unique number being for associating the first node of the branch record table with the result node of the query result table.
8. A query device, applied to data recorded by the branch chain traceable medical examination data recording method according to any one of claims 1 to 4, comprising:
the acquisition module is used for acquiring the retrieval information;
the target node module is used for determining first content meeting the search information according to the search information and determining a first node corresponding to the first content as a target node;
the aggregation module is used for taking a first ID or a first unique number of the target node of the first final node state representation result node as a result ID set;
the result module is used for displaying a query result table according to the result ID set, the query result table comprises result information, the result information comprises at least one checking result, the checking result has a second unique number, and the second unique number is used for being associated with the first unique number of the result node;
The target node of the first final node state characterization result node further comprises a result type state bit, and the result module is specifically configured to: and displaying a type result table of the type corresponding to the target node according to the result type status bit of the target node in the result ID set, wherein the query result table comprises the type result table.
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 CN113380356A (en) | 2021-09-10 |
| CN113380356B true 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 (14)
| 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 for real-time database |
| 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 |
| 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 |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9805170B2 (en) * | 2010-04-28 | 2017-10-31 | Stc.Unm | System and methods for performing medical physics calculations |
| CN102567394B (en) * | 2010-12-30 | 2015-02-25 | 国际商业机器公司 | Method and device for obtaining hierarchical information of plane data |
| DE102015102555A1 (en) * | 2015-02-23 | 2016-08-25 | Qmedify Gmbh | Apparatus and method for making a medical report |
| US10566081B2 (en) * | 2016-12-09 | 2020-02-18 | International Business Machines Corporation | Method and system for automatic knowledge-based feature extraction from electronic medical records |
| US10817465B2 (en) * | 2016-12-09 | 2020-10-27 | Salesforce.Com, Inc. | Match index creation |
-
2021
- 2021-05-10 CN CN202110507445.9A patent/CN113380356B/en active Active
Patent Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101535990A (en) * | 2006-08-23 | 2009-09-16 | 创新解决方案公司 | Efficient search result update mechanism |
| 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 for 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 |
| 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 |
| 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 |
|---|---|
| CN113380356A (en) | 2021-09-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20190108274A1 (en) | Automated concepts for interrogating a document storage database | |
| CN107705834A (en) | A kind of dietary recommendations continued system based on Recognition with Recurrent Neural Network | |
| US8996581B2 (en) | Obtaining hierarchical information of planar data | |
| US10573406B2 (en) | Method, apparatus and computer program product for metabolomics analysis | |
| CN108664599B (en) | Intelligent question-answering method and device, intelligent question-answering server and storage medium | |
| CN110134796A (en) | Clinical test search method, device, computer equipment and the storage medium of knowledge based map | |
| CN106716402A (en) | Entity-centric knowledge discovery | |
| US20070282940A1 (en) | Thread-ranking apparatus and method | |
| Pang et al. | BiobankConnect: software to rapidly connect data elements for pooled analysis across biobanks using ontological and lexical indexing | |
| CN113886716B (en) | Emergency disposal recommendation method and system for food safety emergencies | |
| CN110119473A (en) | A kind of construction method and device of file destination knowledge mapping | |
| KR20110045519A (en) | Entity searching and opinion mining system of hybrid-based using internet and method thereof | |
| CN111341456A (en) | Method and device for generating diabetic foot knowledge map and readable storage medium | |
| CN108427702A (en) | Destination document acquisition methods and application server | |
| Rajabi et al. | An empirical study on the evaluation of interlinking tools on the Web of Data | |
| US20130346385A1 (en) | System and method for a purposeful sharing environment | |
| JP2008234338A (en) | Season degree analysis system, in-season degree analysis method, and season degree analysis program | |
| JP2008181188A (en) | Health-related information providing system | |
| CN108182287A (en) | A kind of automatic question-answering method, device and server | |
| CN108304381B (en) | Entity edge establishing method, device and equipment based on artificial intelligence and storage medium | |
| CN111563172B (en) | Academic hot spot trend prediction method and device based on dynamic knowledge graph construction | |
| KR20120003834A (en) | Entity searching and opinion mining system of hybrid-based using internet and method thereof | |
| CN113380356B (en) | Branch chain type traceable medical examination data recording method, inquiring method and device | |
| CN114117242A (en) | Data query method and device, computer equipment and storage medium | |
| US11645312B2 (en) | Attribute extraction apparatus and attribute extraction method |
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 |