Graph data processing method, device and equipment

By configuring the interface to edit and match the diagram patterns, the results are significant and the timing information is used for hierarchical and serial numbers are displayed, which solves the problem of local structure exploration in complex relationship diagrams, and improves matching efficiency and intuitiveness.

CN114610962BActive Publication Date: 2024-11-26ALIPAY (HANGZHOU) INFORMATION TECH CO LTD
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202210196579.8
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-03-01
Publication Date
2024-11-26
Estimated Expiration
2042-03-01

AI Technical Summary

Technical Problem

The prior art is difficult to efficiently and accurately find and display local structures in complex relationship diagrams, especially when the graph data contains timing information, it is difficult for users to intuitively explore and match the graph patterns of interest.

Method used

Provide a graph data processing method, which receives user editing nodes and edge operations through the configuration interface, generates target graph patterns, and matches them in graph data to significantly improve the matching results; at the same time, obtains timing information in graph data and generates nodes The hierarchical layout and edge sequence number information display the graph data in a hierarchical and orderly manner.

Benefits of technology

It improves the efficiency and accuracy of graph pattern matching, supports users to edit patterns according to their needs and correct patterns in real time, can explore unknown graph patterns, significantly display results, and make it easier for users to discover the graph structure of interest.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114610962B_ABST
    Figure CN114610962B_ABST
Patent Text Reader

Abstract

The embodiments of this specification disclose a method, apparatus and device for processing graph data. The scheme includes: displaying graph data and a configuration interface for configuring a graph mode on the front end, wherein the graph mode is used to specify a subgraph structure; receiving a user's editing operation of adding nodes and edges through the configuration interface; generating a target graph mode in response to the editing operation; matching the target graph mode in the graph data to obtain a subgraph matching the target graph mode in the graph data; and prominently displaying the area where the subgraph is located in the graph data displayed on the front end so that the user can pay attention.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of computer technology, and in particular to methods, devices and equipment for processing graph data. Background Art

[0002] With the development of computer and Internet technology, more and more relational data have emerged. Compared with general statistical data, relational data is often more complex, and it is difficult to manage and display clearly through traditional methods such as text and tables. Clear graph visualization can help end users and analysts quickly understand relational data and help locate risks and problems in the data. For example, in business scenarios such as risk control, finance, and user networks, graph visualization of data has become an important technology.

[0003] Therefore, drawing the relationship data in the form of nodes and edges into a point-line relationship diagram (the data contained in the relationship diagram is also called graph data) is currently the most commonly used means of graph visualization. When the data itself is complex, the relationship diagram drawn is often also complex, and the time series information contained in the relationship data is generally hidden in the attributes of the nodes or edges, which easily makes the relationship diagram more complex.

[0004] When users want to find the required local structure in a relationship graph (for example, a sub-relationship graph with a special structure, a local structure that carries time series information), they usually search by manual visual exploration, using graph pattern matching algorithms, etc.

[0005] Based on this, a graph data processing solution is needed that is more efficient, accurate, and can more intuitively show users the layout structure they need. Summary of the invention

[0006] One or more embodiments of the present specification provide a graph data processing method, apparatus, device, and storage medium to solve the following technical problems: a graph data processing solution is needed that is more efficient, accurate, and can more intuitively display the layout structure required by users.

[0007] To solve the above technical problems, one or more embodiments of this specification are implemented as follows:

[0008] One or more embodiments of the present specification provide a method for processing graph data, wherein the graph data includes a plurality of nodes and edges between the nodes, and the method includes:

[0009] Displaying the graph data and a configuration interface for configuring a graph mode on a front end, wherein the graph mode is used to specify a subgraph structure;

[0010] Accepting user editing operations of adding nodes and edges through the configuration interface;

[0011] In response to the editing operation, generating a target graph mode;

[0012] Matching the graph data according to the target graph pattern to obtain a subgraph in the graph data that matches the target graph pattern;

[0013] In the graph data displayed on the front end, the area where the sub-graph is located is prominently displayed so as to attract the user's attention.

[0014] One or more embodiments of the present specification provide a method for processing graph data, wherein the graph data includes a plurality of nodes and edges between the nodes, and the method includes:

[0015] Obtaining time sequence information of edges in the graph data;

[0016] Generate hierarchical layout information of each of the nodes and sequence number information of each of the edges according to the timing information;

[0017] According to the hierarchical layout information and the serial number information, the nodes in the graph data are displayed hierarchically at the front end, and the edges in the graph data are displayed with serial numbers, and the serial numbers indicate the corresponding time sequence.

[0018] One or more embodiments of the present specification provide a graph data processing device, wherein the graph data includes a plurality of nodes and edges between the nodes, and the device includes:

[0019] A front-end display module displays the graph data and a configuration interface for configuring a graph mode on the front-end, wherein the graph mode is used to specify a sub-graph structure;

[0020] The editing module receives the user's editing operation of adding nodes and edges through the configuration interface;

[0021] A first generating module, in response to the editing operation, generates a target graph mode;

[0022] A matching module, matching the graph data according to the target graph pattern, and obtaining a subgraph in the graph data that matches the target graph pattern;

[0023] A prominent display module prominently displays the area where the sub-image is located in the image data displayed by the front end so that the user can pay attention to it.

[0024] One or more embodiments of the present specification provide a graph data processing device, wherein the graph data includes a plurality of nodes and edges between the nodes, and the device includes:

[0025] An acquisition module, which acquires the time sequence information of the edges in the graph data;

[0026] A second generating module generates hierarchical layout information of each of the nodes and sequence number information of each of the edges according to the timing information;

[0027] The hierarchical display module displays the nodes in the graph data hierarchically and displays the edges in the graph data with serial numbers at the front end according to the hierarchical layout information and the serial number information, and the serial numbers indicate the corresponding time sequence.

[0028] One or more embodiments of the present specification provide a graph data processing device, wherein the graph data includes a plurality of nodes and edges between the nodes, and the device includes:

[0029] at least one processor; and,

[0030] a memory communicatively connected to the at least one processor; wherein,

[0031] The memory stores instructions executable by the at least one processor, the instructions being executed by the at least one processor to enable the at least one processor to:

[0032] Displaying the graph data and a configuration interface for configuring a graph mode on a front end, wherein the graph mode is used to specify a subgraph structure;

[0033] Accepting user editing operations of adding nodes and edges through the configuration interface;

[0034] In response to the editing operation, generating a target graph mode;

[0035] Matching the graph data according to the target graph pattern to obtain a subgraph in the graph data that matches the target graph pattern;

[0036] In the graph data displayed on the front end, the area where the sub-graph is located is prominently displayed so as to attract the user's attention.

[0037] One or more embodiments of the present specification provide a graph data processing device, wherein the graph data includes a plurality of nodes and edges between the nodes, and the device includes:

[0038] at least one processor; and,

[0039] a memory communicatively connected to the at least one processor; wherein,

[0040] The memory stores instructions executable by the at least one processor, the instructions being executed by the at least one processor to enable the at least one processor to:

[0041] Obtaining time sequence information of edges in the graph data;

[0042] Generate hierarchical layout information of each of the nodes and sequence number information of each of the edges according to the timing information;

[0043] According to the hierarchical layout information and the serial number information, the nodes in the graph data are displayed hierarchically at the front end, and the edges in the graph data are displayed with serial numbers, and the serial numbers indicate the corresponding time sequence.

[0044] At least one of the above technical solutions adopted in one or more embodiments of this specification can achieve the following beneficial effects:

[0045] Users can design special graph structure patterns of their interest through simple configuration, and then automatically match subgraphs of similar structures in the graph data. When users know the graph pattern of interest, they can directly use the pattern for calculation; and when users do not know the specific graph pattern, they can also use this solution to explore and discover the pattern structure of interest.

[0046] Compared with traditional human observation, automatic matching through corresponding matching algorithms can improve matching efficiency and accuracy. Compared with traditional pattern matching algorithms, it supports users to edit patterns and configure conditions according to their own scene requirements, and can correct patterns in real time.

[0047] When the user knows the graph pattern he wants to find, he can directly customize the desired target graph pattern in the pattern editor and match it. When the user does not know the specific pattern structure and conditions, he can also use the pattern editor. Through multiple editing, modification, and mode switching, he can eventually explore the graph pattern that can help the user find the information he is interested in. After switching to different graph data, the known target graph pattern can still be used for matching to find interesting patterns on different data.

[0048] The results calculated by the pattern matching algorithm can also be presented more prominently (for example, through sub-image highlighting, table and main image linkage, etc.), making the display interface more intuitive and giving users more opportunities to explore unknown special patterns. BRIEF DESCRIPTION OF THE DRAWINGS

[0049] In order to more clearly illustrate the embodiments of this specification or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments recorded in this specification. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative labor.

[0050] Figure 1 A flowchart of a graph data processing method based on a graph mode provided for one or more embodiments of this specification;

[0051] Figure 2 A schematic diagram of a front-end interface in an application scenario provided for one or more embodiments of this specification;

[0052] Figure 3 A schematic diagram of a creation mode in an application scenario provided for one or more embodiments of this specification;

[0053] Figure 4 A schematic diagram of generating a target graph mode by adding nodes in an application scenario provided for one or more embodiments of this specification;

[0054] Figure 5 A schematic diagram of generating a target graph mode by adding a template in an application scenario provided for one or more embodiments of this specification;

[0055] Figure 6 A schematic diagram of a flow chart of a graph data processing method based on a graph mode in an application scenario provided for one or more embodiments of this specification;

[0056] Figure 7 A schematic flow chart of a graph data processing method based on time series information provided in one or more embodiments of this specification;

[0057] Figure 8 A schematic diagram of a timing analysis configuration interface in an application scenario provided for one or more embodiments of this specification;

[0058] Fig. 9 A schematic diagram of a timing analysis effect in an application scenario provided for one or more embodiments of this specification;

[0059] Fig.10 A schematic diagram of filtering a time range on an interactive timeline in an application scenario provided for one or more embodiments of this specification;

[0060] Fig.11 A schematic diagram of filtering time points on an interactive timeline in an application scenario provided for one or more embodiments of this specification;

[0061] Fig.12 A schematic diagram of a list analysis interface of an analysis result interface in an application scenario provided for one or more embodiments of this specification;

[0062] Fig.13 A schematic diagram of a chart analysis interface of an analysis result interface in an application scenario provided for one or more embodiments of this specification;

[0063] Fig.14A flowchart of a method for processing graph data based on time series information in an application scenario provided for one or more embodiments of this specification;

[0064] Fig.15 A schematic diagram of the structure of a graph data processing device based on a graph mode provided for one or more embodiments of this specification;

[0065] Fig.16 A schematic diagram of the structure of a graph data processing device based on time series information provided for one or more embodiments of this specification. DETAILED DESCRIPTION

[0066] The embodiments of this specification provide a graph data processing method, apparatus, device, and storage medium.

[0067] In order to enable those skilled in the art to better understand the technical solutions in this specification, the technical solutions in the embodiments of this specification will be clearly and completely described below in conjunction with the drawings in the embodiments of this specification. Obviously, the described embodiments are only part of the embodiments of this application, not all of them. Based on the embodiments of this specification, all other embodiments obtained by ordinary technicians in this field without creative work should fall within the scope of protection of this application.

[0068] Before processing the relationship graph, the relationship graph is relatively unfamiliar to the user. Although the user has the purpose of exploring the graph structure, it is unknown how to explore and what kind of structure to explore. The first method of manual visual retrieval is obviously not applicable in more complex graph data scenarios. It is difficult for the human eye to find subgraphs with specific structures in complex graphs, which is inefficient and has a high error rate. For the second method of using graph pattern matching algorithms, graph patterns are generally built into the system. It is difficult for users to modify and edit graph patterns in real time, and it is also difficult to configure the attribute conditions of nodes and edges in the pattern on demand. They can only use built-in patterns. However, graph data and graph scenarios are ever-changing, and graph patterns vary in different scenarios and requirements, which are difficult to enumerate. This makes the second method low in freedom and poor in scalability, and it is difficult to be universal for various scenarios and requirements. In addition, most users may not have prior knowledge of the data itself, and do not know what special structural patterns need to be paid attention to in the current scenario. Both methods are difficult to help users explore and summarize unknown structural patterns.

[0069] Figure 1A flowchart of a graph data processing method based on a graph mode provided for one or more embodiments of this specification. The method can be applied to different business fields, such as risk control fields (for example, risk modes such as gambling and money laundering in risk control scenarios), Internet financial business fields, online social fields (for example, special community modes in social networks), e-commerce business fields, instant messaging business fields, game business fields, official business fields, etc. The process can be executed by a computing device in the corresponding field (for example, an intelligent customer service server or an intelligent mobile terminal corresponding to a payment business, etc.), and some input parameters or intermediate results in the process allow manual intervention and adjustment to help improve accuracy.

[0070] Figure 1 The process in may include the following steps:

[0071] S102: Displaying the graph data and a configuration interface for configuring a graph mode on a front end, wherein the graph mode is used to specify a sub-graph structure.

[0072] A graph pattern refers to a structural relationship consisting of certain nodes and edges. For example, if there is an edge between two nodes, this is a simple graph pattern. A graph pattern is a general pattern and does not refer to a specific local graph structure in the graph data. Whether it contains specific node or edge information can be configured according to the specific needs of the user.

[0073] Figure 2 A schematic diagram of a front-end interface in an application scenario provided for one or more embodiments of this specification, wherein the graph data and the configuration interface are set in different front-end areas for display. The graph data is displayed in the front-end interface, and when the user triggers in the front-end interface (for example, the user clicks on a switch, or a node or edge in the front-end interface), a drawer in the right area pops up, and the configuration interface of the graph mode is displayed in the drawer. At the same time, the graph data is moved to the left area by translation, reduction, etc., so that the user can edit in the configuration interface at the same time according to the graph data.

[0074] S104: receiving the user's editing operation of adding nodes and edges through the configuration interface.

[0075] In the configuration interface, based on user needs, you can select the creation mode, clone mode and other modes to edit the graph mode. After the user selects the creation mode or clone mode in the configuration interface, click the edit button to enter the mode editor provided in the configuration interface.

[0076] If the user selects the create mode, an empty mode is created for the user, and the user edits in it to obtain the target mode. If the user selects the clone mode, several existing modes are displayed to the user. When the user selects from these modes, the target mode is obtained by editing according to the mode selected by the user.

[0077] Still Figure 2 For example, the user clicks "New Mode" to enter the creation mode. If there is already an edited "Mode 1", the user clicks "Copy Mode-1" to clone it and enter the clone mode, copying the existing "Mode 1" selected by the user in the current mode editor, and the user further edits it. When the user does not know the specific mode structure and conditions required, the clone mode can be used to quickly perform multiple edits and modifications to finally debug the required target graph mode, thereby improving editing efficiency.

[0078] Specifically, Figure 3 and Figure 4 The following are schematic diagrams of generating a target graph pattern by adding nodes and templates in an application scenario provided by one or more embodiments of the present specification. The pattern editor provides users with multiple editing methods, such as Figure 3 and Figure 4 As shown in the left area of ​​the figure, there are two options: "Add Node" and "Add Template". During the editing process, users can add a single node at a time by "Add Node", or add a graph pattern template consisting of several nodes and edges by "Add Template". When users add nodes by "Add Node" or "Add Template" (herein referred to as the first editing operation), they can specify the type of the added node in the pattern editor (for example, Figure 3 As shown in , in the graph data related to the film industry, the types include Action, USA, PG-13, etc.), attribute conditions (for example, description information description, film score film score, film run time film Runtime, etc.) for editing.

[0079] In addition to the first editing operation, users can also add edges between newly added nodes in the pattern editor (herein referred to as the second editing operation). For example, right-click a node and drag to extend an edge. In the second editing operation, you can also specify the type of the edge (for example, Figure 3 As shown in, in the graph data related to the film industry, types include film rating, film, film company, film starring, film category, film production country, etc.), attribute conditions are edited and added, which is similar to the first editing operation and will not be repeated here.

[0080] If the user selects the create mode, the first and second editing operations can be directly performed. If the user selects the clone mode, new nodes and edges can be directly added based on the clone, or the cloned graph mode template can be edited to modify the nodes and edges contained therein.

[0081] S106: In response to the editing operation, generate a target graph model.

[0082] After the user completes the first editing operation, the second editing operation, and other editing operations (for example, deleting existing nodes and edges, or changing the representation and location of nodes and edges in the graph mode, etc.), the user obtains the target graph mode in the mode editor. By saving, the obtained target graph mode can be returned to the main interface. In the main interface, the user performs the next matching operation based on the target graph mode.

[0083] S108: Match the target graph pattern in the graph data to obtain a subgraph in the graph data that matches the target graph pattern.

[0084] Figure 5 A schematic diagram of the matching results in an application scenario is provided for one or more embodiments of this specification. After the user returns to the main interface, click the "Match" button to use the target graph pattern edited in the pattern editor for matching. During the matching process, a subgraph similar to the target graph pattern is searched in the graph data in the left area. Among them, whether it is similar can be considered from multiple dimensions, such as the structure of the target graph pattern, the types of nodes and edges contained therein, attribute conditions, etc. Matching algorithms such as Ullmann, VF2, GraphQL, GADDI, and Spath can be used in the matching process.

[0085] In addition to finding similar subgraphs, the matching process can also be to find other types of subgraphs based on the target graph data, for example, to find complementary subgraphs. Complementarity can refer to the graph structure between the target graph pattern and the subgraph, which can form the graph structure in the preset template, or the two contain the types of nodes and edges that the other lacks, attribute conditions, etc.

[0086] S110: In the graph data displayed on the front end, the area where the sub-graph is located is prominently displayed so as to attract the attention of the user.

[0087] The prominent display can be to display the matching result list below the right area. When the user clicks on one of the lists, the sub-image corresponding to the list clicked by the user is displayed in a highlighted form in the graph data on the left. Figure 5As shown in the figure, a graph data processing scheme in the film industry is shown. A node of the "movie" type is connected to a node of the "film company" type through an edge of the "film production company" type, and the "movie" node satisfies the score (filmScore) attribute greater than 5, thereby obtaining the target graph pattern. Through the matching algorithm, two similar subgraphs are calculated in the graph data on the left, and their corresponding matching result lists are displayed at the bottom right, and highlighted in the graph data on the left. Of course, significant display can also include other forms, such as bolding the subgraph, changing the color of the subgraph, displaying the subgraph in the form of a partial enlarged image, etc. As long as it can be distinguished from other surrounding graph structures, it can be considered a significant display.

[0088] Compared with traditional human observation, automatic matching through corresponding matching algorithms can improve matching efficiency and accuracy. Compared with traditional pattern matching algorithms, it supports users to edit patterns and configure conditions according to their own scene requirements, and can modify patterns in real time. Editing efficiency can also be improved by adding templates, cloning existing patterns, etc.

[0089] When the user knows the graph pattern he wants to find, he can directly customize the desired target graph pattern in the pattern editor and match it. When the user does not know the specific pattern structure and conditions, he can also use the pattern editor. Through multiple editing, modification, and mode switching, he can eventually explore the graph pattern that can help the user find the information he is interested in. After switching to different graph data, the known target graph pattern can still be used for matching to find interesting patterns on different data.

[0090] The results calculated by the pattern matching algorithm can also be presented more prominently (for example, through sub-image highlighting, table and main image linkage, etc.), giving users more opportunities to explore unknown special patterns.

[0091] In one or more embodiments of this specification Figure 6 A flowchart of a graph data processing method based on a graph pattern in an application scenario is provided for one or more embodiments of the present specification. After starting to use it, the user first selects the required mode in the creation mode and the clone mode, and then enters the pattern editor. In the pattern editor, through the first editing operation, the second editing operation, etc., by adding nodes or adding templates, the nodes, edges, and the types and attribute conditions contained therein are edited to obtain the target graph pattern, and the target graph pattern is matched in the graph data to obtain the required subgraph, and related result lists and statistical charts are generated.

[0092] In one or more embodiments of this specification, the information in the graph data containing the time series dimension is of great significance in many scenarios. For example, in the scenario of fund analysis, the time on the edge generally represents the time when the funds circulate. Time series analysis can help users understand the development of the fund network over time and find out where the funds go over time. In a social relationship network, the time information on the node may represent the time when a user registered an account, and the time information on the edge may represent the time when two users added each other as friends. Time series analysis can help users understand how social communities are organized and established, so as to circle people, make decisions, promote, etc.

[0093] For time series information, it is usually displayed to users by marking time strings on nodes or edges, or using the time axis as a filter for time attributes. The first method of marking time strings on nodes or edges is only applicable to small-scale data of several points. However, time text is generally long and may include years, months, days, hours, minutes, seconds, and even milliseconds. The overlong text makes it difficult for users to read quickly. It is also likely to be blocked and overlapped when drawing the relationship graph, which will greatly affect the readability of the graph. For the second method of using the time axis, a time axis similar to a progress bar is generally placed below the graph. Users can filter out nodes and edges in the graph that meet the time range by selecting the time range. Although this more "dynamic" method can help users observe the evolution of the entire graph over time, it is difficult for users to compare time at one time in a complete set of data.

[0094] In addition, there are some quantitative attributes related to time series on the nodes and edges in the relationship graph. For example, the time and amount of transfer in the capital network; the time when two users added each other as friends and the degree of intimacy between the friends in the social network, etc. This information generally needs to be observed together with the time series information to achieve the analysis purpose. The above two methods are generally difficult to achieve this effect.

[0095] Based on this, Figure 7 A flow chart of a method for processing data based on a time series information graph is provided for one or more embodiments of this specification. The method can be applied to different business fields, such as risk control fields (for example, risk models such as gambling and money laundering in risk control scenarios), Internet financial business fields, online social fields (for example, special community models in social networks), e-commerce business fields, instant messaging business fields, game business fields, official business fields, etc. The process can be executed by a computing device in the corresponding field (for example, an intelligent customer service server or an intelligent mobile terminal corresponding to a payment business, etc.), and some input parameters or intermediate results in the process allow manual intervention and adjustment to help improve accuracy.

[0096] Figure 7The scheme shown in can be applied to Figure 1 In the scheme shown in , for example, it is applied to the display of graph data in the front end in step S102, so that the intuitiveness of the display of time series information when the front end displays the graph data can be improved. Due to the particularity and importance of time series information in graph data, the graph data processing scheme based on time series information is explained in detail below, so as to improve the intuitiveness of the display of time series information and reduce the difficulty for users to obtain time series information in graph data, so as to improve the generation efficiency and accuracy of time series information when editing the target graph data.

[0097] Figure 7 The process in may include the following steps:

[0098] S702: Obtain timing information of edges in the graph data.

[0099] Timing information refers to relevant information with time attributes. For nodes and edges, it can be a value containing a time attribute, which is a specific time value, such as January 1, 2020, 10:20:30, etc. It can also be other values ​​related to time attributes, such as the frequency of occurrence of events specified by the node in a certain time attribute, the amount of resources allocated according to the time attribute, and other quantitative attribute values.

[0100] Figure 8 A schematic diagram of a timing analysis configuration interface in an application scenario provided for one or more embodiments of this specification; the timing analysis configuration interface is displayed in the front end, and the interface can be displayed in the right area of ​​the front end similarly to the graph pattern matching interface. In order to meet the different requirements of data structure and attribute names in different scenarios, users can select the time attribute name in the graph data in the timing analysis configuration interface (for example, Figure 8 The payment date payDate in the , and the quantity attribute name (for example, Figure 8 If the user has not configured it, some fields in the graph data can be automatically recommended as the time attribute name and quantity attribute name.

[0101] By using the time attribute name and quantity attribute name selected by the user, the time attribute and quantity attribute of the edge can be analyzed in the graph data to find the value of the time attribute that matches the selected time attribute name and the value of the quantity attribute that matches the quantity attribute name in the graph data.

[0102] Furthermore, for the value of a quantity attribute, it may be difficult to quickly and intuitively reflect its actual meaning only through numbers. Based on this, Figure 8As shown, in the timing analysis configuration interface, there is a button for "Map edge thickness by quantity attribute". If the user checks this button, when displaying nodes and edges, the elements with quantity attributes in the graph data will be displayed in the edges of the graph data with different thicknesses according to the values ​​of their own quantity attributes.

[0103] Fig. 9 A schematic diagram of a timing analysis effect in an application scenario provided for one or more embodiments of the present specification allows users to quickly and intuitively see that the width of the edge of the "protagonist" marked with "2" in the middle is the thickest, while the width of the edges of the "protagonists" marked with "1" and "5" on both sides is the thinnest. Therefore, even if the value of the corresponding quantitative attribute is not marked in the edge, the user can intuitively determine the value in the graph data, thereby improving the user experience.

[0104] S704: Generate hierarchical layout information of each of the nodes and sequence number information of each of the edges according to the timing information.

[0105] The hierarchical layout information mainly reflects the hierarchical relationship between nodes. The hierarchical relationship usually refers to the superior-subordinate relationship between nodes, for example, Figure 8 As shown in , the root node is the movie node corresponding to a movie "X-Men2", which has the highest level of hierarchy, while the movie's "movie director", "movie production country", "movie production company" and other nodes belong to the nodes of the next level of the movie node, respectively, and are connected to the root node through edges.

[0106] The sequence number information indicates the time sequence of each edge in the time series information. The smaller the sequence number, the earlier the time attribute corresponding to the edge. Figure 8 As shown in the figure, in addition to "Map edge thickness by quantity attribute", the user can also configure whether to "sort by time attribute from 0 to N". If the user checks this button, the final result is as follows Fig. 9 As shown, the screenwriter marked with "0" is first determined to be the main creative staff of a certain movie, and then the leading actor marked with "1" is determined to be the actor of the movie. Therefore, the serial number information corresponding to each edge is finally determined in sequence according to the time series information, making the display interface of the graph data more intuitive and easy to understand.

[0107] S706: Based on the hierarchical layout information and the sequence number information, the front end displays the nodes in the graph data hierarchically and displays the edges in the graph data with sequence numbers, wherein the sequence numbers indicate the corresponding time sequence.

[0108] Hierarchical display means that the timing information can be displayed in a display interface in a form different from the traditional form, and the user can obtain the timing information more intuitively.

[0109] By analyzing the time series information, we can obtain the hierarchical layout information and serial number information, and display the nodes and edges in the graph data in a hierarchical manner, so that users can more intuitively obtain the relevant content of the time series information. Compared with the traditional first method, the time information text is no longer directly marked on the elements in the graph data, which can effectively save the screen canvas space, prevent the visual confusion caused by too long and too much text, and have stronger readability and analyzability, which is conducive to further summarizing and analyzing the deeper results brought by the time series information.

[0110] In one or more embodiments of the present specification, the edges in the graph data are directed edges, which can point to the temporal sequence relationship between nodes to facilitate temporal analysis.

[0111] The earliest node or the earliest starting point of the edge in the graph data will be marked as the starting point node, representing the starting point in the time series network; all nodes without outgoing edges will be marked as end nodes, representing the end point in the time series network, such as Fig. 9 As shown in the figure, you can mark "start" in the starting node and "end" in the ending node, so that users can quickly understand whether the node is a starting node or an ending node. There will be a corresponding directed edge between each ending node and the starting node to connect them in series, forming several directed paths.

[0112] The node levels are divided based on the directed path, with the starting node as the first node level, and then other nodes are divided based on the distance between them and the starting node. The farther the distance is, the later the node level is. This allows the node levels to be divided more quickly and clearly. Of course, all nodes in the same directed path can also be divided into the same node level. Based on the different needs of users, the node levels are divided in different ways.

[0113] Furthermore, if Figure 8 As shown, when performing timing analysis, not only can corresponding attributes be selected, but different edges can also be grouped to further improve the intuitiveness of the timing analysis display.

[0114] In each directed path, multiple upstream edges of a specified edge are determined, where the specified edge is an edge selected by the user or an edge selected by default, and the upstream edge represents an edge with earlier timing information. According to the current scene and the value of the time attribute, a target upstream edge is selected from the multiple upstream edges. If the quantity attribute of the target upstream edge is sufficient to allocate the quantity attribute corresponding to the specified edge, they are divided into the same group and displayed in the same style, for example, in the same color and the same line. In addition, different groups are displayed in different styles.

[0115] Among them, Figure 8As shown, in the timing analysis configuration interface displayed to the user, there are multiple ways to select the target upstream edge, such as grouping by first-in-first-out, grouping by first-in-last-out, grouping by custom attributes, grouping by capital coloring, etc., and grouping is performed in different ways according to the user's selection operation. In the first-in-first-out grouping, for an edge, it is tended to be considered as the same group as the earliest upstream edge, and the quantity attribute value surplus of the upstream edge is sufficient to allocate the quantity attribute value of the current edge. Until the quantity attribute value of the earliest upstream edge is allocated, the second earliest upstream edge is searched as the same group. By analogy, if there is no upstream edge that meets the conditions, it is an independent group. The downstream edge is similarly searched for the same group edge. In the first-in-last-out grouping, for an edge, it is tended to be considered as the same group as the most recent upstream edge, and the quantity attribute value surplus of the upstream edge is sufficient to allocate the quantity attribute value of the current edge. Until the quantity attribute value of the most recent upstream edge is allocated, the second most recent upstream edge is searched as the same group. By analogy, if there is no upstream edge that meets the conditions, it is an independent group. The downstream edge is similarly searched for the same group edge. The downstream edges are then searched for the same group of edges in the same way. In grouping by custom attributes, edges with the same attribute value are grouped together according to the edge attribute name specified by the user. In grouping by fund color, funds are grouped according to their different sources, uses, etc.

[0116] In one or more embodiments of this specification, Figure 8 As shown, an interactive timeline (hereinafter referred to as the timeline) will be displayed below the graph data, allowing users to interactively filter the graph data based on time attributes. The time range and single time point can be switched using the selector below the timeline. Users can drag on the timeline to select time, or click the play / pause button on the timeline to automatically play and pause.

[0117] Specifically, users can perform time-specified operations through the timeline. Time-specified operations refer to users filtering time points or time ranges in the timeline. After users filter time points or time ranges, they can filter out edges that match them from the edges in the graph data (for example, by checking whether the time attribute of the edge contains, is contained by, or intersects with the time range or time point, and if so, it is considered to be in compliance), and then display them prominently to attract users' attention.

[0118] Fig.10 and Fig.11 A schematic diagram of filtering time ranges and time points on an interactive timeline in an application scenario is provided for one or more embodiments of this specification. Fig.10 In the example, the user selected the time range of 10:07:49-11:59:19. There are six edges that match this time range. The other edges are hidden, so the six edges that match this time range are displayed prominently. Fig.11The time point 16:06:39 is selected. Only four edges match this time point, and the other edges are hidden.

[0119] In one or more embodiments of this specification, Fig.12 and Fig.13 A schematic diagram of a list analysis interface and a chart analysis interface of an analysis result interface in an application scenario provided for one or more embodiments of this specification. The analysis result interface will also be displayed below the timing analysis configuration interface, which can be presented in two ways: table and chart, corresponding to the "result list" and "statistical chart" in the figure respectively.

[0120] After the analysis results are displayed, if the user performs a statistical operation, in the list analysis interface, the user can use a column as the basis for sorting. When the mouse enters a row, the corresponding element on the graph data will be displayed prominently (for example, highlighted). In the chart analysis interface, the column data (for example, Fig.13 )

[0121] There is also a download icon in the upper right corner of the analysis results. Users can click this icon to download the current analysis results list, which can be a CSV file, JSON file, or other data files in an adaptable format. There is a reset button in the upper right corner of the timing analysis configuration interface. Users can click this button to clear the impact of the timing analysis tool on the canvas with one click.

[0122] Compared with the traditional second method, it not only provides functions such as timeline filtering and playback, but also can automatically calculate and analyze more time-series related information; it can combine quantitative attributes for multi-dimensional joint analysis; it can perform reasonable visual mapping based on time attributes and quantitative attributes to produce more intuitive visualization results; it can provide a variety of result display methods to provide users with more perspectives.

[0123] Fig.14 A flowchart of a graph data processing method based on time series information in an application scenario provided for one or more embodiments of this specification; after the user starts to query data, the time attribute name and quantity attribute name are configured in the time series analysis interface, or the automatically recommended attribute name can be used to perform time series analysis. And it is displayed by mapping the edge thickness by quantity attribute, sorting from 0 to N by time attribute, time axis, result list, statistical chart, etc.

[0124] Based on the same idea, one or more embodiments of this specification also provide devices and apparatuses corresponding to the above methods, such as Figure 15-16 shown.

[0125] Fig.15A schematic diagram of the structure of a graph data processing device based on a graph mode provided for one or more embodiments of this specification, wherein the graph data includes a plurality of nodes and edges between the nodes, and the device includes:

[0126] A front-end display module 1502 displays the graph data and a configuration interface for configuring a graph mode on the front-end, wherein the graph mode is used to specify a sub-graph structure;

[0127] The editing module 1504 receives the user's editing operation of adding nodes and edges through the configuration interface;

[0128] A first generating module 1506 generates a target graph mode in response to the editing operation;

[0129] A matching module 1508, matching the graph data according to the target graph pattern to obtain a subgraph in the graph data that matches the target graph pattern;

[0130] The prominent display module 1510 prominently displays the area where the sub-image is located in the image data displayed by the front end so as to attract the user's attention.

[0131] Optionally, the front-end display module 1502 obtains the time sequence information of the nodes and edges in the graph data;

[0132] Generate hierarchical layout information of each of the nodes and sequence number information of each of the edges according to the timing information;

[0133] According to the hierarchical layout information and the serial number information, the nodes in the graph data are displayed hierarchically and the edges in the graph data are displayed with serial numbers at the front end, and the hierarchy and the serial number indicate the corresponding time sequence.

[0134] Optionally, the editing module 1504 enters a mode editor provided by the configuration interface;

[0135] In the pattern editor, receiving a first editing operation of adding a node by a user, wherein the first editing operation includes specifying a type and / or attribute condition for the added node, and

[0136] After the newly added nodes are determined, a second editing operation of adding an edge between the newly added nodes is received from the user, and the second editing operation includes specifying a type and / or attribute condition for the added edge.

[0137] Optionally, it also includes:

[0138] The clone mode module 1512 determines whether the user has selected a create mode or a clone mode;

[0139] If the user selects the clone mode, one or more existing graph modes are displayed in the clone mode, and the user's selection operation on the existing graph mode is received, so that the target graph mode can be edited according to the graph mode selected by the user.

[0140] Fig.16 A schematic diagram of a structure of a graph data processing device based on time series information provided for one or more embodiments of this specification, wherein the graph data includes a plurality of nodes and edges between the nodes, and the device includes:

[0141] An acquisition module 1602 is configured to acquire time sequence information of edges in the graph data;

[0142] A second generating module 1604 generates hierarchical layout information of each of the nodes and sequence number information of each of the edges according to the timing information;

[0143] The hierarchical display module 1606 displays the nodes in the graph data hierarchically and displays the edges in the graph data with serial numbers at the front end according to the hierarchical layout information and the serial number information, and the serial numbers indicate the corresponding time sequence.

[0144] Optionally, the timing information includes a value of a time attribute and a value of a quantity attribute related to the time attribute;

[0145] The acquisition module 1602 displays a timing analysis configuration interface on the front end;

[0146] Receiving a selection operation of a time attribute and a quantity attribute through the timing analysis configuration interface;

[0147] According to the selection operation, the value of the time attribute and the value of the quantity attribute of the edge in the graph data are obtained.

[0148] Optionally, the hierarchical display module 1606 displays the edges in the graph data with corresponding thickness according to the value of the quantity attribute.

[0149] Optionally, the edges in the graph data are directed edges;

[0150] The hierarchical display module 1606 determines a starting node and an end node among the nodes in the graph data according to the direction of the edge in the graph data;

[0151] Divide the node hierarchy accordingly according to the directed path formed by the directed edges between the starting node and the end node;

[0152] According to the node hierarchy, the nodes in the graph data are displayed on the front end.

[0153] Optionally, the timing information includes a value of a time attribute and a value of a quantity attribute related to the time attribute;

[0154] The hierarchical display module 1606 determines, according to the directed path, a plurality of upstream edges of a designated edge in the directed path;

[0155] Selecting a target upstream edge from among the multiple upstream edges according to the current scene and the value of the time attribute;

[0156] According to the value of the quantity attribute, determining whether the value of the quantity attribute of the target upstream edge is sufficient to be allocated to the value of the corresponding quantity attribute of the designated edge;

[0157] If so, the target upstream edge and the designated edge are grouped into the same group, and the edges in the same group are displayed in the same style, and the edges in different groups are displayed in different styles.

[0158] Optionally, it also includes:

[0159] Analysis configuration display module 1608, displays the timing analysis configuration interface on the front end;

[0160] Receiving a selection operation of an edge grouping method through the timing analysis configuration interface;

[0161] The hierarchical display module 1606 selects the earliest upstream edge as the target upstream edge, or selects the latest upstream edge as the target upstream edge according to the selection operation.

[0162] Optionally, the hierarchical display module 1606 displays an interactive timeline;

[0163] Receiving a time-specified operation via the interactive timeline;

[0164] According to the time point or time range specified by the time designation operation, corresponding edges are selected from the edges in the graph data for prominent display so as to facilitate the user's attention.

[0165] Optionally, the hierarchical display module 1606 displays an analysis result interface in the time series analysis configuration interface, and the analysis result interface includes a list analysis interface and / or a chart analysis interface;

[0166] Receiving a statistical designation operation via the analysis result interface;

[0167] According to the statistical designation operation, in the list analysis interface, the column data corresponding to the statistical designation operation is sorted, and the row data corresponding to the statistical designation operation is prominently displayed in the graph data, and,

[0168] In the chart analysis interface, the column data corresponding to the statistical specified operation is prominently displayed in the form of a chart.

[0169] One or more embodiments of the present specification provide a graph data processing device based on a graph mode, wherein the graph data includes a plurality of nodes and edges between the nodes, and the device includes:

[0170] at least one processor; and,

[0171] a memory communicatively connected to the at least one processor; wherein,

[0172] The memory stores instructions executable by the at least one processor, the instructions being executed by the at least one processor to enable the at least one processor to:

[0173] Displaying the graph data and a configuration interface for configuring a graph mode on a front end, wherein the graph mode is used to specify a subgraph structure;

[0174] Accepting user editing operations of adding nodes and edges through the configuration interface;

[0175] In response to the editing operation, generating a target graph mode;

[0176] Matching the graph data according to the target graph pattern to obtain a subgraph in the graph data that matches the target graph pattern;

[0177] In the graph data displayed on the front end, the area where the sub-graph is located is prominently displayed so as to attract the user's attention.

[0178] One or more embodiments of the present specification provide a graph data processing device based on time series information, wherein the graph data includes a plurality of nodes and edges between the nodes, and the device includes:

[0179] at least one processor; and,

[0180] a memory communicatively connected to the at least one processor; wherein,

[0181] The memory stores instructions executable by the at least one processor, the instructions being executed by the at least one processor to enable the at least one processor to:

[0182] Obtaining time sequence information of edges in the graph data;

[0183] Generate hierarchical layout information of each of the nodes and sequence number information of each of the edges according to the timing information;

[0184] According to the hierarchical layout information and the serial number information, the nodes in the graph data are displayed hierarchically at the front end, and the edges in the graph data are displayed with serial numbers, and the serial numbers indicate the corresponding time sequence.

[0185] Based on the same idea, one or more embodiments of this specification also provide a non-volatile computer storage medium corresponding to the above method, storing computer executable instructions, wherein the computer executable instructions are configured as follows:

[0186] Displaying the graph data and a configuration interface for configuring a graph mode on a front end, wherein the graph mode is used to specify a subgraph structure;

[0187] Accepting user editing operations of adding nodes and edges through the configuration interface;

[0188] In response to the editing operation, generating a target graph mode;

[0189] Matching the graph data according to the target graph pattern to obtain a subgraph in the graph data that matches the target graph pattern;

[0190] In the graph data displayed on the front end, the area where the sub-graph is located is prominently displayed so as to attract the user's attention.

[0191] Based on the same idea, one or more embodiments of this specification also provide a non-volatile computer storage medium corresponding to the above method, storing computer executable instructions, wherein the computer executable instructions are configured as follows:

[0192] Obtaining time sequence information of edges in the graph data;

[0193] Generate hierarchical layout information of each of the nodes and sequence number information of each of the edges according to the timing information;

[0194] According to the hierarchical layout information and the serial number information, the nodes in the graph data are displayed hierarchically at the front end, and the edges in the graph data are displayed with serial numbers, and the serial numbers indicate the corresponding time sequence.

[0195] The above description is only one or more embodiments of this specification and is not intended to limit this specification. For those skilled in the art, one or more embodiments of this specification may have various changes and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of one or more embodiments of this specification shall be included in the scope of the claims of this specification.

Claims

1. A method for processing graph data, wherein the graph data includes a plurality of nodes and edges between the nodes, the method comprising: Obtaining time sequence information of edges in the graph data; Generate hierarchical layout information of each of the nodes and sequence number information of each of the edges according to the timing information; According to the hierarchical layout information and the sequence number information, the nodes in the graph data are displayed hierarchically at the front end, and the edges in the graph data are displayed with sequence numbers, wherein the sequence numbers indicate the corresponding time sequence; The edges in the graph data are directed edges; The step of displaying the nodes in the graph data in a hierarchical manner on the front end specifically includes: Determine a starting point node and an end point node among the nodes in the graph data according to the direction of the edge in the graph data; Divide the node hierarchy accordingly according to the directed path formed by the directed edges between the starting node and the end node; Displaying nodes in the graph data on the front end according to the node hierarchy; The time series information includes a value of a time attribute and a value of a quantity attribute related to the time attribute; The step of displaying the nodes in the graph data hierarchically and displaying the edges in the graph data in sequence at the front end specifically includes: According to the directed path, determining a plurality of upstream edges of a designated edge in the directed path; Selecting a target upstream edge from among the multiple upstream edges according to the current scene and the value of the time attribute; According to the value of the quantity attribute, determining whether the value of the quantity attribute of the target upstream edge is sufficient to be allocated to the value of the corresponding quantity attribute of the designated edge; If so, the target upstream edge and the designated edge are grouped into the same group, and the edges in the same group are displayed in the same style, and the edges in different groups are displayed in different styles.

2. The method according to claim 1, wherein the time series information comprises a value of a time attribute and a value of a quantity attribute related to the time attribute; The acquiring the time sequence information of the edges in the graph data specifically includes: Display the timing analysis configuration interface on the front end; Receiving a selection operation of a time attribute and a quantity attribute through the timing analysis configuration interface; According to the selection operation, the value of the time attribute and the value of the quantity attribute of the edge in the graph data are obtained.

3. The method according to claim 2, wherein the front end displays the nodes in the graph data hierarchically and displays the edges in the graph data in sequence, specifically comprising: According to the value of the quantity attribute, the edges in the graph data are displayed with corresponding thickness.

4. The method according to claim 1, before displaying the edges in the graph data in order, the method further comprises: Display the timing analysis configuration interface on the front end; Receiving a selection operation of an edge grouping method through the timing analysis configuration interface; The selecting of the target upstream edge specifically includes: According to the selection operation, the earliest upstream edge is selected as the target upstream edge, or the latest upstream edge is selected as the target upstream edge.

5. The method according to claim 1, wherein the front end displays the nodes in the graph data hierarchically and displays the edges in the graph data in sequence, specifically comprising: Show interactive timeline; Receiving a time-specified operation via the interactive timeline; According to the time point or time range specified by the time designation operation, corresponding edges are selected from the edges in the graph data for prominent display so as to facilitate user attention.

6. The method according to claim 2, wherein the front end displays the nodes in the graph data hierarchically and displays the edges in the graph data in sequence, specifically comprising: Displaying an analysis result interface in the timing analysis configuration interface, wherein the analysis result interface includes a list analysis interface and / or a chart analysis interface; Receiving a statistical designation operation via the analysis result interface; According to the statistical designation operation, in the list analysis interface, the column data corresponding to the statistical designation operation is sorted, and the row data corresponding to the statistical designation operation is prominently displayed in the graph data, and, In the chart analysis interface, the column data corresponding to the statistical specified operation is prominently displayed in the form of a chart.

7. A graph data processing device, wherein the graph data includes a plurality of nodes and edges between the nodes, the device comprising: An acquisition module, which acquires the time sequence information of the edges in the graph data; A second generating module generates hierarchical layout information of each of the nodes and sequence number information of each of the edges according to the timing information; A hierarchical display module, which displays the nodes in the graph data hierarchically and displays the edges in the graph data with serial numbers at the front end according to the hierarchical layout information and the serial number information, wherein the serial numbers indicate the corresponding time sequence; The edges in the graph data are directed edges; The step of displaying the nodes in the graph data in a hierarchical manner on the front end specifically includes: Determine a starting point node and an end point node among the nodes in the graph data according to the direction of the edge in the graph data; Divide the node hierarchy accordingly according to the directed path formed by the directed edges between the starting node and the end node; Displaying nodes in the graph data on the front end according to the node hierarchy; The time series information includes a value of a time attribute and a value of a quantity attribute related to the time attribute; The step of displaying the nodes in the graph data hierarchically and displaying the edges in the graph data in sequence at the front end specifically includes: According to the directed path, determining a plurality of upstream edges of a designated edge in the directed path; Selecting a target upstream edge from among the multiple upstream edges according to the current scene and the value of the time attribute; According to the value of the quantity attribute, determining whether the value of the quantity attribute of the target upstream edge is sufficient to be allocated to the value of the corresponding quantity attribute of the designated edge; If so, the target upstream edge and the designated edge are grouped into the same group, and the edges in the same group are displayed in the same style, and the edges in different groups are displayed in different styles.

8. A graph data processing device, wherein the graph data includes a plurality of nodes and edges between the nodes, the device comprising: at least one processor; as well as, a memory communicatively connected to the at least one processor; wherein, The memory stores instructions executable by the at least one processor, the instructions being executed by the at least one processor to enable the at least one processor to: Obtaining time sequence information of edges in the graph data; Generate hierarchical layout information of each of the nodes and sequence number information of each of the edges according to the timing information; According to the hierarchical layout information and the sequence number information, the nodes in the graph data are displayed hierarchically at the front end, and the edges in the graph data are displayed with sequence numbers, wherein the sequence numbers indicate the corresponding time sequence; The edges in the graph data are directed edges; The step of displaying the nodes in the graph data in a hierarchical manner on the front end specifically includes: Determine a starting point node and an end point node among the nodes in the graph data according to the direction of the edge in the graph data; Divide the node hierarchy accordingly according to the directed path formed by the directed edges between the starting node and the end node; Displaying nodes in the graph data on the front end according to the node hierarchy; The time series information includes a value of a time attribute and a value of a quantity attribute related to the time attribute; The step of displaying the nodes in the graph data hierarchically and displaying the edges in the graph data in sequence at the front end specifically includes: According to the directed path, determining a plurality of upstream edges of a designated edge in the directed path; Selecting a target upstream edge from among the multiple upstream edges according to the current scene and the value of the time attribute; According to the value of the quantity attribute, determining whether the value of the quantity attribute of the target upstream edge is sufficient to be allocated to the value of the corresponding quantity attribute of the designated edge; If so, the target upstream edge and the designated edge are grouped into the same group, and the edges in the same group are displayed in the same style, and the edges in different groups are displayed in different styles.

Citation Information

Patent Citations

  • Subgraph recognition method and device

    CN111611419A

  • Interactive layered visualization of a layered software architecture

    US20120054714A1