A relational data chart display method, device and electronic equipment

Abstract

The application discloses a kind of relational data chart display method, device and electronic equipment, relate to data processing field, solve the existing chart display method when using need according to the type of chart in advance definition data structure, its technical scheme main point is: receiving target data to be shown, wherein the target data includes node and node relationship, node relationship is formed by the interaction record of node generation;Node relationship is sorted, and the ordered array corresponding to node relationship is obtained;The preset node shows reference amount, when the node data amount corresponding to ordered array is less than or equal to the display reference amount, ordered array is matched with chart layout set, and the matching score of different chart layout in chart layout set is obtained;The highest chart layout of matching score is selected to visualize the target data and show.The application adaptively selects the optimal chart display according to data structure, optimizes the relationship between data logic and can select the optimal chart layout.

Description

Technical Field

[0001] This invention relates to the field of data processing, and more specifically, to a method, apparatus, and electronic device for graphical display of relational data. Background Technology

[0002] Charts are widely used because they can intuitively and vividly display data attributes.

[0003] Existing data visualization chart adaptive display methods can be roughly divided into three categories: (1) adaptive layout based on user historical behavior preferences; (2) adaptive layout based on traditional basic graphics; and (3) optimization algorithms for the process of processing raw data into chart data. These three algorithms respectively recommend layouts based on a large number of users' historical selections, recommend simple charts such as bar charts, line charts, and pie charts based on a small amount of data from a one-dimensional array, and process data based on specified charts to adapt to the display of the charts.

[0004] Existing chart display methods require pre-defining the data structure based on the chart type, which results in overlapping areas and obscured logical relationships when the chart content is displayed, leading to incomplete data display. Summary of the Invention

[0005] This invention addresses the problem that existing chart display methods require pre-defining the data structure based on the chart type. It provides a chart display method, device, and electronic device for relational data. This invention adaptively selects the optimal chart display based on the data structure, optimizing the display of relationships between data logic. Especially when displaying large amounts of data, it can select the optimal chart layout, avoiding overlapping chart content and obscuring logical relationships, facilitating complete data display, and more clearly expressing the relationships between data.

[0006] The above-mentioned technical objective of the present invention is achieved through the following technical solution:

[0007] In a first aspect, the present invention provides a method for graphically displaying relational data, the method comprising:

[0008] Receive the target data to be displayed, which includes nodes and node relationships, and the node relationships are formed by the interaction records generated by the nodes;

[0009] Sort the node relationships to obtain an ordered array corresponding to the node relationships;

[0010] The preset display reference value for nodes is used. When the data volume of the nodes corresponding to the ordered array is less than or equal to the display reference value, the ordered array is matched with the chart layout set to obtain the matching score of different chart layouts in the chart layout set.

[0011] Choose the chart layout with the highest matching score to visualize the target data.

[0012] This invention processes the received target data into two data structures: nodes and node relationships. It's important to understand that each interaction record generated by a node adds a relationship, which is the node relationship, and the total number of node relationships is one. Therefore, the sorting of node relationships is based on the number of interaction records generated by the node data to form node relationships. Thus, the ordered data of the sorted result is an ordered array corresponding to the number of node relationships. Correspondingly, when displaying charts on a terminal device, the display is affected by the device's own parameters. Therefore, a preset display reference number of nodes is used to filter out large amounts of target data. For the data itself, during display, only the main interaction relationships are shown, i.e., nodes with frequent interaction records, while node relationships with few interaction records can be optimized out to more clearly show the logical relationships between data. The ordered array that meets the display reference number is matched with the existing chart layout set. It's important to understand that the matching process is based on the interaction records of node relationships, so as to adaptively select the optimal chart display based on the two data structures in the ordered array to obtain the best display effect.

[0013] In one implementation, the node relationships are sorted to obtain an ordered array corresponding to the node relationships, specifically:

[0014] Sort the nodes according to the frequency of unidirectional and / or bidirectional flow to obtain an ordered array corresponding to the node relationships.

[0015] In one implementation scheme, the preset reference value for displaying nodes is specifically:

[0016] Obtain the monitor's resolution and the computer's configuration parameters;

[0017] The display reference value of the node is determined based on the resolution and configuration parameters.

[0018] In one embodiment, the method further includes:

[0019] When the amount of node data corresponding to the ordered array is greater than the display reference amount, a first partition value is preset, and the ordered array is divided according to the first partition value to obtain a first array and a second array. The first array represents the main nodes in the ordered array that correspond to the main node relationship, and the second array represents the secondary nodes in the ordered array that correspond to the secondary node relationship.

[0020] Data aggregation is performed on the corresponding node relationships in the second array to obtain the aggregated second array;

[0021] If the amount of data in the sorted array corresponding to the aggregated second array is greater than the display reference amount, then continue to aggregate the data in the second array until the amount of data in the sorted array is less than or equal to the display reference amount.

[0022] Match the ordered array that meets the display reference quantity with the set of chart layouts to obtain the matching score for different chart layouts;

[0023] Choose the chart layout with the highest matching score to visualize the target data.

[0024] In one implementation, data aggregation processing is performed on the corresponding node relationships of the second array to obtain an aggregated second array, including:

[0025] Mark at least one interaction record corresponding to a secondary node as hidden;

[0026] Aggregate secondary nodes with the same hidden tag into a single secondary node.

[0027] In one implementation, the method further includes matching the ordered array with the chart layout set before:

[0028] Create a set of chart layouts to display the target data. The chart layout set includes rectangular layout, tiled layout, horizontal and vertical layout, grid layout, circle layout, ring layout, radial layout, sphere layout, group layout, directional layout, radial layout, force-oriented layout, progressive force-oriented layout, hierarchical layout, and tree layout.

[0029] In one implementation, after establishing a set of chart layouts to display the target data, the method further includes:

[0030] The number of groups is determined by dividing the total number of node relationships in the aggregated ordered array by the number of primary node relationships; secondary node relationships and secondary nodes are then grouped according to the number of groups.

[0031] In one implementation, matching scores for different chart layouts are obtained, specifically as follows:

[0032] Based on the primary node relationships, the number of primary and secondary node relationship groups, the number of secondary node groups, and the total data volume of the nodes in the aggregated ordered array, the chart layouts in the chart layout set are matched to the corresponding range of quantities that can be displayed, and the matching score of different chart layouts is obtained. The deviation from the center value of the quantity range is used as the matching score.

[0033] Secondly, the present invention provides a chart display device for relational data, comprising:

[0034] The data receiving module is used to receive target data to be displayed, which includes nodes and node relationships. The node relationships are formed by the interaction records generated by the nodes.

[0035] The sorting module is used to sort the node relationships and obtain an ordered array corresponding to the node relationships;

[0036] The chart matching module is used to preset the display reference value of nodes. When the data value of the node corresponding to the ordered array is less than or equal to the display reference value, the ordered array is matched with the chart layout set to obtain the matching score of different chart layouts in the chart layout set.

[0037] The chart display module is used to select the chart layout with the highest matching score to visualize the target data.

[0038] Thirdly, the present invention provides an electronic device including a processor and a memory storing a computer program, wherein the processor executes the computer program to implement the steps of the method described in the first aspect.

[0039] Compared with the prior art, the present invention has the following beneficial effects:

[0040] This invention processes the received target data into two data structures: nodes and node relationships. It's important to understand that each interaction record generated by a node adds a relationship, which is the node relationship, and the total number of node relationships is one. Therefore, the sorting of node relationships is based on the number of interaction records generated by the node data to form node relationships. Thus, the ordered data of the sorted result is an ordered array corresponding to the number of node relationships. Correspondingly, when displaying charts on a terminal device, the display is affected by the device's own parameters. Therefore, a preset display reference number of nodes is used to filter out large amounts of target data. For the data itself, during display, only the main interaction relationships are shown, i.e., nodes with frequent interaction records, while node relationships with few interaction records can be optimized out to more clearly show the logical relationships between data. The ordered array that meets the display reference number is matched with the existing chart layout set. It's important to understand that the matching process is based on the interaction records of node relationships, so as to adaptively select the optimal chart display based on the two data structures in the ordered array to obtain the best display effect. Attached Figure Description

[0041] The accompanying drawings, which are included to provide a further understanding of embodiments of the invention and form part of this application, do not constitute a limitation thereof. In the drawings:

[0042] Figure 1A flowchart illustrating a method for displaying relational data in a chart, as provided in an embodiment of the present invention;

[0043] Figure 2 A flowchart illustrating the display reference quantity of a preset node provided in an embodiment of the present invention;

[0044] Figure 3 A flowchart illustrating another type of relational data chart display provided by an embodiment of the present invention;

[0045] Figure 4 This is a schematic block diagram of a device for displaying charts provided in an embodiment of the present invention. Detailed Implementation

[0046] To make the objectives, technical solutions, and advantages of the present invention clearer, the present invention will be further described in detail below with reference to the embodiments and accompanying drawings. The illustrative embodiments and descriptions of the present invention are only used to explain the present invention and are not intended to limit the present invention.

[0047] It should be understood that the terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of technical features indicated. Therefore, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature. In the description of this invention, "a plurality of" means two or more, unless otherwise explicitly specified.

[0048] In this application embodiment, the current chart display method requires pre-defining the data structure according to the chart type, resulting in overlapping areas and obscuring of logical relationships during chart display, leading to incomplete data display. This application embodiment proposes a chart display method for relational data, which is applied to a terminal device on which a chart display device runs, such as... Figure 4 The chart display apparatus described in the illustrated embodiment receives target data to be displayed, wherein the target data includes nodes and node relationships, and the node relationships are formed by the interaction records generated by the nodes; sorts the node relationships to obtain an ordered array corresponding to the node relationships; presets a display reference value for the nodes; when the node data volume corresponding to the ordered array is less than or equal to the display reference value, matches the ordered array with a set of chart layouts to obtain matching scores for different chart layouts in the set; and selects the chart layout with the highest matching score to visualize the target data. This adaptively selects the optimal chart display based on the data structure, optimizing the display of the relationships between data logic. Especially when displaying large amounts of data, it can select the optimal chart layout, avoiding overlapping chart content and obscuring logical relationships, facilitating complete data display, and more clearly expressing the relationships between data.

[0049] For example, mobile phones, personal computers, tablets, game consoles, and information processing centers can all be considered terminal devices. These terminal devices can also be called user devices, and also include cloud servers. The terminal device connects to the cloud server via wireless communication. This wireless communication method includes, but is not limited to, Bluetooth, Wi-Fi, ZigBee, GPRS, 3G, 4G, 5G, and WiMAX.

[0050] The aforementioned cloud server, acting as an information hub, receives, processes, and stores user information. Users send information retrieval commands to the cloud server via the aforementioned terminal devices. Upon receiving the command, the cloud server sends the corresponding information to the terminal devices. The terminal devices receive the information and display it as charts for the user to view.

[0051] In light of the above implementation environment, see Figure 1 The embodiment shown provides a method for displaying charts. The specific flow of the method provided in this embodiment is as follows:

[0052] S101, Receive the target data to be displayed, wherein the target data includes nodes and node relationships, and the node relationships are formed by the interaction records generated by the nodes.

[0053] Specifically, the system receives target data to be displayed. For example, target data can be user transaction data generated at a bank, or chat data between users in WeChat Work—any data that generates interaction records can be considered target data. For instance, for the initially acquired user transaction data at the bank, based on the transaction data information, the remitter, recipient, and associated assets such as phone numbers and housing data are all set as nodes. The flow of funds between the remitter and recipient, and the flow of mortgaged properties are called relationships and set as node relationships. This process transforms the original target data into two data structures: nodes and node relationships.

[0054] A single node's data can generate multiple interaction records. For example, a remitter could be remitter A, remitter B, etc., and the corresponding customer's mobile phone communication records also record the corresponding interaction records. For example, the interaction frequency between customer A and customer B is 10 times. Another example is the fund transfer records between customers; for example, the number of fund transfers made by remitter A to remitter B generates that number of interaction records. Exemplary examples also include customer asset collateral records, such as a customer mortgaging a house to a bank; customer-owned assets, such as houses and cars, such as customer A owning a house, which counts as one record; customer GPS location records, such as customer A being located in MM city, which counts as one record; invitation relationships between customers, such as customer A being a partner referred to the bank by customer B, or some business owners having shareholder, partner, or guarantor relationships; and customers using bank services, such as using pre-approved credit funds.

[0055] S102, sort the node relationships to obtain an ordered array corresponding to the node relationships.

[0056] Specifically, the number of interaction records of node relationships is sorted in ascending or descending order to obtain an ordered array corresponding to the number of interaction records in descending or ascending order.

[0057] S103, preset the display reference value of the node. When the node data value corresponding to the ordered array is less than or equal to the display reference value, the ordered array is matched with the chart layout set to obtain the matching score of different chart layouts in the chart layout set.

[0058] Specifically, considering the impact of terminal device parameter performance, the chart display effect is poor when the target data contains a large amount of node data. Therefore, a reference value for node display is preset when displaying the target data in a chart. For example, there are two scenarios: When the amount of node data in the ordered array is less than the display reference value, the target data can be displayed on the terminal device's display interface (e.g., a computer monitor) with some display margin. When the amount of node data in the ordered array is exactly equal to the display reference value, the target data can be displayed on the terminal device's interface, but the display interface can only show the logical relationships between the nodes in the target data. After meeting the display reference value requirements, the ordered array is matched with a chart layout set. The chart layout set consists of existing layout methods, such as bar charts, column charts, line charts, and pie charts, which are the four most commonly used basic chart types. According to Microsoft Excel's classification of chart types, chart types also include scatter plots, area charts, donut charts, radar charts, bubble charts, stock charts, etc.

[0059] The existing technology is used to calculate the matching score to obtain the matching score with different chart layouts, so no further explanation is needed.

[0060] S104: Select the chart layout with the highest matching score to visualize the target data.

[0061] Specifically, in this embodiment, the chart layout with the highest fitness is selected to visualize the target data. The general approach is to sort the matches in ascending or descending order and take the chart layout corresponding to the first or last match score as the layout for visualizing the target data to achieve the best display effect.

[0062] In summary, this embodiment processes the received target data into two data structures: nodes and node relationships. It's important to understand that each interaction record generated by a node adds a relationship, which is the node relationship, and the number of node relationships is one. Therefore, the sorting of node relationships is based on the number of interaction records generated by the node data to form node relationships. Thus, the ordered data of the sorted result is an ordered array corresponding to the number of node relationships. Correspondingly, when displaying charts on a terminal device, the display is affected by the device's own parameters. Therefore, a preset display reference number of nodes is used to filter the large amount of target data. For the data itself, during display, only the main interaction relationships are shown, i.e., nodes with frequent interaction records, while node relationships with few interaction records can be optimized out to more clearly show the logical relationships between the data. The ordered array that meets the display reference number is matched with the existing chart layout set. It's important to understand that the matching process is based on the interaction records of the node relationships to adaptively select the optimal chart display based on the two data structures in the ordered array, resulting in the best outcome.

[0063] In one implementation, the node relationships are sorted to obtain an ordered array corresponding to the node relationships, specifically:

[0064] Sort the nodes according to the frequency of unidirectional and / or bidirectional flow to obtain an ordered array corresponding to the node relationships.

[0065] Specifically, the flow of nodes can be unidirectional or bidirectional. For example, for financial transaction data, the nodes are sorted in descending or ascending order based on the frequency of unidirectional or bidirectional transactions between remitters, recipients, etc., with nodes having higher transaction frequencies placed at the front or back, resulting in an ordered array.

[0066] In one implementation scheme, such as Figure 2 The diagram shown illustrates a flowchart for displaying reference values ​​for preset nodes.

[0067] S1031, obtain the monitor resolution and computer host configuration parameters.

[0068] Specifically, the optimal display effect and maximum processing effect are affected by resolution and image rendering performance. For a single terminal device, the configured parameters vary. For example, resolution refers to the number of pixels displayed horizontally and vertically on the entire screen. Exemplary resolutions include, but are not limited to, 1920*1080, 1440*900, 1280*800, and 800*600. Computer host configuration parameters include, but are not limited to, 4 cores and 8GB RAM, and 2 cores and 4GB RAM. All these parameters affect the number of charts displayed. Therefore, it is necessary to dynamically preset the reference number of nodes based on the configuration parameters of the currently displayed terminal device. Thus, the display resolution of the currently displayed terminal device and the configuration parameters of the computer host are first read, and the reference number of displays is dynamically determined based on these parameters.

[0069] S1032 determines the display reference value of the node based on the resolution and configuration parameters.

[0070] Specifically, taking a terminal device with a resolution of 1920*1080 and a host configuration of 4 cores and 8GB of RAM as an example, by continuously setting different data amounts through code, the optimal display amount is determined based on the display effect and rendering completion time of the terminal device. It is determined that when the display reference amount is 10000, it is an optimal display state for a terminal device with a resolution of 1920*1080 and a host configuration of 4 cores and 8GB of RAM. Therefore, the display reference amount of 10000 can be used as a configuration number, and this reference amount is the recommended number by default. When the terminal device used by the user is not in accordance with the configuration parameters described in this embodiment, the display reference amount can be adjusted appropriately. For example, if it is lower than the configuration parameter, the display reference amount is reduced; if it is higher than the configuration parameter, the display reference amount is adjusted.

[0071] like Figure 3 As shown in the diagram, this embodiment provides a flowchart illustrating another method for displaying relational data in charts. The specific method flow provided in this embodiment is as follows:

[0072] S201, when the amount of node data corresponding to the ordered array is greater than the display reference amount, a first partition value is preset, and the ordered array is divided according to the first partition value to obtain a first array and a second array. The first array represents the main nodes in the ordered array that correspond to the main node relationship, and the second array represents the secondary nodes in the ordered array that correspond to the secondary node relationship.

[0073] Specifically, for example, if the amount of node data corresponding to the ordered array is greater than the display reference amount, as described in the above embodiments, excessive data will exceed the display capacity of the current terminal device and cannot fully display the logical relationship between the data. Therefore, a first division value is preset to divide the ordered array into primary and secondary relationships. For example, the first division value can be 20% or 1-20%, and can be set to 30% or 1-30% depending on the data considerations. For example, when the ordered array is sorted in descending order, the first 20% of the node relationship data in the ordered array is the primary node relationship, and the last 80% is the secondary node relationship. Or, when the ordered array is sorted in ascending order, the first 80% is the secondary node relationship, and the last 20% is the primary node relationship.

[0074] S202, perform data aggregation processing on the corresponding node relationships of the second array to obtain the aggregated second array.

[0075] Specifically, data aggregation primarily utilizes techniques such as cleaning, analysis, and mining of big data. It involves aggregating data from a second array representing secondary node relationships. For example, in a large dataset requiring analysis, each record generated by a node adds a new relationship. Suppose customer A has 100 interaction records, customer B has 80, customer C has 10, and customer D has 5. After dividing the large dataset using a first partitioning value, the 80 interaction records of customer B, the 10 interaction records of customer C, and the 5 interaction records of customer D are classified as secondary nodes and their relationships. Through data aggregation, for instance, aggregating the 15 interaction records of customers C and D into one interaction record, the overall number of secondary node relationships and secondary nodes in the second array decreases. This means the amount of data in the corresponding ordered array also decreases, ensuring the number of nodes meets the display reference requirements of the terminal device.

[0076] S203, if the amount of data in the ordered array corresponding to the aggregated second array is greater than the display reference amount, then continue to perform data aggregation processing on the second array until the amount of data in the ordered array is less than or equal to the display reference amount.

[0077] In this embodiment, if the amount of data corresponding to the aggregated ordered array is still greater than the display reference amount, data aggregation processing needs to continue until the amount of data corresponding to the ordered array is less than or equal to the display reference amount.

[0078] S204 matches the ordered array that matches the display reference quantity with the chart layout set to obtain the matching score for different chart layouts.

[0079] In this embodiment, how to match with the chart layout set has been explained in the embodiment of step S103 above, so it will not be described again here.

[0080] S205, Select the chart layout with the highest matching score to visualize the target data.

[0081] Similarly, the specific implementation of this step has been explained in the embodiment of step S104, so it will not be described again here.

[0082] In one implementation, data aggregation processing is performed on the corresponding node relationships of the second array to obtain an aggregated second array, including:

[0083] Mark at least one interaction record corresponding to a secondary node with a hidden tag; aggregate secondary nodes with the same hidden tag into one secondary node.

[0084] Specifically, referring to step S202 above, this embodiment provides a detailed explanation of the specific implementation method of data aggregation. Since a secondary node also generates corresponding interaction records, but the number of interaction records is small, all these interaction records are marked with a hidden tag. To determine which interaction records need to be marked with a hidden tag, the secondary node relationships in the second array can be sorted in descending order, and the interaction records of the last 20% of the sorted secondary node relationships can be marked with a hidden tag. This can also be set according to actual needs and is not limited to 20%. After marking, multiple secondary nodes corresponding to secondary node relationships with the same hidden tag are aggregated into one secondary node, thereby reducing the amount of data in the ordered array.

[0085] In one implementation, the method further includes matching the ordered array with the chart layout set before:

[0086] Create a set of chart layouts to display the target data. The chart layout set includes rectangular layout, tiled layout, horizontal and vertical layout, grid layout, circle layout, ring layout, radial layout, sphere layout, group layout, directional layout, radial layout, force-oriented layout, progressive force-oriented layout, hierarchical layout, and tree layout.

[0087] Specifically, before matching the ordered array with the chart layout set, it is necessary to first establish the chart dataset used for display. Existing layout methods include, but are not limited to, rectangular layout, tiling layout, horizontal and vertical layout, grid layout, center-of-circle layout, ring layout, radial layout, sphere-of-sphere layout, grouped layout, directed layout, radial layout, force-directed layout, progressive force-directed layout, hierarchical layout, and tree layout. The layout method can be one or more of the above layout methods.

[0088] In one implementation, after establishing a set of chart layouts to display the target data, the method further includes:

[0089] The number of groups is determined by dividing the total number of node relationships in the aggregated ordered array by the number of primary node relationships; secondary node relationships and secondary nodes are then grouped according to the number of groups.

[0090] Specifically, since secondary node relationships do not primarily indicate the logical relationships between data, after data aggregation, secondary node relationships and secondary nodes within them are grouped separately. Based on the number of secondary node relationships, the nodes on the secondary relationships are grouped according to the result obtained by dividing the total number of node relationships (equal to the number of primary node relationships plus secondary node relationships) by the number of primary node relationships. The secondary relationships are also divided into several groups. This grouping is to facilitate adding special displays and prominent positions to the primary nodes. Furthermore, the grouped secondary node relationships and secondary nodes can be randomly distributed according to the chart layout type, which can match more chart layout types.

[0091] In one implementation, matching scores for different chart layouts are obtained, specifically as follows:

[0092] Based on the primary node relationships, the number of primary and secondary node relationship groups, the number of secondary node groups, and the total data volume of the nodes in the aggregated ordered array, the chart layouts in the chart layout set are matched to the corresponding range of quantities that can be displayed, and the matching score of different chart layouts is obtained. The deviation from the center value of the quantity range is used as the matching score.

[0093] Specifically, in this embodiment, the calculation of the matching score is existing technology, and therefore will not be elaborated further. It should be understood that when matching chart layouts, this application considers the relationships between secondary nodes and their grouping, as well as the relationships between primary and secondary nodes, the primary and secondary nodes, and the total number of nodes in the aggregated ordered array to match the corresponding range of quantities that the chart layout can display. This allows the matched chart layout to more clearly express the relationships between data. Furthermore, based on the data, the nodes within the data, the primary nodes within the data, the relationships between nodes, and the primary relationships between nodes, the most suitable chart layout is adaptively selected, providing an optimal chart display method for data visualization and matching a richer variety of chart layout types.

[0094] Based on the same inventive concept, this embodiment provides a device for displaying charts, since the principle of these devices in solving problems is the same as... Figure 1 or Figure 2 or Figure 3 The method of illustrating this diagram is similar, therefore the implementation of these devices can be found in [reference needed]. Figure 1 or Figure 2 or Figure 3 The embodiments of the methods shown are repeated hereafter.

[0095] See Figure 4 The chart display device includes:

[0096] The data receiving module 400 is used to receive target data to be displayed, wherein the target data includes nodes and node relationships, and the node relationships are formed by the interaction records generated by the nodes.

[0097] The sorting module 410 is used to sort the node relationships to obtain an ordered array corresponding to the node relationships;

[0098] The chart matching module 420 is used to preset the display reference value of the node. When the node data value corresponding to the ordered array is less than or equal to the display reference value, the ordered array is matched with the chart layout set to obtain the matching score of different chart layouts in the chart layout set.

[0099] The chart display module 430 is used to select the chart layout with the highest matching score to visualize the target data.

[0100] In one embodiment, the sorting module 410 is specifically used for:

[0101] Sort the nodes according to the frequency of unidirectional and / or bidirectional flow to obtain an ordered array corresponding to the node relationships.

[0102] In one implementation, the chart matching module 420 is specifically used for:

[0103] Obtain the monitor's resolution and the computer's configuration parameters;

[0104] The display reference value of the node is determined based on the resolution and configuration parameters.

[0105] In one embodiment, the device is also used for:

[0106] When the amount of node data corresponding to the ordered array is greater than the display reference amount, a first partition value is preset, and the ordered array is divided according to the first partition value to obtain a first array and a second array. The first array represents the main nodes in the ordered array that correspond to the main node relationship, and the second array represents the secondary nodes in the ordered array that correspond to the secondary node relationship.

[0107] Data aggregation is performed on the corresponding node relationships in the second array to obtain the aggregated second array;

[0108] If the amount of data in the sorted array corresponding to the aggregated second array is greater than the display reference amount, then continue to aggregate the data in the second array until the amount of data in the sorted array is less than or equal to the display reference amount.

[0109] Match the ordered array that meets the display reference quantity with the set of chart layouts to obtain the matching score for different chart layouts;

[0110] Choose the chart layout with the highest matching score to visualize the target data.

[0111] In one implementation, data aggregation processing is performed on the corresponding node relationships of the second array to obtain an aggregated second array, including:

[0112] Mark at least one interaction record corresponding to a secondary node as hidden;

[0113] Aggregate secondary nodes with the same hidden tag into a single secondary node.

[0114] In one implementation, the method further includes matching the ordered array with the chart layout set before:

[0115] Create a set of chart layouts to display the target data. The chart layout set includes rectangular layout, tiled layout, horizontal and vertical layout, grid layout, circle layout, ring layout, radial layout, sphere layout, group layout, directional layout, radial layout, force-oriented layout, progressive force-oriented layout, hierarchical layout, and tree layout.

[0116] In one implementation, after establishing a set of chart layouts to display the target data, the method further includes:

[0117] The number of groups is determined by dividing the total number of node relationships in the aggregated ordered array by the number of primary node relationships; secondary node relationships and secondary nodes are then grouped according to the number of groups.

[0118] In one implementation, matching scores for different chart layouts are obtained, specifically as follows:

[0119] Based on the primary node relationships, the number of primary and secondary node relationship groups, the number of secondary node groups, and the total data volume of the nodes in the aggregated ordered array, the chart layouts in the chart layout set are matched to the corresponding range of quantities that can be displayed, and the matching score of different chart layouts is obtained. The deviation from the center value of the quantity range is used as the matching score.

[0120] The beneficial effects are as follows: The received target data is processed into two data structures: nodes and node relationships. It's important to understand that each interaction record generated by a node adds a relationship, which is the node relationship, and the number of node relationships is one. Therefore, the sorting of node relationships is based on the number of interaction records generated by the node data to form node relationships. Thus, the ordered data of the sorted result is an ordered array corresponding to the number of node relationships. Correspondingly, when displaying charts on terminal devices, the display is affected by the device's own parameters. Therefore, a preset display reference number of nodes is used to filter out large amounts of target data. For the data itself, the display focuses on the main interaction relationships, i.e., nodes with frequent interaction records, while node relationships with few interaction records can be optimized out to more clearly show the logical relationships between data. The ordered array that meets the display reference number is matched with the existing chart layout set. It's important to understand that the matching process is based on the interaction records of node relationships, so as to adaptively select the optimal chart display based on the two data structures in the ordered array to obtain the best display effect.

[0121] Based on the same inventive concept, this embodiment provides an electronic device, including a processor and a memory storing a computer program, wherein the processor executes the computer program to implement the steps of the method described in the above embodiment.

[0122] The processor can be a general-purpose central processing unit (CPU), a microprocessor, an application-specific integrated circuit (ASIC), or one or more integrated circuits used to control the execution of the above-described program. A communication interface is provided for communication with other devices or communication networks, such as Ethernet, a radio access network (RAN), or a wireless local area network (WLAN). The memory can be a read-only memory (ROM) or other types of static storage devices capable of storing static information and instructions, random access memory (RAM) or other types of dynamic storage devices capable of storing information and instructions, or electrically erasable programmable read-only memory, read-only optical discs or other optical disc storage, optical disc storage (including compressed optical discs, laser discs, optical discs, digital universal optical discs, Blu-ray discs, etc.), magnetic disk storage media, or other magnetic storage devices, or any other medium capable of carrying or storing desired program code in the form of instructions or data structures and accessible by a computer, but not limited to these. The memory can exist independently and be connected to the processor via a bus. The memory can also be integrated with the processor. The memory is used to store the application code for executing the above-described program, and its execution is controlled by the processor. The processor is used to execute the application code stored in the memory. The code stored in the memory can execute the chart-based display method described above, which is performed by the terminal device. For example, it can receive target data to be displayed, where the target data includes nodes and node relationships, and the node relationships are formed by the interaction records generated by the nodes; sort the node relationships to obtain an ordered array corresponding to the node relationships; preset the display reference quantity of the nodes; when the node data quantity corresponding to the ordered array is less than or equal to the display reference quantity, match the ordered array with the chart layout set to obtain the matching score of different chart layouts in the chart layout set; and select the chart layout with the highest matching score to visualize the target data.

[0123] The specific embodiments described above further illustrate the purpose, technical solution, and beneficial effects of the present invention. It should be understood that the above description is only a specific embodiment of the present invention and is not intended to limit the scope of protection of the present invention. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the present invention should be included within the scope of protection of the present invention.

Claims

1. A method for graphically displaying relational data, characterized in that, The methods include: Receive the target data to be displayed, which includes nodes and node relationships, and the node relationships are formed by the interaction records generated by the nodes; Sort the node relationships to obtain an ordered array corresponding to the node relationships; A preset display reference value is used. When the data volume of a node corresponding to an ordered array is less than or equal to the display reference value, the ordered array is matched with a set of chart layouts to obtain matching scores for different chart layouts in the set. Specifically, the preset display reference value is determined by: obtaining the monitor resolution and computer host configuration parameters; determining the display reference value of a node based on the resolution and configuration parameters; when the data volume of a node corresponding to an ordered array is greater than the display reference value, a preset first division value is used to divide the ordered array into a first array and a second array. The first array represents the primary nodes corresponding to primary node relationships in the ordered array, and the second array represents the secondary nodes corresponding to secondary node relationships in the ordered array; data aggregation is performed on the node relationships in the second array to obtain an aggregated second array; if the data volume of the ordered array corresponding to the aggregated second array is greater than the display reference value, data aggregation is continued on the second array until the data volume of the ordered array is less than or equal to the display reference value; the ordered array that meets the display reference value is matched with a set of chart layouts to obtain matching scores for different chart layouts; the chart layout with the highest matching score is selected for visualizing the target data. Choose the chart layout with the highest matching score to visualize the target data.

2. The method according to claim 1, characterized in that, Sort the node relationships to obtain an ordered array corresponding to the node relationships, specifically: Sort the nodes according to the frequency of unidirectional and / or bidirectional flow to obtain an ordered array corresponding to the node relationships.

3. The method according to claim 1, characterized in that, Data aggregation is performed on the corresponding node relationships of the second array to obtain the aggregated second array, which includes: Mark at least one interaction record corresponding to a secondary node as hidden; Aggregate secondary nodes with the same hidden tag into a single secondary node.

4. The method according to claim 1, characterized in that, Before matching the ordered array with the chart layout set, the following is also included: Create a set of chart layouts to display the target data. The chart layout set includes rectangular layout, tiled layout, horizontal and vertical layout, grid layout, circle layout, ring layout, radial layout, sphere layout, group layout, directional layout, radial layout, force-oriented layout, progressive force-oriented layout, hierarchical layout, and tree layout.

5. The method according to claim 4, characterized in that, After creating the set of chart layouts to display the target data, the following is also included: The number of groups is determined by dividing the total number of node relationships in the aggregated ordered array by the number of primary node relationships; secondary node relationships and secondary nodes are then grouped according to the number of groups.

6. The method according to claim 5, characterized in that, Obtain matching scores for different chart layouts, specifically: Based on the primary node relationships, the number of primary and secondary node relationship groups, the number of secondary node groups, and the total data volume of the nodes in the aggregated ordered array, the chart layouts in the chart layout set are matched to the corresponding range of quantities that can be displayed, and the matching score of different chart layouts is obtained. The deviation from the center value of the quantity range is used as the matching score.

7. A chart display device for relational data, characterized in that, include: The data receiving module is used to receive target data to be displayed, which includes nodes and node relationships. The node relationships are formed by the interaction records generated by the nodes. The sorting module is used to sort the node relationships and obtain an ordered array corresponding to the node relationships; The chart matching module is used to preset the display reference value of nodes. When the data volume of the nodes corresponding to the ordered array is less than or equal to the display reference value, the ordered array is matched with the chart layout set to obtain the matching score of different chart layouts in the chart layout set. Specifically, the preset display reference value of nodes is determined by: obtaining the monitor resolution and computer host configuration parameters; determining the display reference value of nodes based on the resolution and configuration parameters; when the data volume of the nodes corresponding to the ordered array is greater than the display reference value, a first division value is preset, and the ordered array is divided according to the first division value to obtain a first array and a second array, where the first array represents the main nodes corresponding to the main node relationships in the ordered array, and the second array represents the secondary nodes corresponding to the secondary node relationships in the ordered array; data aggregation processing is performed on the corresponding node relationships in the second array to obtain an aggregated second array; if the data volume of the ordered array corresponding to the aggregated second array is greater than the display reference value, data aggregation processing is continued on the second array until the data volume of the ordered array is less than or equal to the display reference value; the ordered array that meets the display reference value is matched with the chart layout set to obtain the matching score of different chart layouts; the chart layout with the highest matching score is selected for visualization of the target data. The chart display module is used to select the chart layout with the highest matching score to visualize the target data.

8. An electronic device, characterized in that, The method includes a processor and a memory storing a computer program, characterized in that the processor executes the computer program to implement the steps of the method according to any one of claims 1 to 6.

Images