CN112365944A - Tree-shaped data node processing system, method, electronic equipment and storage medium - Google Patents
Tree-shaped data node processing system, method, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN112365944A CN112365944A CN202011151664.XA CN202011151664A CN112365944A CN 112365944 A CN112365944 A CN 112365944A CN 202011151664 A CN202011151664 A CN 202011151664A CN 112365944 A CN112365944 A CN 112365944A
- Authority
- CN
- China
- Prior art keywords
- tree
- data node
- computer
- node
- tree data
- 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.)
- Pending
Links
- 238000012545 processing Methods 0.000 title claims abstract description 44
- 238000000034 method Methods 0.000 title claims abstract description 21
- 238000003672 processing method Methods 0.000 claims abstract description 12
- 230000000007 visual effect Effects 0.000 claims abstract description 7
- 238000004590 computer program Methods 0.000 claims description 9
- 238000013507 mapping Methods 0.000 claims description 8
- 238000012800 visualization Methods 0.000 claims description 8
- 230000010076 replication Effects 0.000 claims description 6
- 230000001131 transforming effect Effects 0.000 claims 1
- 238000010586 diagram Methods 0.000 description 7
- 230000009286 beneficial effect Effects 0.000 description 3
- 238000003745 diagnosis Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000000694 effects Effects 0.000 description 1
- 238000012546 transfer 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/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2246—Trees, e.g. B+trees
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Software Systems (AREA)
- Health & Medical Sciences (AREA)
- Epidemiology (AREA)
- General Health & Medical Sciences (AREA)
- Medical Informatics (AREA)
- Primary Health Care (AREA)
- Public Health (AREA)
- User Interface Of Digital Computer (AREA)
Abstract
The application discloses a tree-shaped data node processing system, a tree-shaped data node processing method, electronic equipment and a storage medium. The system comprises: the system comprises a configurable page, a tree data node mobile engine and a processing module; the method comprises the following steps: a user configures the tree-shaped data nodes through a configurable page of the visual platform; the tree data node mobile engine analyzes the configured tree data nodes and converts the tree data nodes into computer primitives; and the processing module performs corresponding processing according to the converted computer primitive. The method and the device solve the technical problems of high cost and complex processing when the tree-shaped data nodes move due to the fact that the medical record is of a deep nested tree-shaped structure in the related technology.
Description
Technical Field
The present application relates to the field of information technology, and in particular, to a tree-like data node processing system, method, electronic device, and storage medium.
Background
At present, in the field of internet medical treatment, due to the field characteristics of the industry, medical record often forms a deep nested tree structure. Due to the complex deep-level tree structure, when nodes of tree data move according to medical rules, the data nodes have no primitive describing the data and no processing method, so that the data processing cost is increased.
In addition, if a complex tree structure is to be operated, in the prior art, copying, moving and assigning operations are generally performed one by one in a code form for nodes of data to be processed.
Aiming at the problems of high cost and complex processing when the tree-shaped data nodes move because the medical record is of a deep nested tree-shaped structure in the related technology, an effective solution is not provided at present.
Disclosure of Invention
The present application mainly aims to provide a tree data node processing system, a method, an electronic device and a storage medium, so as to solve the problems of high cost and complex processing when moving a tree data node due to a deep nested tree structure of medical records in the related art.
To achieve the above object, in a first aspect, the present application provides a tree-like data node processing system, including: the system comprises a configurable page, a tree data node mobile engine and a processing module;
the configurable page provides a visual configuration page for moving the tree-shaped data nodes for a user according to the configurable rules;
the tree data node mobile engine analyzes the tree data node configuration rule completed by the user and converts the tree data node configuration rule into a computer primitive;
and the processing module carries out corresponding processing according to the converted computer primitive.
The configurable rules include: target point location, mapping relationship, source point location.
And the target point location provides the description of each tree-shaped data node in the target point location.
And the description of each tree data node is visually configured in a data page, leaf points in the digital data are configured, and the tree path name, the leaf point name, the data type, the display style, the selectable item and the data unit of the leaf point are set.
The mapping relation at least comprises one of copying, moving and assigning;
the replication comprises the following steps: reserving the lower content of the original tree-shaped data node, and copying the lower content of the original tree-shaped data node to the position of a target point;
the moving process comprises the following steps: completely moving the lower content of the original tree-shaped data node to the position of a target point, and deleting the lower content of the original tree-shaped data node;
the assignment comprises the following steps: modifying the content of the tree node if the tree node exists under the target point; if no tree node exists, adding new tree node and setting the content of tree node.
The source point location and the assignment provide each tree data node description in the source point location.
In a second aspect, the present application further provides a tree data node processing method, which is implemented by using the tree data node processing system based on the visualization platform.
The method comprises the following steps:
a user configures the tree-shaped data nodes through a configurable page of the visual platform;
the tree data node mobile engine analyzes the configured tree data nodes and converts the tree data nodes into computer primitives;
and the processing module performs corresponding processing according to the converted computer primitive.
The configured tree data nodes are analyzed and converted into computer primitives, and the process is as follows: and the visualization platform predefines all computer primitives with one-to-one configuration, and after the tree data node configuration is completed, the visualization platform is converted into the corresponding computer primitives according to the completed configuration.
An electronic device, comprising a memory for storing a computer program and a processor for executing the computer program to make the computer device execute the tree data node processing method.
A readable storage medium having stored therein computer program instructions, which when read and executed by a processor, perform the tree data node processing method.
The beneficial technical effects are as follows:
the method and the device are beneficial to quickly and accurately copying, moving and assigning the nodes of the data, and meanwhile, the configurable words greatly reduce the cost of data processing.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this application, serve to provide a further understanding of the application and to enable other features, objects, and advantages of the application to be more apparent. The drawings and their description illustrate the embodiments of the invention and do not limit it. In the drawings:
FIG. 1 is a schematic block diagram of a tree data node processing system according to an embodiment of the present application;
FIG. 2 is a flowchart of a method for processing tree-shaped data nodes according to an embodiment of the present disclosure;
FIG. 3 is a schematic diagram illustrating target point positions in a configurable rule according to an embodiment of the present application;
FIG. 4 is a diagram illustrating a mapping relationship in a configurable rule according to an embodiment of the present application;
FIG. 5 is a schematic diagram of source point locations and assignments in a configurable rule provided according to an embodiment of the present application;
fig. 6 is an overall schematic diagram of configurable rules provided according to an embodiment of the present application.
Fig. 7 is a schematic diagram illustrating the type of origin point and target point provided in the embodiment of the present application.
Fig. 8 is a schematic diagram of an alternative to a configurable rule provided according to an embodiment of the present application.
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.
It should be noted that the terms "first," "second," and the like in the description and claims of this application and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It should be understood that the data so used may be interchanged under appropriate circumstances such that embodiments of the application described herein may be used. 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.
In this application, the terms "upper", "lower", "left", "right", "front", "rear", "top", "bottom", "inner", "outer", "middle", "vertical", "horizontal", "lateral", "longitudinal", and the like indicate orientations or positional relationships based on the orientations or positional relationships shown in the drawings. These terms are used primarily to better describe the present application and its embodiments, and are not used to limit the indicated devices, elements or components to a particular orientation or to be constructed and operated in a particular orientation.
Moreover, some of the above terms may be used to indicate other meanings besides the orientation or positional relationship, for example, the term "on" may also be used to indicate some kind of attachment or connection relationship in some cases. The specific meaning of these terms in this application will be understood by those of ordinary skill in the art as appropriate.
In addition, the term "plurality" shall mean two as well as more than two.
It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The present application will be described in detail below with reference to the embodiments with reference to the attached drawings.
In the prior art, the point locations to be copied, moved and assigned are not configurable one by one in the code form, and the point locations are not displayable by a mobile configuration rule. In view of the above, the main objective of the present invention is to provide a configurable implementation scheme for performing node replication, movement and assignment on tree data, which is beneficial to quickly and accurately performing node replication, movement and assignment on data, and greatly reduces the cost of data processing because of the configurable implementation scheme.
In a first aspect, the present application provides a tree-like data node processing system, as shown in fig. 1, including: the system comprises a configurable page, a tree data node mobile engine and a processing module;
the configurable page, the tree-shaped data node mobile engine and the processing module are sequentially connected;
the configurable page provides a mobile visual configuration page for the tree-shaped data nodes for the user according to the configurable rules;
the tree data node mobile engine analyzes the tree data node configuration rule completed by the user and converts the tree data node configuration rule into a computer primitive;
and the processing module carries out corresponding processing according to the converted computer primitive.
The configurable rule, as shown in fig. 6, includes: target point location, mapping relationship, source point location.
The target point location provides a description of each tree-shaped data node in the target point location through a pull-down menu, as shown in fig. 3. Wherein the tree data node list shown in fig. 3 is manually added and maintained in fig. 8. The tree data node description of the target point location can be visually configured on a data page, and as shown in fig. 7, the tree path name, the leaf point name, the data type, the display style, the selectable item, the data unit and the like of the leaf point in the leaf point configuration in the digital data can be set;
the mapping relationship between the target point location and the source point location is provided through a pull-down menu, and is configurable, as shown in fig. 4, the pull-down menu includes: copy, move, and assign values;
the replication comprises the following steps: reserving the lower content of the original tree-shaped data node, and copying the lower content of the original tree-shaped data node to the position of a target point;
the moving process comprises the following steps: completely moving the lower content of the original tree-shaped data node to the position of a target point, and deleting the lower content of the original tree-shaped data node;
the assignment comprises the following steps: modifying the content of the tree node if the tree node exists under the target point; if no tree node exists, adding new tree node and setting the content of tree node.
The source point location and the assignment, as shown in fig. 5, provide each tree data node description in the source point location through a pull-down menu.
And when the operating relationship between the target point position and the source point position is 'assignment', inputting the content to be assigned in the source point position/assignment input box.
In a second aspect, the present application further provides a tree data node processing method, as shown in fig. 2, implemented by using the tree data node processing system based on the visualization platform.
The method comprises the following steps:
step S1: a user configures the tree-shaped data nodes through a configurable page of the visual platform;
the concrete configuration is as follows:
the target point location selects "admission condition-admission diagnosis-main diagnosis" in the drop-down menu, "transfer" in the mapping relationship, and "personal condition-admission diagnosis-main diagnosis" in the source point location.
Step S2: the tree data node mobile engine analyzes the configured tree data nodes and converts the tree data nodes into computer primitives;
the rule processing configured as above is converted into computer primitives:
step S3: and the processing module performs corresponding processing according to the converted computer primitive.
The configured tree data nodes are analyzed and converted into computer primitives, and the process is as follows: and the visualization platform predefines all computer primitives with one-to-one configuration, and after the tree data node configuration is completed, the visualization platform is converted into the corresponding computer primitives according to the completed configuration.
An electronic device comprising a memory for storing a computer program and a processor for executing the computer program to cause the computer device to execute the tree data node processing method according to the present invention.
A readable storage medium having stored therein computer program instructions, which when read and executed by a processor, perform the tree data node processing method.
The above description is only a preferred embodiment of the present application and is not intended to limit the present application, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, improvement and the like made within the spirit and principle of the present application shall be included in the protection scope of the present application.
Claims (10)
1. A tree data node processing system, comprising: the system comprises a configurable page, a tree data node mobile engine and a processing module;
the configurable page provides a visual configuration page for moving the tree-shaped data nodes for a user according to the configurable rules;
the tree data node mobile engine analyzes the tree data node configuration rule completed by the user and converts the tree data node configuration rule into a computer primitive;
and the processing module carries out corresponding processing according to the converted computer primitive.
2. The tree data node processing system of claim 1 wherein the configurable rules comprise: target point location, mapping relationship, source point location.
3. A tree data node processing system as claimed in claim 2 wherein the target point location provides a description of each tree data node in the target point location.
4. The tree data node processing system as claimed in claim 3, wherein the description of each tree data node is configured visually on a data page, configured with leaf points in the data page, and configured with tree path names, leaf point names, data types, presentation styles, options and data units of the leaf points.
5. The tree data node processing system of claim 2 wherein the mapping includes at least one of replication, movement, and assignment;
the replication comprises the following steps: reserving the lower content of the original tree-shaped data node, and copying the lower content of the original tree-shaped data node to the position of a target point;
the moving process comprises the following steps: completely moving the lower content of the original tree-shaped data node to the position of a target point, and deleting the lower content of the original tree-shaped data node;
the assignment comprises the following steps: under the target point, if the tree node exists, modifying the content of the tree node; and if the tree node does not exist, adding the tree node and setting the content of the tree node.
6. A tree data node processing system as claimed in claim 2 wherein the source point location and assignment provide each tree data node description in the source point location.
7. A tree-like data node processing method implemented using the tree-like data node processing system according to any one of claims 1 to 6, the method comprising:
a user configures the tree-shaped data nodes through a configurable page of the visual platform;
the tree data node mobile engine analyzes the configured tree data nodes and converts the tree data nodes into computer primitives;
and the processing module performs corresponding processing according to the converted computer primitive.
8. The tree data node processing method as claimed in claim 7, wherein the analyzing and transforming the configured tree data node into the computer primitive comprises the processes of: and the visualization platform predefines all computer primitives with one-to-one configuration, and after the tree data node configuration is completed, the visualization platform is converted into the corresponding computer primitives according to the completed configuration.
9. An electronic device, characterized in that the electronic device comprises a memory for storing a computer program and a processor for executing the computer program to make a computer device execute the tree-like data node processing method according to any one of claims 7-8.
10. A readable storage medium having stored therein computer program instructions which, when read and executed by a processor, perform the tree data node processing method of any one of claims 7-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011151664.XA CN112365944A (en) | 2020-10-23 | 2020-10-23 | Tree-shaped data node processing system, method, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011151664.XA CN112365944A (en) | 2020-10-23 | 2020-10-23 | Tree-shaped data node processing system, method, electronic equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112365944A true CN112365944A (en) | 2021-02-12 |
Family
ID=74512068
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011151664.XA Pending CN112365944A (en) | 2020-10-23 | 2020-10-23 | Tree-shaped data node processing system, method, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112365944A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116932149A (en) * | 2023-09-18 | 2023-10-24 | 北京中电华大电子设计有限责任公司 | Data processing method and device |
| CN116955209A (en) * | 2023-09-18 | 2023-10-27 | 北京中电华大电子设计有限责任公司 | WebAsssembly virtual machine testing method and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103197929A (en) * | 2013-03-25 | 2013-07-10 | 中国科学院软件研究所 | System and method for graphical programming facing children |
| CN110489415A (en) * | 2019-07-23 | 2019-11-22 | 平安科技（深圳）有限公司 | A kind of data-updating method and relevant device |
| CN111352628A (en) * | 2020-02-28 | 2020-06-30 | 深圳壹账通智能科技有限公司 | Front-end code generation method and device, computer system and readable storage medium |
| CN111400278A (en) * | 2020-03-10 | 2020-07-10 | 联通沃音乐文化有限公司 | Method and system for constructing multi-level target crowd based on label dragging |
-
2020
- 2020-10-23 CN CN202011151664.XA patent/CN112365944A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103197929A (en) * | 2013-03-25 | 2013-07-10 | 中国科学院软件研究所 | System and method for graphical programming facing children |
| CN110489415A (en) * | 2019-07-23 | 2019-11-22 | 平安科技（深圳）有限公司 | A kind of data-updating method and relevant device |
| CN111352628A (en) * | 2020-02-28 | 2020-06-30 | 深圳壹账通智能科技有限公司 | Front-end code generation method and device, computer system and readable storage medium |
| CN111400278A (en) * | 2020-03-10 | 2020-07-10 | 联通沃音乐文化有限公司 | Method and system for constructing multi-level target crowd based on label dragging |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116932149A (en) * | 2023-09-18 | 2023-10-24 | 北京中电华大电子设计有限责任公司 | Data processing method and device |
| CN116955209A (en) * | 2023-09-18 | 2023-10-27 | 北京中电华大电子设计有限责任公司 | WebAsssembly virtual machine testing method and device |
| CN116955209B (en) * | 2023-09-18 | 2024-02-06 | 北京中电华大电子设计有限责任公司 | WebAsssembly virtual machine testing method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111079387B (en) | Automatic questionnaire generation method and device, computer equipment and storage medium | |
| CN108335313A (en) | Image partition method and device | |
| US20090265611A1 (en) | Web page layout optimization using section importance | |
| CN112035667A (en) | Knowledge graph display method and device and terminal equipment | |
| JP6640395B1 (en) | Information processing system and information processing method | |
| US10101727B2 (en) | Common parameter interface generation program and parameter reading program | |
| CN112365944A (en) | Tree-shaped data node processing system, method, electronic equipment and storage medium | |
| CN104731588B (en) | Page layout document generating method and page layout file creating apparatus | |
| CN111652266A (en) | User interface component identification method and device, electronic equipment and storage medium | |
| US20170132484A1 (en) | Two Step Mathematical Expression Search | |
| CN113535165A (en) | Interface generation method and device, electronic equipment and computer readable storage medium | |
| CN106294128B (en) | A kind of automated testing method and device exporting report data | |
| CN113869371A (en) | Model training method, clothing fine-grained segmentation method and related device | |
| KR101761177B1 (en) | Method for mining important pattern of high rank k, apparatus performing the same and storage medium storing the same | |
| US9626469B2 (en) | Information processing apparatus, method of outputting circuit image, and storage medium storing circuit image output program | |
| CN116483344A (en) | Code generation method and device, terminal equipment and computer readable storage medium | |
| JP2020123321A (en) | Method and apparatus for search processing based on clipboard data | |
| KR20180076594A (en) | Method for management drawings using attributes of drawing object and drawing management system | |
| CN110609927A (en) | Visual family tree layout method, terminal device and storage medium | |
| CN108255486B (en) | View conversion method and device for form design and electronic equipment | |
| CN113642295B (en) | Page typesetting method, device and computer program product | |
| JP4518388B2 (en) | Web page browsing device | |
| CN113987242A (en) | File picture visualization method, device, equipment and medium | |
| WO2021072776A1 (en) | Data merging method and apparatus, electronic device, and storage medium | |
| JP5188290B2 (en) | Annotation apparatus, annotation method and program |
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 |