CN112650899B - Data visualization rendering method and device, computer equipment and storage medium - Google Patents
Data visualization rendering method and device, computer equipment and storage medium Download PDFInfo
- Publication number
- CN112650899B CN112650899B CN202011614903.0A CN202011614903A CN112650899B CN 112650899 B CN112650899 B CN 112650899B CN 202011614903 A CN202011614903 A CN 202011614903A CN 112650899 B CN112650899 B CN 112650899B
- Authority
- CN
- China
- Prior art keywords
- node
- rendering
- tree
- target
- nodes
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/904—Browsing; Visualisation therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
- G06F16/9027—Trees
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- User Interface Of Digital Computer (AREA)
Abstract
The invention relates to the technical field of artificial intelligence, and provides a data visualization rendering method, a device, computer equipment and a storage medium, wherein the method comprises the following steps: responding to a data rendering request, and acquiring a tree structure of data; determining a root node of the tree structure, and calculating a first position of the root node according to a first parameter of the browser; traversing the tree structure downwards from the root node to the leaf node of the last level, and calculating a second position of the leaf node of the last level according to a second parameter of the browser; traversing the tree structure upwards from the leaf node of the last level in the tree structure, and calculating a third position of the leaf node of each level in the rendering tree to be generated according to the first position and the second position; and rendering the rendering tree to be generated according to the position of each node, wherein the parent-child nodes in the rendering tree are positioned at the same level, and the brother nodes are in upper and lower levels. The rendering tree generated by the invention can be fully displayed in the window of the browser.
Description
Technical Field
The invention relates to the technical field of artificial intelligence, in particular to a data visualization rendering method, a device, computer equipment and a storage medium.
Background
Visual presentation of the data can make the data presentation clearer and easier to understand. The visual presentation may be, for example, in the form of representing data as a graphic; while the process of representing data as graphics may be referred to as visual rendering. One type of data is hierarchical data, in which each node and the relationship between nodes may be included, and the hierarchical data may be visually rendered into a tree-like graph to clearly show the connection relationship between the nodes.
The inventor finds that when the tree-shaped graph is rendered, the father node diverges up and down or continuously diverges left and right, when the structure of the tree-shaped graph is complex, more information is difficult to display in one window, and the tree-shaped graph is very unfriendly to display.
Disclosure of Invention
In view of the foregoing, it is desirable to provide a data visualization rendering method, apparatus, computer device, and storage medium, in which the generated rendering tree can be fully displayed in the window of the browser.
A first aspect of the present invention provides a data visualization rendering method, the method comprising:
responding to a data rendering request, and acquiring a tree structure of data in the data rendering request;
determining a root node of the tree structure, and calculating a first position of the root node in a rendering tree to be generated according to a first parameter of a browser;
traversing the tree structure downwards from the root node to the leaf node of the last level, and calculating a second position of the leaf node of the last level in the rendering tree to be generated according to a second parameter of the browser;
traversing the tree structure upwards from the leaf node of the last level in the tree structure, and calculating a third position of the leaf node of each level in the rendering tree to be generated according to the first position and the second position;
and rendering the rendering tree to be generated according to the position of each node, wherein father and child nodes in the rendering tree are positioned at the same level, and brother nodes are in upper and lower levels.
In an alternative embodiment, the method further comprises:
responding to a folding instruction of a first target node, and calculating the node height and value of a leaf node of the first target node;
Determining a first node height of a lower sibling node of the first target node;
calculating a first movement height of the subordinate sibling node according to the node height and the value and the first node height;
and folding all child nodes of the first target node, and moving all child nodes of the lower-level brother node and the lower-level brother node upwards by the first movement height.
In an alternative embodiment, the method further comprises:
determining an upper-level sibling node of a second target node in response to a folding instruction of the second target node;
judging whether the upper brother node has a leaf node or not;
when the upper-level brother node has a leaf node, determining the second node height of the second-level leaf node in the leaf nodes of the upper-level brother node;
calculating a second movement height of the second target node according to the second node height and the node height of the second target node;
and folding all child nodes of the second target node, and moving the second target node upwards by the second movement height.
In an alternative embodiment, the method further comprises:
when the upper-level brother node does not have a leaf node, calculating a third moving height of the second target node according to the node height of the upper-level brother node and the node height of the second target node;
And folding all child nodes of the second target node, and moving the second target node upwards by the third movement height.
In an alternative embodiment, the method further comprises:
responding to a mixed rendering request of a designated node, and identifying the node type of the designated node in the mixed rendering request;
when the node type is a closed node, determining a plurality of designated father nodes and designated child nodes in the designated nodes according to the mixed rendering request, and drawing directed line segments pointing to the designated child nodes from each designated father node;
when the node type is adjacent, determining two specified brothers in the specified nodes according to the mixed rendering request, and drawing an undirected line segment between the two specified brothers;
and when the node type is a virtual node, the designated node is not displayed.
In an alternative embodiment, the method further comprises:
responding to a drag instruction of a display node in a rendering interface, and displaying the rendering display node in the rendering tree according to the drag instruction;
acquiring a rendering description of the rendering display node;
determining a rendering parent node of the display node according to the rendering description;
A render line segment is generated between the render parent node and the render display node.
In an alternative embodiment, the method further comprises:
determining whether a target rendering node in the rendering tree is a leaf node of a last level or not in response to a deletion instruction of the target rendering node;
deleting the target rendering node when the target rendering node is a leaf node of the last level;
and deleting the target rendering node and all child rendering nodes of the target rendering node when the target rendering node is not a leaf node of the last level.
A second aspect of the present invention provides a data visualization rendering apparatus, the apparatus comprising:
the request response module is used for responding to the data rendering request and acquiring a tree structure of data in the data rendering request;
the first calculation module is used for determining a root node of the tree structure and calculating a first position of the root node in a rendering tree to be generated according to a first parameter of a browser;
a second calculation module, configured to traverse the tree structure from the root node down to a leaf node of a last level, and calculate a second position of the leaf node of the last level in the rendering tree to be generated according to a second parameter of the browser;
A third calculation module, configured to traverse the tree structure upwards from a leaf node of a last level in the tree structure, and calculate a third position of the leaf node of each level in the rendering tree to be generated according to the first position and the second position;
and the node rendering module is used for rendering the rendering tree to be generated according to the position of each node, wherein father and child nodes in the rendering tree are positioned at the same level, and brother nodes are in upper and lower levels.
A third aspect of the invention provides a computer device comprising a processor for implementing the data visualization rendering method when executing a computer program stored in a memory.
A fourth aspect of the present invention provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the data visualization rendering method.
In summary, the data visualization rendering method, the device, the computer equipment and the storage medium disclosed by the invention not only can render the data of the tree structure according to the first parameter and the second parameter of the browser to generate the rendering tree, so that the generated rendering tree can be completely displayed in the window of the browser, and the user can acquire more information in a limited visual range; and the rendering tree is always horizontally and downwards diverged by the root node, so that the relation trend and the hierarchical relation of the whole tree can be more intuitively seen, and the user experience is improved.
Drawings
Fig. 1 is a flowchart of a data visualization rendering method according to an embodiment of the present invention.
FIG. 2 is a schematic diagram of a generated rendering tree provided by an embodiment of the present invention.
Fig. 3 is a block diagram of a data visualization rendering device according to a second embodiment of the present invention.
Fig. 4 is a schematic structural diagram of a computer device according to a third embodiment of the present invention.
Detailed Description
In order that the above-recited objects, features and advantages of the present invention will be more clearly understood, a more particular description of the invention will be rendered by reference to specific embodiments thereof which are illustrated in the appended drawings. It should be noted that, without conflict, the embodiments of the present invention and features in the embodiments may be combined with each other.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. The terminology used herein in the description of the invention is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention.
The data visualization rendering method provided by the embodiment of the invention is executed by the computer equipment, and correspondingly, the data visualization rendering device is operated in the computer equipment.
Fig. 1 is a flowchart of a data visualization rendering method according to an embodiment of the present invention. The data visualization rendering method specifically comprises the following steps, the sequence of the steps in the flow chart can be changed according to different requirements, and some steps can be omitted.
S11, responding to a data rendering request, and acquiring a tree structure of data in the data rendering request.
The user can upload the data of the tree structure to the rendering platform to trigger a data rendering request, and the data of the tree structure is requested to be rendered into a rendering tree which accords with the display requirement of the browser, so that all the data can be completely displayed in one window of the browser.
And the rendering platform receives the data of the tree structure uploaded by the user, namely receives a data rendering request, and responds to the data rendering request to acquire the tree structure of the data from the data rendering request.
The tree structure includes a plurality of nodes, and each node stores a data, which may be a course knowledge point, or may be data related to a user, such as basic data (gender, age), work experience, etc.
S12, determining a root node of the tree structure, and calculating a first position of the root node in a rendering tree to be generated according to a first parameter of a browser.
The rendering platform traverses the tree structure layer by layer downwards from the root node of the tree structure, each traverse is one layer, the layer level of the tree structure is recorded to be increased by 1, each traverse is performed to one leaf node, and the number of the leaf nodes is recorded to be increased by 1.
Obtaining a final record of the hierarchy of the tree structure to obtain the maximum hierarchy of the tree structure; and obtaining the final record of the leaf nodes of the tree structure, and obtaining the node quantity of all the leaf nodes.
And calculating a first position of the root node in the rendering tree to be generated according to the first parameter of the browser.
The first parameter of the browser may refer to a height of an interface that can be displayed by the browser.
After determining the first parameter of the browser, a first location of the root node in the rendering tree to be generated may be determined, which may be (0, first parameter).
S13, traversing the tree structure downwards from the root node until the leaf node of the last level, and calculating a second position of the leaf node of the last level in the rendering tree to be generated according to a second parameter of the browser.
Where a leaf node refers to a node without child nodes.
The second parameter of the browser may refer to a width of an interface that the browser can display.
The leaf nodes of the tree structure may be located at multiple levels, and the rendering platform traverses the tree structure from the root node layer by layer down until the leaf node of the last level of the tree structure, and determines the number of leaf nodes of the last level.
When the number of the leaf nodes of the last hierarchy is 1, a second position of the unique leaf node of the last hierarchy is calculated according to the second parameter of the browser, wherein the second position is (second parameter, 0).
When the number of the leaf nodes of the last level is not 1, determining the rightmost leaf node in the plurality of leaf nodes of the last level in the tree structure, and then calculating a second position of the rightmost leaf node of the last level according to a second parameter of the browser, wherein the second position is (a second parameter, 0). And traversing other leaf nodes of the last level of the tree structure from right to left, and determining the second positions of the other leaf nodes of the last level according to the second positions of the rightmost leaf nodes of the last level. For example, assuming that the last level of the tree structure has two leaf nodes, and the second position of the rightmost leaf node of the last level is (the second parameter, 0), the second position of the other leaf node of the last level may be (the second parameter, h 1), where h1 is a preset height interval between the leaf nodes of the upper and lower levels.
In an alternative embodiment, h1 may also be determined based on the first parameter of the browser and the maximum level of the tree structure. For example, a ratio between the first parameter of the browser and the maximum hierarchy is determined to be h1.
In an alternative embodiment, the width interval between two nodes between the same hierarchy may also be determined according to the second parameter of the browser and the number of all leaf nodes. For example, the ratio between the second parameter of the browser and the number of all leaf nodes is determined to be the width spacing between two nodes between the same hierarchy.
The same node height difference can be set between the leaf nodes under the same father node, and different node height differences can be set for the leaf nodes under the same father node. The same node height difference can be set between the leaf nodes under different father nodes, or different node height differences can be set between the leaf nodes under different father nodes.
S14, traversing the tree structure upwards from the leaf node of the last level in the tree structure, and calculating a third position of the leaf node of each level in the rendering tree to be generated according to the first position and the second position.
After determining the position of the leaf node of the last level, traversing the tree structure layer by layer upwards from the leaf node of the last level in the tree structure, calculating the position of the leaf node of the next to last level, then calculating the position of the leaf node of the third to last level, and so on until the position of the leaf node of the second level is calculated.
The rightmost leaf node of the plurality of leaf nodes under the same parent node in the tree structure is determined as the lowest-level leaf node under the parent node in the rendering tree to be generated. The positions of leaf nodes of the previous level are dynamically calculated based on the positions of leaf nodes of all next levels belonging to the same parent node as the previous level and the height of child nodes of the node for each next level.
And S15, rendering the rendering tree to be generated according to the position of each node, wherein father and child nodes in the rendering tree are located at the same level, and brother nodes are located at upper and lower levels.
After determining the position of each node in the rendering tree to be generated, determining the relative relationship (brother relationship, father-son relationship) of each node in the tree structure, and drawing line segments between the nodes according to the relative relationship, thereby completing the rendering process of the rendering tree to be generated.
As shown in fig. 2, a schematic diagram of the generated rendering tree. In fig. 2, node 1 is a root node, node 2 and node 3 are child nodes of the root node 1, but node 2 and node 1 are located at the same level, node 2 and node 3 are siblings, but node 2 and node 3 are at upper and lower levels.
First, a first location of the node 1 is calculated according to a first parameter of the browser, for example, the first location (0, first parameter) of the node 1; next, a second location of the node 11 is calculated from the second parameter of the browser, e.g. the second location of the node 11 (second parameter, 0); since node 9 is the parent node of node 11 and node 6 is the parent node of node 9, then node 6, node 9, node 11 are located at the same level, the third position of computing node 9 is (second parameter—node width spacing, 0), and the third position of computing node 6 is (second parameter—node width spacing, 0) times; since node 5 and node 6 belong to sibling nodes, node 5 and node 6 are in an upper and lower hierarchy, and the third position of node 5 is calculated as (node width spacing, node height spacing of-2 times the second parameter).
Therefore, unlike the traditional binary tree structure, the method can render the data of the tree structure according to the first parameter and the second parameter of the browser to generate the rendering tree, so that the generated rendering tree can be completely displayed in the window of the browser, and a user can acquire more information in a limited visual range; and the rendering tree is always horizontally and downwards diverged by the root node, so that the relation trend and the hierarchical relation of the whole tree can be more intuitively seen, and the user experience is improved.
In an alternative embodiment, the method further comprises:
responding to a folding instruction of a first target node, and calculating the node height and value of a leaf node of the first target node;
determining a first node height of a lower sibling node of the first target node;
calculating a first movement height of the subordinate sibling node according to the node height and the value and the first node height;
and folding all child nodes of the first target node, and moving all child nodes of the lower-level brother node and the lower-level brother node upwards by the first movement height.
When a node has a leaf node, a folding button is displayed on the node, and the folding button can be a virtual icon. All child nodes of the node can be folded by touching the folding button on the node, and all child nodes of the node can be unfolded by touching the folding button on the node again.
And obtaining node heights and values through the node heights of all leaf nodes of the first target node. The lower sibling node refers to a node located below the first target node.
Illustratively, touching the collapse button on node 3 can collapse all child nodes of node 3 (node 5, node 6, node 8, node 9, and node 10), i.e., node 5, node 6, node 8, node 9, and node 10 are no longer displayed in the rendered tree. And the leaf nodes of the node 3 are the node 5 and the node 6, the node height sum value is obtained by calculating the node height difference between the node 5 and the node 6, and then the brother node of the next level of the node 3 is moved upwards by the node height sum value.
In this optional embodiment, after the first target node is folded, more space is left, so that all the lower sibling nodes under the first target node and all the child nodes of each lower sibling node can be moved upwards, so that the layout of the whole rendering tree in the display interface of the rendering platform is more reasonable.
In an alternative embodiment, the method further comprises:
determining an upper-level sibling node of a second target node in response to a folding instruction of the second target node;
judging whether the upper brother node has a leaf node or not;
when the upper-level brother node has a leaf node, determining the second node height of the second-level leaf node in the leaf nodes of the upper-level brother node;
calculating a second movement height of the second target node according to the second node height and the node height of the second target node;
and folding all child nodes of the second target node, and moving the second target node upwards by the second movement height.
And obtaining the second moving height of the second target node by calculating a node height difference value of the second node height and the node height of the second target node.
In this alternative embodiment, the second target node is folded, and since all leaf nodes of the second target node are hidden, the second target node may be moved upward such that the second target node is located at a level below the upper sibling node.
In an alternative embodiment, the method further comprises:
when the upper-level brother node does not have a leaf node, calculating a third moving height of the second target node according to the node height of the upper-level brother node and the node height of the second target node;
and folding all child nodes of the second target node, and moving the second target node upwards by the third movement height.
In this alternative embodiment, the third movement height of the second target node is calculated according to the node heights of the upper sibling node and the node height of the second target node, so as to implement accurate movement of the second target node.
In an alternative embodiment, the method further comprises:
responding to a mixed rendering request of a designated node, and identifying the node type of the designated node in the mixed rendering request;
when the node type is a closed node, determining a plurality of designated father nodes and designated child nodes in the designated nodes according to the mixed rendering request, and drawing directed line segments pointing to the designated child nodes from each designated father node;
When the node type is adjacent, determining two specified brothers in the specified nodes according to the mixed rendering request, and drawing an undirected line segment between the two specified brothers;
and when the node type is a virtual node, the designated node is not displayed.
Corresponding node types may be added for each node to distinguish relatives between nodes, and the node types may include: closed nodes, adjacent nodes, common nodes and virtual nodes. And combining corresponding node relations according to different node types, drawing line segments between connecting nodes according to the node relations, and when the configuration nodes are virtual nodes, displaying the rendered virtual nodes.
In the alternative embodiment, by setting the node type for the node, when the node type is a closed node, the effect that a plurality of father nodes aggregate to the same child node can be achieved, when the node type is an adjacent node, the effect that two brothers nodes are connected can be achieved, when the node type is a virtual node, the effect that a plurality of root nodes exist in the same rendering tree is achieved indirectly by hiding the virtual node, and the technical defect that a traditional binary tree structure is solved, only one root node exists in one binary tree, only one father node exists in each child node, and the brothers nodes cannot be connected is overcome.
In an alternative embodiment, the method further comprises:
responding to a drag instruction of a display node in a rendering interface, and displaying the rendering display node in the rendering tree according to the drag instruction;
acquiring a rendering description of the rendering display node;
determining a rendering parent node of the display node according to the rendering description;
a render line segment is generated between the render parent node and the render display node.
The rendering interface may include two portions, a first portion for displaying a rendering tree, and a second portion for displaying a plurality of display nodes and displaying a rendering description frame, where each display node may be distinguished by a different shape or color, for example, a first color when the display node is a root node, a second color when the display node is a parent node, and a third color when the display node is a leaf node of the first hierarchy.
The user can drag a certain display node of the second part into the first part in a dragging mode, so that the effect of adding the rendering node in the rendering tree is achieved.
The user may input a rendering description of the display node to be dragged in a rendering description box before dragging the display node, which may include a rendering parent node, a rendering color, a rendering name, and the like.
In the alternative embodiment, after the display node is dragged and the rendering parent node is determined according to the rendering description, the rendering tree can be rendered again to generate a new rendering tree, the updating efficiency of the rendering tree is higher, and the implementation is simple.
In an alternative embodiment, the method further comprises:
determining whether a target rendering node in the rendering tree is a leaf node of a last level or not in response to a deletion instruction of the target rendering node;
deleting the target rendering node when the target rendering node is a leaf node of the last level;
and deleting the target rendering node and all child rendering nodes of the target rendering node when the target rendering node is not a leaf node of the last level.
The deleting instruction can be triggered by the touch time exceeding a preset time threshold.
And if the target rendering node is not the leaf node of the last level, a prompt box can be displayed for prompting whether the target rendering node and all child rendering nodes of the target rendering node are to be deleted. And deleting the target rendering node and all child rendering nodes of the target rendering node when a determining instruction of a user is received.
It is emphasized that to further guarantee the privacy and security of the above-mentioned rendering tree, the above-mentioned rendering tree may be stored in a node of the blockchain.
Fig. 3 is a block diagram of a data visualization rendering device according to a second embodiment of the present invention.
In some embodiments, the data visualization rendering device 20 may include a plurality of functional modules composed of computer program segments. The computer program of the individual program segments in the data visualization rendering device 20 may be stored in a memory of a computer apparatus and executed by at least one processor to perform (see fig. 1 for details) the functions of the data visualization rendering.
In this embodiment, the data visualization rendering apparatus 20 may be divided into a plurality of functional modules according to the functions performed by the data visualization rendering apparatus. The functional module may include: a request response module 201, a first calculation module 202, a second calculation module 203, a third calculation module 204, a node rendering module 205, a first folding module 206, a second folding module 207, a hybrid rendering module 208, a node dragging module 209, and a node deleting module 210. The module referred to in the present invention refers to a series of computer program segments capable of being executed by at least one processor and of performing a fixed function, stored in a memory. In the present embodiment, the functions of the respective modules will be described in detail in the following embodiments.
The request response module 201 is configured to respond to a data rendering request, and obtain a tree structure of data in the data rendering request.
The user can upload the data of the tree structure to the rendering platform to trigger a data rendering request, and the data of the tree structure is requested to be rendered into a rendering tree which accords with the display requirement of the browser, so that all the data can be completely displayed in one window of the browser.
And the rendering platform receives the data of the tree structure uploaded by the user, namely receives a data rendering request, and responds to the data rendering request to acquire the tree structure of the data from the data rendering request.
The tree structure includes a plurality of nodes, and each node stores a data, which may be a course knowledge point, or may be data related to a user, such as basic data (gender, age), work experience, etc.
The first calculation module 202 is configured to determine a root node of the tree structure, and calculate a first position of the root node in a rendering tree to be generated according to a first parameter of a browser.
The rendering platform traverses the tree structure layer by layer downwards from the root node of the tree structure, each traverse is one layer, the layer level of the tree structure is recorded to be increased by 1, each traverse is performed to one leaf node, and the number of the leaf nodes is recorded to be increased by 1.
Obtaining a final record of the hierarchy of the tree structure to obtain the maximum hierarchy of the tree structure; and obtaining the final record of the leaf nodes of the tree structure, and obtaining the node quantity of all the leaf nodes.
And calculating a first position of the root node in the rendering tree to be generated according to the first parameter of the browser.
The first parameter of the browser may refer to a height of an interface that can be displayed by the browser.
After determining the first parameter of the browser, a first location of the root node in the rendering tree to be generated may be determined, which may be (0, first parameter).
The second calculating module 203 is configured to traverse the tree structure from the root node down to a leaf node of a last level, and calculate a second position of the leaf node of the last level in the rendering tree to be generated according to a second parameter of the browser.
Where a leaf node refers to a node without child nodes.
The second parameter of the browser may refer to a width of an interface that the browser can display.
The leaf nodes of the tree structure may be located at multiple levels, and the rendering platform traverses the tree structure from the root node layer by layer down until the leaf node of the last level of the tree structure, and determines the number of leaf nodes of the last level.
When the number of the leaf nodes of the last hierarchy is 1, a second position of the unique leaf node of the last hierarchy is calculated according to the second parameter of the browser, wherein the second position is (second parameter, 0).
When the number of the leaf nodes of the last level is not 1, determining the rightmost leaf node in the plurality of leaf nodes of the last level in the tree structure, and then calculating a second position of the rightmost leaf node of the last level according to a second parameter of the browser, wherein the second position is (a second parameter, 0). And traversing other leaf nodes of the last level of the tree structure from right to left, and determining the second positions of the other leaf nodes of the last level according to the second positions of the rightmost leaf nodes of the last level. For example, assuming that the last level of the tree structure has two leaf nodes, and the second position of the rightmost leaf node of the last level is (the second parameter, 0), the second position of the other leaf node of the last level may be (the second parameter, h 1), where h1 is a preset height interval between the leaf nodes of the upper and lower levels.
In an alternative embodiment, h1 may also be determined based on the first parameter of the browser and the maximum level of the tree structure. For example, a ratio between the first parameter of the browser and the maximum hierarchy is determined to be h1.
In an alternative embodiment, the width interval between two nodes between the same hierarchy may also be determined according to the second parameter of the browser and the number of all leaf nodes. For example, the ratio between the second parameter of the browser and the number of all leaf nodes is determined to be the width spacing between two nodes between the same hierarchy.
The same node height difference can be set between the leaf nodes under the same father node, and different node height differences can be set for the leaf nodes under the same father node. The same node height difference can be set between the leaf nodes under different father nodes, or different node height differences can be set between the leaf nodes under different father nodes.
The third calculation module 204 is configured to calculate, from the first position and the second position, a third position of the leaf node of each level in the rendering tree to be generated, where the third position is traversed upwards from the leaf node of the last level in the tree structure.
After determining the position of the leaf node of the last level, traversing the tree structure layer by layer upwards from the leaf node of the last level in the tree structure, calculating the position of the leaf node of the next to last level, then calculating the position of the leaf node of the third to last level, and so on until the position of the leaf node of the second level is calculated.
The rightmost leaf node of the plurality of leaf nodes under the same parent node in the tree structure is determined as the lowest-level leaf node under the parent node in the rendering tree to be generated. The positions of leaf nodes of the previous level are dynamically calculated based on the positions of leaf nodes of all next levels belonging to the same parent node as the previous level and the height of child nodes of the node for each next level.
The node rendering module 205 is configured to render the rendering tree to be generated according to the position of each node, where parent-child nodes in the rendering tree are located at the same level, and sibling nodes are located at upper and lower levels.
After determining the position of each node in the rendering tree to be generated, determining the relative relationship (brother relationship, father-son relationship) of each node in the tree structure, and drawing line segments between the nodes according to the relative relationship, thereby completing the rendering process of the rendering tree to be generated.
As shown in fig. 2, a schematic diagram of the generated rendering tree. In fig. 2, node 1 is a root node, node 2 and node 3 are child nodes of the root node 1, but node 2 and node 1 are located at the same level, node 2 and node 3 are siblings, but node 2 and node 3 are at upper and lower levels.
First, a first location of the node 1 is calculated according to a first parameter of the browser, for example, the first location (0, first parameter) of the node 1; next, a second location of the node 11 is calculated from the second parameter of the browser, e.g. the second location of the node 11 (second parameter, 0); since node 9 is the parent node of node 11 and node 6 is the parent node of node 9, then node 6, node 9, node 11 are located at the same level, the third position of computing node 9 is (second parameter—node width spacing, 0), and the third position of computing node 6 is (second parameter—node width spacing, 0) times; since node 5 and node 6 belong to sibling nodes, node 5 and node 6 are in an upper and lower hierarchy, and the third position of node 5 is calculated as (node width spacing, node height spacing of-2 times the second parameter).
Therefore, unlike the traditional binary tree structure, the rendering tree generated by the device can render the data of the tree structure according to the first parameter and the second parameter of the browser to generate the rendering tree, so that the generated rendering tree can be completely displayed in the window of the browser, and a user can acquire more information in a limited visual range; and the rendering tree is always horizontally and downwards diverged by the root node, so that the relation trend and the hierarchical relation of the whole tree can be more intuitively seen, and the user experience is improved.
The first folding module 206 is configured to calculate a node height and a value of a leaf node of the first target node in response to a folding instruction of the first target node; determining a first node height of a lower sibling node of the first target node; calculating a first movement height of the subordinate sibling node according to the node height and the value and the first node height; and folding all child nodes of the first target node, and moving all child nodes of the lower-level brother node and the lower-level brother node upwards by the first movement height.
When a node has a leaf node, a folding button is displayed on the node, and the folding button can be a virtual icon. All child nodes of the node can be folded by touching the folding button on the node, and all child nodes of the node can be unfolded by touching the folding button on the node again.
And obtaining node heights and values through the node heights of all leaf nodes of the first target node. The lower sibling node refers to a node located below the first target node.
Illustratively, touching the collapse button on node 3 can collapse all child nodes of node 3 (node 5, node 6, node 8, node 9, and node 10), i.e., node 5, node 6, node 8, node 9, and node 10 are no longer displayed in the rendered tree. And the leaf nodes of the node 3 are the node 5 and the node 6, the node height sum value is obtained by calculating the node height difference between the node 5 and the node 6, and then the brother node of the next level of the node 3 is moved upwards by the node height sum value.
In this optional embodiment, after the first target node is folded, more space is left, so that all the lower sibling nodes under the first target node and all the child nodes of each lower sibling node can be moved upwards, so that the layout of the whole rendering tree in the display interface of the rendering platform is more reasonable.
The second folding module 207 is configured to determine an upper sibling node of the second target node in response to a folding instruction of the second target node; judging whether the upper brother node has a leaf node or not; when the upper-level brother node has a leaf node, determining the second node height of the second-level leaf node in the leaf nodes of the upper-level brother node; calculating a second movement height of the second target node according to the second node height and the node height of the second target node; and folding all child nodes of the second target node, and moving the second target node upwards by the second movement height.
And obtaining the second moving height of the second target node by calculating a node height difference value of the second node height and the node height of the second target node.
In this alternative embodiment, the second target node is folded, and since all leaf nodes of the second target node are hidden, the second target node may be moved upward such that the second target node is located at a level below the upper sibling node.
In an alternative embodiment, the second folding module 207 is further configured to: when the upper-level brother node does not have a leaf node, calculating a third moving height of the second target node according to the node height of the upper-level brother node and the node height of the second target node; and folding all child nodes of the second target node, and moving the second target node upwards by the third movement height.
In this alternative embodiment, the third movement height of the second target node is calculated according to the node heights of the upper sibling node and the node height of the second target node, so as to implement accurate movement of the second target node.
The hybrid rendering module 208 is configured to respond to a hybrid rendering request of a specified node, and identify a node type of the specified node in the hybrid rendering request; when the node type is a closed node, determining a plurality of designated father nodes and designated child nodes in the designated nodes according to the mixed rendering request, and drawing directed line segments pointing to the designated child nodes from each designated father node; when the node type is adjacent, determining two specified brothers in the specified nodes according to the mixed rendering request, and drawing an undirected line segment between the two specified brothers; and when the node type is a virtual node, the designated node is not displayed.
Corresponding node types may be added for each node to distinguish relatives between nodes, and the node types may include: closed nodes, adjacent nodes, common nodes and virtual nodes. And combining corresponding node relations according to different node types, drawing line segments between connecting nodes according to the node relations, and when the configuration nodes are virtual nodes, displaying the rendered virtual nodes.
In the alternative embodiment, by setting the node type for the node, when the node type is a closed node, the effect that a plurality of father nodes aggregate to the same child node can be achieved, when the node type is an adjacent node, the effect that two brothers nodes are connected can be achieved, when the node type is a virtual node, the effect that a plurality of root nodes exist in the same rendering tree is achieved indirectly by hiding the virtual node, and the technical defect that a traditional binary tree structure is solved, only one root node exists in one binary tree, only one father node exists in each child node, and the brothers nodes cannot be connected is overcome.
The node drag module 209 is configured to respond to a drag instruction of a display node in a rendering interface, and display a rendering display node in the rendering tree according to the drag instruction; acquiring a rendering description of the rendering display node; determining a rendering parent node of the display node according to the rendering description; a render line segment is generated between the render parent node and the render display node.
The rendering interface may include two portions, a first portion for displaying a rendering tree, and a second portion for displaying a plurality of display nodes and displaying a rendering description frame, where each display node may be distinguished by a different shape or color, for example, a first color when the display node is a root node, a second color when the display node is a parent node, and a third color when the display node is a leaf node of the first hierarchy.
The user can drag a certain display node of the second part into the first part in a dragging mode, so that the effect of adding the rendering node in the rendering tree is achieved.
The user may input a rendering description of the display node to be dragged in a rendering description box before dragging the display node, which may include a rendering parent node, a rendering color, a rendering name, and the like.
In the alternative embodiment, after the display node is dragged and the rendering parent node is determined according to the rendering description, the rendering tree can be rendered again to generate a new rendering tree, the updating efficiency of the rendering tree is higher, and the implementation is simple.
The node deleting module 210 is configured to determine, in response to a deleting instruction of a target rendering node in the rendering tree, whether the target rendering node is a leaf node of a last level; deleting the target rendering node when the target rendering node is a leaf node of the last level; and deleting the target rendering node and all child rendering nodes of the target rendering node when the target rendering node is not a leaf node of the last level.
The deleting instruction can be triggered by the touch time exceeding a preset time threshold.
And if the target rendering node is not the leaf node of the last level, a prompt box can be displayed for prompting whether the target rendering node and all child rendering nodes of the target rendering node are to be deleted. And deleting the target rendering node and all child rendering nodes of the target rendering node when a determining instruction of a user is received.
It is emphasized that to further guarantee the privacy and security of the above-mentioned rendering tree, the above-mentioned rendering tree may be stored in a node of the blockchain.
Fig. 4 is a schematic structural diagram of a computer device according to a third embodiment of the present invention. In the preferred embodiment of the present invention, the computer device 3 includes a memory 31, at least one processor 32, at least one communication bus 33, and a transceiver 34.
It will be appreciated by those skilled in the art that the configuration of the computer device shown in fig. 3 is not limiting of the embodiments of the present invention, and that either a bus-type configuration or a star-type configuration is possible, and that the computer device 3 may include more or less other hardware or software than that shown, or a different arrangement of components.
In some embodiments, the computer device 3 is a device capable of automatically performing numerical calculation and/or information processing according to preset or stored instructions, and its hardware includes, but is not limited to, a microprocessor, an application specific integrated circuit, a programmable gate array, a digital processor, an embedded device, and the like. The computer device 3 may also include a client device, which includes, but is not limited to, any electronic product that can interact with a client by way of a keyboard, mouse, remote control, touch pad, or voice control device, such as a personal computer, tablet, smart phone, digital camera, etc.
It should be noted that the computer device 3 is only used as an example, and other electronic products that may be present in the present invention or may be present in the future are also included in the scope of the present invention by way of reference.
In some embodiments, the memory 31 has stored therein a computer program which, when executed by the at least one processor 32, performs all or part of the steps in the data visualization rendering method as described. The Memory 31 includes Read-Only Memory (ROM), programmable Read-Only Memory (PROM), erasable programmable Read-Only Memory (EPROM), one-time programmable Read-Only Memory (One-time Programmable Read-Only Memory, OTPROM), electrically erasable rewritable Read-Only Memory (EEPROM), compact disc Read-Only Memory (Compact Disc Read-Only Memory, CD-ROM) or other optical disc Memory, magnetic tape Memory, or any other medium that can be used for computer-readable carrying or storing data.
Further, the computer-readable storage medium may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function, and the like; the storage data area may store data created from the use of blockchain nodes, and the like.
The blockchain is a novel application mode of computer technologies such as distributed data storage, point-to-point transmission, consensus mechanism, encryption algorithm and the like. The Blockchain (Blockchain), which is essentially a decentralised database, is a string of data blocks that are generated by cryptographic means in association, each data block containing a batch of information of network transactions for verifying the validity of the information (anti-counterfeiting) and generating the next block. The blockchain may include a blockchain underlying platform, a platform product services layer, an application services layer, and the like.
In some embodiments, the at least one processor 32 is a Control Unit (Control Unit) of the computer device 3, connects the various components of the entire computer device 3 using various interfaces and lines, and performs various functions and processes of the computer device 3 by running or executing programs or modules stored in the memory 31, and invoking data stored in the memory 31. For example, the at least one processor 32, when executing the computer programs stored in the memory, implements all or part of the steps of the data visualization rendering method described in embodiments of the present invention; or to implement all or part of the functionality of the data visualization rendering device. The at least one processor 32 may be comprised of integrated circuits, such as a single packaged integrated circuit, or may be comprised of multiple integrated circuits packaged with the same or different functionality, including one or more central processing units (Central Processing unit, CPU), microprocessors, digital processing chips, graphics processors, combinations of various control chips, and the like.
In some embodiments, the at least one communication bus 33 is arranged to enable connected communication between the memory 31 and the at least one processor 32 or the like.
Although not shown, the computer device 3 may further comprise a power source (such as a battery) for powering the various components, preferably the power source is logically connected to the at least one processor 32 via a power management means, whereby the functions of managing charging, discharging, and power consumption are performed by the power management means. The power supply may also include one or more of any of a direct current or alternating current power supply, recharging device, power failure detection circuit, power converter or inverter, power status indicator, etc. The computer device 3 may further include various sensors, bluetooth modules, wi-Fi modules, etc., which will not be described in detail herein.
The integrated units implemented in the form of software functional modules described above may be stored in a computer readable storage medium. The software functional modules described above are stored in a storage medium and include instructions for causing a computer device (which may be a personal computer, a computer device, or a network device, etc.) or processor (processor) to perform portions of the methods described in the various embodiments of the invention.
In the several embodiments provided by the present invention, it should be understood that the disclosed apparatus and method may be implemented in other manners. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the modules is merely a logical function division, and there may be other manners of division when actually implemented.
The modules described as separate components may or may not be physically separate, and components shown as modules may or may not be physical units, may be located in one place, or may be distributed over multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional module in the embodiments of the present invention 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 can be realized in a form of hardware or a form of hardware and a form of software functional modules.
It will be evident to those skilled in the art that the invention is not limited to the details of the foregoing illustrative embodiments, and that the present invention may be embodied in other specific forms without departing from the spirit or essential characteristics thereof. The present embodiments are, therefore, to be considered in all respects as illustrative and not restrictive, the scope of the invention being indicated by the appended claims rather than by the foregoing description, and all changes which come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein. Any reference sign in a claim should not be construed as limiting the claim concerned. Furthermore, it will be obvious that the term "comprising" does not exclude other elements or that the singular does not exclude a plurality. The units or means stated in the invention may also be implemented by one unit or means in software or hardware. The terms first, second, etc. are used to denote a name, but not any particular order.
Finally, it should be noted that the above-mentioned embodiments are merely for illustrating the technical solution of the present invention and not for limiting the same, and although the present invention has been described in detail with reference to the preferred embodiments, it should be understood by those skilled in the art that modifications and equivalents may be made to the technical solution of the present invention without departing from the spirit and scope of the technical solution of the present invention.
Claims (10)
1. A method of data visualization rendering, the method comprising:
responding to a data rendering request, and acquiring a tree structure of data in the data rendering request;
determining a root node of the tree structure, and calculating a first position of the root node in a rendering tree to be generated according to a first parameter of a browser, wherein the first parameter refers to the height of an interface which can be displayed by the browser;
traversing the tree structure downwards from the root node to a leaf node of the last level, and calculating a second position of the leaf node of the last level in the rendering tree to be generated according to a second parameter of the browser, wherein the second parameter refers to the width of an interface which can be displayed by the browser;
traversing the tree structure upwards from the leaf node of the last level in the tree structure, and calculating a third position of the leaf node of each level in the rendering tree to be generated according to the first position and the second position;
And rendering the rendering tree to be generated according to the position of each node, wherein father and child nodes in the rendering tree are positioned at the same level, and brother nodes are in upper and lower levels.
2. The data visualization rendering method of claim 1, wherein the method further comprises:
responding to a folding instruction of a first target node, and calculating the node height and value of a leaf node of the first target node;
determining a first node height of a lower sibling node of the first target node;
calculating a first movement height of the subordinate sibling node according to the node height and the value and the first node height;
and folding all child nodes of the first target node, and moving all child nodes of the lower-level brother node and the lower-level brother node upwards by the first movement height.
3. The data visualization rendering method of claim 1, wherein the method further comprises:
determining an upper-level sibling node of a second target node in response to a folding instruction of the second target node;
judging whether the upper brother node has a leaf node or not;
when the upper-level brother node has a leaf node, determining the second node height of the second-level leaf node in the leaf nodes of the upper-level brother node;
Calculating a second movement height of the second target node according to the second node height and the node height of the second target node;
and folding all child nodes of the second target node, and moving the second target node upwards by the second movement height.
4. A data visualization rendering method as defined in claim 3, wherein the method further comprises:
when the upper-level brother node does not have a leaf node, calculating a third moving height of the second target node according to the node height of the upper-level brother node and the node height of the second target node;
and folding all child nodes of the second target node, and moving the second target node upwards by the third movement height.
5. The data visualization rendering method of claim 1, wherein the method further comprises:
responding to a mixed rendering request of a designated node, and identifying the node type of the designated node in the mixed rendering request;
when the node type is a closed node, determining a plurality of designated father nodes and designated child nodes in the designated nodes according to the mixed rendering request, and drawing directed line segments pointing to the designated child nodes from each designated father node;
When the node type is adjacent, determining two specified brothers in the specified nodes according to the mixed rendering request, and drawing an undirected line segment between the two specified brothers;
and when the node type is a virtual node, the designated node is not displayed.
6. The data visualization rendering method of any of claims 1 to 5, wherein the method further comprises:
responding to a drag instruction of a display node in a rendering interface, and displaying the rendering display node in the rendering tree according to the drag instruction;
acquiring a rendering description of the rendering display node;
determining a rendering parent node of the display node according to the rendering description;
a render line segment is generated between the render parent node and the render display node.
7. The data visualization rendering method of any of claims 1 to 5, wherein the method further comprises:
determining whether a target rendering node in the rendering tree is a leaf node of a last level or not in response to a deletion instruction of the target rendering node;
deleting the target rendering node when the target rendering node is a leaf node of the last level;
And deleting the target rendering node and all child rendering nodes of the target rendering node when the target rendering node is not a leaf node of the last level.
8. A data visualization rendering apparatus, the apparatus comprising:
the request response module is used for responding to the data rendering request and acquiring a tree structure of data in the data rendering request;
the first calculation module is used for determining a root node of the tree structure and calculating a first position of the root node in a rendering tree to be generated according to a first parameter of a browser, wherein the first parameter refers to the height of an interface which can be displayed by the browser;
the second calculation module is used for traversing the tree structure downwards from the root node to the leaf node of the last level, and calculating a second position of the leaf node of the last level in the rendering tree to be generated according to a second parameter of the browser, wherein the second parameter refers to the width of an interface which can be displayed by the browser;
a third calculation module, configured to traverse the tree structure upwards from a leaf node of a last level in the tree structure, and calculate a third position of the leaf node of each level in the rendering tree to be generated according to the first position and the second position;
And the node rendering module is used for rendering the rendering tree to be generated according to the position of each node, wherein father and child nodes in the rendering tree are positioned at the same level, and brother nodes are in upper and lower levels.
9. A computer device, characterized in that it comprises a processor for implementing the data visualization rendering method according to any one of claims 1 to 7 when executing a computer program stored in a memory.
10. A computer readable storage medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the data visualization rendering method according to any of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011614903.0A CN112650899B (en) | 2020-12-30 | 2020-12-30 | Data visualization rendering method and device, computer equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011614903.0A CN112650899B (en) | 2020-12-30 | 2020-12-30 | Data visualization rendering method and device, computer equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112650899A CN112650899A (en) | 2021-04-13 |
| CN112650899B true CN112650899B (en) | 2023-10-03 |
Family
ID=75364394
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011614903.0A Active CN112650899B (en) | 2020-12-30 | 2020-12-30 | Data visualization rendering method and device, computer equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112650899B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113326403A (en) * | 2021-06-16 | 2021-08-31 | 北京百度网讯科技有限公司 | Flowchart rendering method and device, electronic equipment and medium |
| CN113282795B (en) * | 2021-06-29 | 2024-05-14 | 中国平安人寿保险股份有限公司 | Data structure diagram generation and updating method and device, electronic equipment and storage medium |
| CN115686700A (en) * | 2021-07-30 | 2023-02-03 | 华为技术有限公司 | Rendering method and electronic equipment |
| CN117648153B (en) * | 2024-01-29 | 2024-04-26 | 太平金融科技服务（上海）有限公司 | Rendering display method and device, electronic equipment and storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102646115A (en) * | 2012-02-17 | 2012-08-22 | 北京星网锐捷网络技术有限公司 | Method and device for constructing AC (aho-corasick) state machine |
| US9396249B1 (en) * | 2013-06-19 | 2016-07-19 | Amazon Technologies, Inc. | Methods and systems for encoding parent-child map tile relationships |
| CN109903365A (en) * | 2017-12-08 | 2019-06-18 | 北大方正集团有限公司 | Rendering method and rendering system based on render tree |
| CN110213265A (en) * | 2019-05-29 | 2019-09-06 | 腾讯科技（深圳）有限公司 | Image acquiring method, device, server and storage medium |
| CN110689600A (en) * | 2019-09-16 | 2020-01-14 | 贝壳技术有限公司 | Rendering method and device of tree component, readable storage medium and electronic equipment |
| CN111104111A (en) * | 2019-11-29 | 2020-05-05 | 苏宁云计算有限公司 | Layout processing method and device for tree Canvas |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7383276B2 (en) * | 2004-01-30 | 2008-06-03 | Microsoft Corporation | Concurrency control for B-trees with node deletion |
| US20100067113A1 (en) * | 2008-09-18 | 2010-03-18 | Matthew John Harrison | Apparatus and Method for Displaying Hierarchical Data |
-
2020
- 2020-12-30 CN CN202011614903.0A patent/CN112650899B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102646115A (en) * | 2012-02-17 | 2012-08-22 | 北京星网锐捷网络技术有限公司 | Method and device for constructing AC (aho-corasick) state machine |
| US9396249B1 (en) * | 2013-06-19 | 2016-07-19 | Amazon Technologies, Inc. | Methods and systems for encoding parent-child map tile relationships |
| CN109903365A (en) * | 2017-12-08 | 2019-06-18 | 北大方正集团有限公司 | Rendering method and rendering system based on render tree |
| CN110213265A (en) * | 2019-05-29 | 2019-09-06 | 腾讯科技（深圳）有限公司 | Image acquiring method, device, server and storage medium |
| CN110689600A (en) * | 2019-09-16 | 2020-01-14 | 贝壳技术有限公司 | Rendering method and device of tree component, readable storage medium and electronic equipment |
| CN111104111A (en) * | 2019-11-29 | 2020-05-05 | 苏宁云计算有限公司 | Layout processing method and device for tree Canvas |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112650899A (en) | 2021-04-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112650899B (en) | Data visualization rendering method and device, computer equipment and storage medium | |
| US11501256B2 (en) | Digital processing systems and methods for data visualization extrapolation engine for item extraction and mapping in collaborative work systems | |
| TWI460648B (en) | Ranking visualization types based upon fitness for visualizing a data set | |
| US10108756B2 (en) | Method, computer program product and apparatus for providing a building options configurator | |
| CN112579226A (en) | User interface logical views and perform view navigation and translation | |
| US20180032486A1 (en) | Inheritance of rules across hierarchical levels | |
| US11270066B2 (en) | Temporary formatting and charting of selected data | |
| WO2021174946A1 (en) | Visualization method, system, computer device, and storage medium | |
| CN113282795B (en) | Data structure diagram generation and updating method and device, electronic equipment and storage medium | |
| US20110060704A1 (en) | Dependency graph in data-driven model | |
| US20080115104A1 (en) | Software development system and method for intelligent document output based on user-defined rules | |
| CN107608747A (en) | The construction method of form system, device, electronic equipment, storage medium | |
| CN108228861A (en) | For performing the method and system of the Feature Engineering of machine learning | |
| CN103473041B (en) | A kind of visual data processing method and system | |
| US20240028991A1 (en) | Flexible Work Breakdown Structure | |
| CN113326314B (en) | Data visualization method, device, electronic equipment and readable storage medium | |
| AU2017216247B2 (en) | Systems and methods for using entity/relationship model data to enhance user interface engine | |
| CN107257967A (en) | The analysis view engaged for PivotTables | |
| CN112579051B (en) | System for developing industrial applications and method for managing industrial development workspaces | |
| US8286087B1 (en) | Active route validation in workflow process authoring | |
| CN112486491A (en) | Page generation method and device, computer equipment and storage medium | |
| US10156957B2 (en) | Semi-modal interaction blocker | |
| JPWO2014061093A1 (en) | Screen creation device and screen creation method | |
| CN114995728A (en) | Rule configuration method and device, electronic equipment and storage medium | |
| CN106814938A (en) | Threedimensional model file imports control method and client |
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 |