CN109697238B - Data processing method and device - Google Patents
Data processing method and device Download PDFInfo
- Publication number
- CN109697238B CN109697238B CN201811599580.5A CN201811599580A CN109697238B CN 109697238 B CN109697238 B CN 109697238B CN 201811599580 A CN201811599580 A CN 201811599580A CN 109697238 B CN109697238 B CN 109697238B
- Authority
- CN
- China
- Prior art keywords
- node
- target
- nodes
- expansion
- 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.)
- Active
Links
Images
Abstract
The invention provides a data processing method and device, relates to the technical field of information, and aims to visually display data in a graph database to a user. The specific technical scheme is as follows: acquiring target data, wherein the target data comprises K nodes stored in a graph database, the K nodes comprise labels, and K is more than or equal to 1; dividing the K nodes into G groups according to the labels of the K nodes, wherein G is more than or equal to 1; and displaying nodes of the target group, wherein the target group is any one of the G groups. The present disclosure is for data processing.
Description
Technical Field
The present disclosure relates to the field of information technologies, and in particular, to a data processing method and apparatus.
Background
The data in the graph database is applied to storing the relationship information between the entities by the graph theory, and is widely applied due to high efficiency and small time delay of managing and inquiring complex relationships. However, data stored in graph databases, which require queries by technicians in structured query languages, are inconvenient for non-technicians to obtain and use due to technical barriers.
Disclosure of Invention
The embodiment of the disclosure provides a data processing method and device, which can intuitively display data in a graph database to a user. The technical scheme is as follows:
according to a first aspect of embodiments of the present disclosure, there is provided a data processing method, including:
acquiring target data, wherein the target data comprises K nodes stored in a graph database, the K nodes comprise labels, and K is more than or equal to 1;
dividing the K nodes into G groups according to the labels of the K nodes, wherein G is more than or equal to 1;
and displaying nodes of the target group, wherein the target group is any one of the G groups.
According to the technical scheme provided by the disclosure, the nodes in the graph database are divided into a plurality of groups, and any one of the groups is displayed. On one hand, the technical threshold for viewing the data in the graph database is reduced, so that common non-technical personnel can view the data. On the other hand, any group in a plurality of groups can be displayed by adopting the technical scheme, namely, a user can view partial nodes in the graph database according to the groups according to personal requirements, and the aims of targeted viewing and data screening are achieved. Especially when the number of nodes is large (namely, the value of K is large), the convenience brought to the user by the packet viewing is more obvious.
In one embodiment, the target data further includes edges corresponding to the K nodes, and the method further includes:
determining an expansion node corresponding to a target node according to the target data, wherein the target node is any node displayed at the current moment;
displaying the expansion node;
wherein the expansion node comprises any one of:
a node having an edge with the target node among the K nodes;
the node is in the same group with the target node, and an edge exists between the node and the target node;
a node in a different group from the target node and having an edge with the target node;
and the nodes which are two groups adjacent to the target node and have edges with the target node.
The expansion node may include some or all of the K nodes having edges with the target node, for example, the expansion node is screened according to a plurality of screening conditions, and the expansion node may be a node having edges with the target node and being in the same group, in a different group, or in an adjacent group. The nodes are divided through various screening conditions so as to meet the diversified requirements of users.
In one embodiment, further comprising:
displaying edges between nodes of the target packet;
and/or, displaying an edge between the target node and the expansion node;
and/or displaying edges between the expansion nodes.
For the displayed nodes, the edges between the nodes can be further displayed, or the edges between partial nodes in the nodes can be displayed, so as to meet the diversified requirements of users.
In one embodiment, before determining the expansion node corresponding to the target node according to the target data, the method further includes:
and receiving a node selection instruction, and selecting the target node from the displayed nodes according to the node selection instruction.
A user can trigger a node selection instruction through input equipment, and appoint a target node according to personal wishes so as to view an expansion node corresponding to the target node.
In one embodiment, before the node displaying the target packet, the method further includes:
and receiving a grouping selection instruction, and selecting the target grouping in the G groups according to the grouping selection instruction.
The user can trigger a group selection instruction through an input device, and a target group is designated according to personal intention so as to view nodes of the target group.
According to a second aspect of the embodiments of the present disclosure, there is provided a data processing apparatus including:
the data module is used for acquiring target data, wherein the target data comprises K nodes stored in a graph database, the K nodes comprise labels, and K is more than or equal to 1;
the configuration module is used for dividing the K nodes into G groups according to the labels of the K nodes, wherein G is more than or equal to 1;
and the screening module is used for displaying nodes of target groups, and the target groups are any one of the G groups.
In one embodiment, the target data further includes edges corresponding to the K nodes;
the screening module is used for determining an expanded node corresponding to a target node according to the target data, wherein the target node is any node displayed at the current moment; displaying the expansion node;
wherein the expansion node comprises any one of:
a node having an edge with the target node among the K nodes;
the node is in the same group with the target node, and an edge exists between the node and the target node;
a node in a different group from the target node and having an edge with the target node;
and the nodes which are two groups adjacent to the target node and have edges with the target node.
In one embodiment, the filtering module is configured to display edges between nodes of the target packet;
and/or, displaying an edge between the target node and the expansion node;
and/or displaying edges between the expansion nodes.
In one embodiment, further comprising:
and the instruction module is used for receiving a node selection instruction and selecting the target node from the displayed nodes according to the node selection instruction.
In one embodiment, further comprising:
and the instruction module is used for receiving a grouping selection instruction and selecting the target grouping in the G groups according to the grouping selection instruction.
According to a third aspect of the embodiments of the present disclosure, there is provided an electronic apparatus including:
a processor;
a memory for storing the processor-executable instructions;
wherein the processor is configured to:
acquiring target data, wherein the target data comprises K nodes stored in a graph database, the K nodes comprise labels, and K is more than or equal to 1;
dividing the K nodes into G groups according to the labels of the K nodes, wherein G is more than or equal to 1;
and displaying nodes of the target group, wherein the target group is any one of the G groups.
According to a fourth aspect of embodiments of the present disclosure, there is provided a computer-readable storage medium having stored thereon computer instructions which, when executed by a processor, implement the steps of the data processing method provided by the first aspect.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and together with the description, serve to explain the principles of the disclosure.
Fig. 1 is a flowchart of a data processing method provided by an embodiment of the present disclosure;
FIG. 2 is a schematic diagram of a user interface provided by an embodiment of the present disclosure;
FIG. 3 is a schematic diagram of a user interface provided by an embodiment of the present disclosure;
FIG. 4 is a schematic diagram of a user interface provided by an embodiment of the present disclosure;
FIG. 5-1 is a schematic view of a user interface provided by an embodiment of the present disclosure;
FIG. 5-2 is a schematic view of a user interface provided by an embodiment of the present disclosure;
FIG. 6 is a schematic diagram illustrating a data node and corresponding edges provided by an embodiment of the present disclosure;
FIG. 7 is a schematic diagram of a user interface provided by an embodiment of the present disclosure;
FIG. 8 is a schematic diagram of a user interface provided by an embodiment of the present disclosure;
FIG. 9 is a schematic diagram of a user interface provided by an embodiment of the present disclosure;
FIG. 10 is a schematic diagram of a function button on a node provided by an embodiment of the present disclosure;
FIG. 11 is a schematic view of a user interface provided by an embodiment of the present disclosure;
FIG. 12 is a schematic view of a user interface provided by an embodiment of the present disclosure;
FIG. 13 is a schematic view of a user interface provided by an embodiment of the present disclosure;
FIG. 14 is a schematic view of a user interface provided by an embodiment of the present disclosure;
FIG. 15 is a schematic view of a user interface provided by an embodiment of the present disclosure;
FIG. 16 is a block diagram of a data processing apparatus provided by an embodiment of the present disclosure;
fig. 17 is a block diagram of an electronic device provided in an embodiment of the present disclosure.
Detailed Description
Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The implementations described in the exemplary embodiments below are not intended to represent all implementations consistent with the present disclosure. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the present disclosure, as detailed in the appended claims.
Data in a graph database needs to be queried through a structured query language, and certain technical thresholds exist. The purpose of the present disclosure is to provide a data processing method, which reduces the technical threshold for obtaining data, displays data in a graph database to a user in a friendly and easy-to-use manner, for example, displays the data in forms of tables, charts, colors, graphic menus, etc., and can intuitively reflect data relationships, and the interface is friendly and easy-to-use.
Of course, the display form includes, but is not limited to, the above listed display forms, and the embodiment of the present disclosure does not limit the specific display form.
The term "and/or" in this disclosure is only one kind of association relationship describing the associated object, and means that there may be three kinds of relationships, for example, a and/or B, which may mean: a exists alone, A and B exist simultaneously, and B exists alone.
An embodiment of the present disclosure provides a data processing method, as shown in fig. 1, the data transmission method includes the following steps:
101. target data is acquired.
Referring to the schematic diagram of the user interface shown in fig. 2, the user can designate one of the candidate pieces of data as the target data. The target data may be any piece of data stored by a graph database.
The target data comprises K nodes (English: nodes) stored in the graph database, the K nodes comprise labels (English: table), and K is larger than or equal to 1.
102. And dividing the K nodes into G groups according to the labels of the K nodes.
Wherein G ≧ 1, i.e., the number of packets can be one or more.
Referring to table 1, taking the case where K is 10 and G is 3 as an example, 10 nodes are respectively node 1 to node 10, each node includes its own label, and each group corresponds to several labels. One tag for each packet and one packet for one or more tags.
And the nodes corresponding to the label A, the label B and the label C are divided into a group. And the nodes corresponding to the labels D and E are divided into a group. Nodes corresponding to the label F are divided into a group.
TABLE 1
Referring to the schematic diagram of the user interface shown in fig. 3, a user may specify a tag corresponding to each group, and the plurality of nodes are divided into a plurality of groups by specifying a corresponding relationship between the tags and the groups.
103. And displaying the nodes of the target group.
The target packet is any one of G packets. Referring to fig. 4, taking the case of the target group as group 1 as an example, when the user clicks the "group 1" option of the user interface, the page displays the nodes of group 1.
Alternatively, the nodes of the target group may be displayed in a table, graph, or the like.
For example, a situation when the nodes of the target group are displayed in a table is shown in fig. 4.
As another example, the situation where the nodes of the target packet are shown graphically is shown in FIG. 5-1.
In one embodiment, the target data further includes edges corresponding to the K nodes, and the edges corresponding to the nodes of the target group can be displayed simultaneously when the nodes of the target group are displayed. Referring to the display interface shown in fig. 5-2, edges between nodes may be represented by connecting lines between nodes.
The data processing method provided by the embodiment of the disclosure divides the nodes in the graph database into a plurality of groups and displays any one of the groups. On one hand, the technical threshold for viewing the data in the graph database is reduced, so that common non-technical personnel can view the data. On the other hand, any group in a plurality of groups can be displayed by adopting the technical scheme, namely, a user can view partial nodes in the graph database according to the groups according to personal requirements, and the aims of targeted viewing and data screening are achieved. Especially when the number of nodes is large (namely, the value of K is large), the convenience brought to the user by the packet viewing is more obvious.
Based on the data processing method provided by the embodiments corresponding to fig. 1 to fig. 5, another embodiment of the present disclosure provides a further supplementary description on the data processing method. This embodiment will be described by taking as an example a case where nodes and edges are displayed in a graph form.
The content of some steps is the same as or similar to the steps in the corresponding embodiment of fig. 1, and only the differences in the steps will be described in detail below.
The data processing method can be applied to electronic equipment such as computers, mobile phones and data visualization display platforms. Referring to fig. 6, the data processing method provided in this embodiment includes the following steps:
601. target data is acquired.
The object data includes K nodes (english: nodes) stored in the graph database, and edges (english: edges) corresponding to the K nodes. Wherein, K nodes comprise labels (English: table), and K is more than or equal to 1.
Taking the case of K being 10 as an example, referring to table 1, 10 nodes and edges corresponding to the 10 nodes are shown in fig. 7. In the subsequent steps, the user operation and the corresponding display contents will be explained one by one.
602. And dividing the K nodes into G groups according to the labels of the K nodes.
Wherein G ≧ 1, i.e., the number of packets can be one or more.
There may be an order or hierarchical relationship between the G groups. For example, the K nodes are divided into G levels, each level corresponding to a group. In this embodiment, a case where the group 1 is the first hierarchy, the group 2 is the second hierarchy, and the group 3 is the third hierarchy will be described as an example.
It is specifically noted that a node may include one or more labels and a node may be partitioned into one or more packets according to its label.
For example, if a node includes label a and label D, then the node belongs to both packet 1 and packet 2.
In an application scenario, one node only belongs to one group, and one group may only comprise one node or comprise more than one node, where K is greater than or equal to 1, and G is greater than or equal to 1 and less than or equal to K.
In another application scenario, a node may belong to one or more packets, a packet may include a node, or include more than one node, in which case the number of packets may be greater than the number of nodes, i.e. G > K.
603. And receiving a grouping selection instruction, and selecting a target grouping from the G groups according to the grouping selection instruction.
The target packet is any one of G packets. For example, referring to fig. 8, when the user clicks the "group 2" option under the "show" page through an input device such as a mouse, a group selection instruction is triggered, and the electronic device determines that the group 2 is the target group according to the group selection instruction.
The user triggers a group selection instruction through an input device, and a target group is designated according to personal intention so as to view nodes of the target group.
604. The nodes of the target packet and the edges between the nodes of the target packet are displayed.
Referring to fig. 9, when the target group is group 2, the electronic device displays nodes 5 to 7. Optionally, edges between the 3 nodes may also be displayed. Edges between nodes may be represented by connecting lines between nodes. Fig. 9 is a schematic diagram showing nodes and edges between the nodes of the target packet at the same time.
605. And receiving a node selection instruction, and selecting a target node from the displayed nodes according to the node selection instruction.
The node selection instruction is used for designating a target node, and the target node is any node displayed at the current moment.
The user can trigger a node selection instruction through an input device, and a target node is specified in the displayed nodes according to personal wishes. Referring to fig. 9, when the user clicks the node 5, the electronic device determines that the node 5 is the target node.
606. And determining an expansion node corresponding to the target node according to the target data, and displaying the expansion node and the corresponding edge.
The expansion node corresponding to the target node may include part or all of the nodes having edges with the target node.
Optionally, when the target node and the expansion node are displayed, an edge between the target node and the expansion node may also be displayed.
Optionally, when the target node and the expansion node are displayed, the edges between the expansion nodes may also be displayed.
In the display interface diagram provided in this embodiment, the edges between the target node and the expansion nodes and the edges between the expansion nodes are displayed.
The following provides 5 exemplary illustrations of the expansion nodes. Referring to fig. 10, a plurality of menu buttons may be disposed on the nodes of the page display, and when a user clicks different buttons, the different expanded nodes are corresponding to the different buttons.
For ease of explanation, the 5 menu buttons on a node will be referred to as: a lower level expand button, an upper level expand button, a same level expand button, a different level expand button, and an associated expand button.
Example 1
The expansion node is a node which is adjacent to the target node in two groups and has an edge with the target node. Taking the case of grouping according to the hierarchy as an example, the adjacent grouping of the grouping where the target node is located may be the adjacent next-level grouping of the grouping where the target node is located.
Referring to fig. 9, when the user clicks a lower expansion button on the node 5, the electronic device determines that the node 5 is a target node, and determines that an expansion node corresponding to the node 5 is a node having an edge between the node 5 and the node in the packet 3, including the node 8 and the node 9.
The electronic device displays nodes 8 and 9 and corresponding edges. The display interface is shown in fig. 11. When the user clicks the lower expansion button on node 5 again, the display nodes 8 and 9 and the corresponding edges may be cancelled, returning to the display interface shown in fig. 9.
Example 2
The expansion node is a node which is adjacent to the target node in two groups and has an edge with the target node. Taking the case of grouping according to the hierarchy as an example, the adjacent grouping of the grouping where the target node is located may be the adjacent upper-level grouping of the grouping where the target node is located.
Referring to fig. 9, when the user clicks the upper expansion button on the node 5, the electronic device determines that the node 5 is the target node, and determines that the expansion node corresponding to the node 5 is a node having an edge with the node 5 in the group 1, including the node 2.
The electronic device displays node 2 and the corresponding edge. The display interface is shown in fig. 12. When the user clicks the upper expansion button on the node 5 again, the display node 2 and the corresponding edge may be cancelled, and the display interface shown in fig. 9 is restored.
Example 3
The expansion node is a node which is in the same group with the target node and has an edge with the target node.
Referring to fig. 12, when the user clicks the peer expansion button on the node 2, the electronic device determines that the node 2 is the target node, and determines that the expansion node corresponding to the node 2 is a node in the group 1 and having an edge with the node 2, including the node 1, the node 3, and the node 4.
The electronic device displays node 1, node 3, and node 4, along with the corresponding edges. The display interface is shown in fig. 13. When the user clicks the sibling expansion button on node 2 again, the display of nodes 1, 3 and 4, and the corresponding edges, may be cancelled, returning to the display interface shown in fig. 12.
Example 4
The expansion node is a node among the 10 nodes having an edge with the target node.
Referring to fig. 12, when the user clicks the association expansion button on the node 2, the electronic device determines that the node 2 is the target node, and determines that the expansion node corresponding to the node 2 is the nodes having edges between the node 2 and all the groups, including the node 1, the node 3, the node 4, the node 5, the node 6, and the node 10.
The electronic device displays node 1, node 3, node 4, node 5, node 6, and node 10, and the corresponding edges. The display interface is shown in fig. 14. When the user clicks the associate expand button on node 2 again, the display of nodes 1, 3, 4, 5, 6, and 10, and the corresponding edges, may be cancelled, reverting to the display interface shown in FIG. 12.
Example 5
An expansion node is a node that is in a different grouping from the target node and has an edge with the target node.
Referring to fig. 9, when the user clicks the expansion buttons at different levels on the node 5, the electronic device determines that the node 5 is the target node, and determines that the expansion node corresponding to the node 5 is the node having an edge between the node 5 in the group 1 and the group 3, including the node 2, the node 8, and the node 9.
The electronic device displays node 2, node 8, and node 9, and the corresponding edges. The display interface is shown in fig. 15. When the user clicks the different level expand button on node 5 again, node 2, node 8, and node 9, and the corresponding edges may be dismissed and the display interface shown in FIG. 9 restored.
Comparing fig. 9 and 11 to 15 with fig. 7, respectively, any of the display interfaces shown in fig. 9 and 11 to 15 only shows a part of 10 nodes and edges between the part of the nodes. That is to say, the electronic device screens out and displays the nodes or edges concerned by the user according to the operation of the user, and does not display other nodes or edges, thereby achieving the effect of displaying according to the requirements of the user.
Of course, the electronic device may gradually increase the display content according to the user's operation until all the nodes and edges are displayed.
When the number of the nodes is large, namely the value of K is large, the contents concerned by the user are screened in a mode of group viewing, layer-by-layer expansion or group-by-group expansion, and the convenience brought to the user is particularly remarkable.
An expansion node may be a node that has an edge with a destination node and is in the same group, in a different group, or in an adjacent group. Besides the above listed conditions for screening expansion nodes, the corresponding expansion nodes can also be screened according to other screening conditions, and the above 5 examples are only used for illustrative illustration of expansion nodes and are not exhaustive.
The data processing method provided by the embodiment of the disclosure divides the nodes in the graph database into a plurality of groups and displays any one of the groups. On one hand, the technical threshold for viewing the data in the graph database is reduced, so that common non-technical personnel can view the data. On the other hand, any group in a plurality of groups can be displayed by adopting the technical scheme, namely, a user can view partial nodes in the graph database according to the groups according to personal requirements, and the aims of targeted viewing and data screening are achieved. Especially when the number of nodes is large (namely, the value of K is large), the convenience brought to the user by the packet viewing is more obvious.
Based on the data processing method described in the embodiments corresponding to fig. 1 to fig. 15, the following is an embodiment of the apparatus of the present disclosure, which can be used to execute an embodiment of the method of the present disclosure.
An embodiment of the present disclosure provides a data processing apparatus, as shown in fig. 16, the data processing apparatus includes:
the data module 161 is configured to obtain target data, where the target data includes K nodes stored in the graph database, the K nodes include tags, and K is greater than or equal to 1.
The configuration module 162 is configured to divide the K nodes into G groups according to the labels of the K nodes, where G is greater than or equal to 1.
And a screening module 163 for displaying the nodes of the target packet, which is any one of the G packets.
In one embodiment, the target data further includes edges corresponding to the K nodes.
The screening module 163 is configured to determine, according to the target data, an expansion node corresponding to the target node, where the target node is any node that has been displayed at the current time; and displaying the expansion nodes.
Wherein the expansion node comprises any one of the following:
and the nodes with edges between the K nodes and the target node.
And the node which is in the same group with the target node and has an edge with the target node.
A node that is in a different group from the target node and has an edge with the target node.
And the nodes which are adjacent to the target node and have edges with the target node.
In one embodiment, the filtering module 163 is configured to display edges between nodes of the target packet.
And/or displaying an edge between the target node and the expansion node.
And/or displaying edges between the unfolded nodes.
In one embodiment, further comprising:
the instruction module 164 is configured to receive a node selection instruction, and select a target node from the displayed nodes according to the node selection instruction.
In one embodiment, further comprising:
and an instruction module 164, configured to receive a packet selection instruction, and select a target packet from the G packets according to the packet selection instruction.
Based on the data processing method described in the embodiments corresponding to fig. 1 to fig. 15, an embodiment of the present disclosure provides an electronic device, as shown in fig. 17, where the electronic device 17 includes:
a processor 171.
A memory 172 for storing processor-executable instructions.
Wherein the processor 171 is configured to:
and acquiring target data, wherein the target data comprises K nodes stored in the graph database, the K nodes comprise labels, and K is more than or equal to 1.
And dividing the K nodes into G groups according to the labels of the K nodes, wherein G is more than or equal to 1.
And displaying the nodes of the target group, wherein the target group is any one of the G groups.
The target data further includes edges corresponding to the K nodes, and in one embodiment, the processor 171 is configured to:
and determining an expansion node corresponding to the target node according to the target data, wherein the target node is any node displayed at the current moment.
And displaying the expansion nodes.
Wherein the expansion node comprises any one of the following:
and the nodes with edges between the K nodes and the target node.
And the node which is in the same group with the target node and has an edge with the target node.
A node that is in a different group from the target node and has an edge with the target node.
And the nodes which are adjacent to the target node and have edges with the target node.
In one embodiment, the processor 171 is configured to:
edges between nodes of the target packet are displayed.
And/or displaying an edge between the target node and the expansion node.
And/or displaying edges between the unfolded nodes.
In one embodiment, the processor 171 is configured to:
and receiving a node selection instruction, and selecting a target node from the displayed nodes according to the node selection instruction.
In one embodiment, the processor 171 is configured to:
and receiving a grouping selection instruction, and selecting a target grouping from the G groups according to the grouping selection instruction.
According to the data processing device and the electronic equipment provided by the embodiment of the disclosure, the nodes in the graph database are divided into a plurality of groups, and any one of the groups is displayed. On one hand, the technical threshold for viewing the data in the graph database is reduced, so that common non-technical personnel can view the data. On the other hand, any group in a plurality of groups can be displayed by adopting the technical scheme, namely, a user can view partial nodes in the graph database according to the groups according to personal requirements, and the aims of targeted viewing and data screening are achieved. Especially when the number of nodes is large (namely, the value of K is large), the convenience brought to the user by the packet viewing is more obvious.
Based on the data processing method described in the embodiments corresponding to fig. 1 to fig. 15, embodiments of the present disclosure further provide a computer-readable storage medium, for example, the non-transitory computer-readable storage medium may be a Read Only Memory (ROM), a Random Access Memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, and the like. The storage medium stores computer instructions for executing the data transmission method described in the embodiment corresponding to fig. 1 to fig. 15, which is not described herein again.
Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This application is intended to cover any variations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.
Claims (8)
1. A method of data processing, the method comprising:
acquiring target data, wherein the target data comprises K nodes stored in a graph database, the K nodes comprise labels, and K is more than or equal to 1;
dividing the K nodes into G groups according to the labels of the K nodes, wherein G is more than or equal to 1;
a node displaying a target packet, the target packet being any one of the G packets;
wherein the target data further includes edges corresponding to the K nodes, and the method further includes:
determining an expansion node corresponding to a target node according to the target data, wherein the target node is any node displayed at the current moment;
displaying the expansion node;
wherein the expansion node comprises any one of:
a node having an edge with the target node among the K nodes;
the node is in the same group with the target node, and an edge exists between the node and the target node;
a node in a different group from the target node and having an edge with the target node;
and the nodes which are two groups adjacent to the target node and have edges with the target node.
2. The method of claim 1, further comprising:
displaying edges between nodes of the target packet;
and/or, displaying an edge between the target node and the expansion node;
and/or displaying edges between the expansion nodes.
3. The method of claim 1, wherein before determining the expansion node corresponding to the target node according to the target data, the method further comprises:
and receiving a node selection instruction, and selecting the target node from the displayed nodes according to the node selection instruction.
4. The method of claim 1, wherein the displaying the nodes of the target group is preceded by:
and receiving a grouping selection instruction, and selecting the target grouping in the G groups according to the grouping selection instruction.
5. A data processing apparatus, characterized in that the apparatus comprises:
the data module is used for acquiring target data, wherein the target data comprises K nodes stored in a graph database, the K nodes comprise labels, and K is more than or equal to 1;
the configuration module is used for dividing the K nodes into G groups according to the labels of the K nodes, wherein G is more than or equal to 1;
a screening module for displaying nodes of a target packet, the target packet being any one of the G packets;
wherein the target data further comprises edges corresponding to the K nodes;
the screening module is used for determining an expanded node corresponding to a target node according to the target data, wherein the target node is any node displayed at the current moment; displaying the expansion node;
wherein the expansion node comprises any one of:
a node having an edge with the target node among the K nodes;
the node is in the same group with the target node, and an edge exists between the node and the target node;
a node in a different group from the target node and having an edge with the target node;
and the nodes which are two groups adjacent to the target node and have edges with the target node.
6. The apparatus of claim 5,
the screening module is used for displaying edges among the nodes of the target grouping;
and/or, displaying an edge between the target node and the expansion node;
and/or displaying edges between the expansion nodes.
7. The apparatus of claim 5, further comprising:
and the instruction module is used for receiving a node selection instruction and selecting the target node from the displayed nodes according to the node selection instruction.
8. The apparatus of claim 5, further comprising:
and the instruction module is used for receiving a grouping selection instruction and selecting the target grouping in the G groups according to the grouping selection instruction.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811599580.5A CN109697238B (en) | 2018-12-26 | 2018-12-26 | Data processing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811599580.5A CN109697238B (en) | 2018-12-26 | 2018-12-26 | Data processing method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109697238A CN109697238A (en) | 2019-04-30 |
| CN109697238B true CN109697238B (en) | 2021-01-01 |
Family
ID=66232075
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811599580.5A Active CN109697238B (en) | 2018-12-26 | 2018-12-26 | Data processing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109697238B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115022185B (en) * | 2022-06-21 | 2023-09-26 | 浪潮通信信息系统有限公司 | Topological graph display method and device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104219672A (en) * | 2014-10-14 | 2014-12-17 | 北京奇虎科技有限公司 | Incoming call or message identification method and device |
| CN107330030A (en) * | 2017-06-23 | 2017-11-07 | 南京师范大学 | A kind of hierarchical network construction method that storage is compressed towards magnanimity road net data |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9928287B2 (en) * | 2013-02-24 | 2018-03-27 | Technion Research & Development Foundation Limited | Processing query to graph database |
| CN107545019A (en) * | 2017-03-02 | 2018-01-05 | 微云数聚（北京）科技有限公司 | A kind of method for visualizing and system of chart database data-driven |
| US10592557B2 (en) * | 2017-03-31 | 2020-03-17 | Microsoft Technology Licensing, Llc | Phantom results in graph queries |
| CN108170847B (en) * | 2018-01-18 | 2021-08-31 | 国网福建省电力有限公司 | Big data storage method based on Neo4j graph database |
-
2018
- 2018-12-26 CN CN201811599580.5A patent/CN109697238B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104219672A (en) * | 2014-10-14 | 2014-12-17 | 北京奇虎科技有限公司 | Incoming call or message identification method and device |
| CN107330030A (en) * | 2017-06-23 | 2017-11-07 | 南京师范大学 | A kind of hierarchical network construction method that storage is compressed towards magnanimity road net data |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109697238A (en) | 2019-04-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9972105B2 (en) | Visualization of data clusters | |
| US7889888B2 (en) | System and method for grouping and visualizing data | |
| KR102455232B1 (en) | Method and electronic device for tab management based on context | |
| US8024651B1 (en) | Data visualization using tables integrated with hierarchical pie charts | |
| KR101950529B1 (en) | Methods for electronic document searching and graphically representing electronic document searches | |
| US7730397B2 (en) | System and method for rapid presentation of structured digital content items | |
| CN104965630B (en) | Method and system for layout of desktop application icons | |
| US8893050B2 (en) | Assembly and output of user-defined groupings | |
| US9507791B2 (en) | Storage system user interface with floating file collection | |
| US10074027B2 (en) | Density sampling map data | |
| US8707200B2 (en) | Object browser with proximity sorting | |
| US10565560B2 (en) | Alternative people charting for organizational charts | |
| CN113568540A (en) | Method, device, equipment and medium for displaying function menu in Web application | |
| US8743134B2 (en) | Interactive comparative analysis of multiple object data visualizations | |
| CN109478191B (en) | Text mining method, recording medium, and text mining device | |
| KR20170135670A (en) | Selection control method, selection control device, and recording medium | |
| CN108572817B (en) | Method, apparatus and medium for dynamic resource configuration based on business modeling | |
| CN109697238B (en) | Data processing method and device | |
| CN110795493A (en) | Multi-level index data display method, device, equipment and storage medium | |
| CN110968386B (en) | Navigation bar processing method and system | |
| CN107315674B (en) | Storage system information display method and system | |
| US20090006323A1 (en) | System and Method for Analyzing Intelligence Information | |
| CN110659096B (en) | Method, device, system and storage medium for displaying network topological graph | |
| CN114003718A (en) | Relation map drawing method and device, computer storage medium and electronic equipment | |
| CN112579664A (en) | Processing method and device for chart linkage |
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 |