IP Library Granted Patent US 12,524,421
Granted Patent B2
US 12,524,421 · App. 18/469,973 · Granted Jan 13, 2026

Visualization methods and apparatuses for query result of graph database

Inventor: Pengfei Li (Hangzhou, CN)
Assignee: Alipay (Hangzhou) Information Technology Co., Ltd.
G06F16/248G06F16/244
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,524,421
App. No.
18/469,973
Filed
Sep 19, 2023
Granted
Jan 13, 2026
Kind
B2
Art Unit
2168
USPC
707/722
Abstract

A method includes: receiving query content input for a target relationship network graph in a graph database, where the target relationship network graph includes multiple nodes and connection edges between nodes; querying a matching query result graph from the target relationship network graph according to the query content, where the query result graph includes at least a target node; displaying the query result graph; in response to a first operation performed by a user in a display area of the target node, adding and displaying, in the query result graph, a first-order neighboring node of the target node and a connection edge between the target node and the first-order neighboring node; simultaneously adjusting positions of the target node, the first-order neighboring node, and the connection edge in response to a second operation performed by the user in a blank area other than a display area of the query result graph.

Claims (65)

1 . A visualization method for a query result of a graph database, comprising:

receiving query content input for a target relationship network graph in a graph database, wherein the target relationship network graph comprises multiple nodes and connection edges between the nodes, wherein the query content comprises graph query statement including at least a match clause, the match clause including a matching expression formed at least by a target node of the multiple nodes;

querying a query result graph from the target relationship network graph according to the query content, wherein the query result graph comprises at least the target node;

displaying the query result graph; and

subsequent to the displaying the query result graph:

in response to a first operation performed by a user in a display area of the target node, adding and displaying, in the query result graph, a first-order neighboring node of the target node and a connection edge between the target node and the first-order neighboring node; and simultaneously adjusting positions of the target node, the first-order neighboring node, and the connection edge in response to a second operation performed by the user in a blank area other than a display area of the query result graph; and/or,

in response to a filter condition set by the user on an attribute parameter of the multiple nodes for the query result graph, deleting, from the query result graph, a node among the multiple nodes that does not meet the determined filter condition to obtain a filtered query result graph; and displaying the filtered query result graph;

wherein, the method further comprises:

receiving a hover mode trigger instruction and entering a hover mode; and

in the hover mode, displaying the target node and the first-order neighboring node in a highlight or flashing manner in response to a hover operation performed by the user in the display area of the target node.

2 . The method according to claim 1 , further comprising:

displaying an order selection menu in response to a right-click operation performed by the user in the display area of the target node; and

adding and displaying, according to a target order selected from the order selection menu, neighboring nodes of the target node in the target order.

3 . The method according to claim 1 , wherein a quantity of connection edges between the target node and the first-order neighboring node is multiple, and directions and types of the multiple connection edges are the same; and the method further comprises:

receiving an edge combination instruction;

combining the multiple connection edges according to the received edge combination instruction to obtain an aggregation edge, wherein the aggregation edge and the multiple connection edges have a same direction and type; and

replacing display of the multiple connection edges by using the aggregation edge.

4 . The method according to claim 3 , further comprising:

adding a quantity attribute to the aggregation edge, wherein an attribute value of the quantity attribute is a quantity of the multiple connection edges.

5 . The method according to claim 1 , further comprising:

receiving an edit mode trigger instruction and entering an edit mode; and

in the edit mode, updating and displaying the query result graph in response to an edit operation performed by the user on the query result graph;

wherein the edit operation comprises creating, deleting, or modifying a node or a connection edge.

6 . The method according to claim 1 , wherein a layout of the query result graph comprises any one of the following: an elastic layout, a tree layout, a ring layout, and a grid layout.

7 . The method according to claim 1 , wherein a layout of the query result graph is an elastic layout; and the method further comprises:

simultaneously adjusting the positions of the target node, the first-order neighboring node, and the connection edge in response to a drag operation performed by the user in the display area of the target node.

8 . The method according to claim 1 , further comprising:

receiving a second filter condition set by the user on an attribute parameter of a connection edge; and

deleting, from the query result graph, a connection edge that does not meet the second filter condition, to obtain the filtered query result graph.

9 . The method according to claim 1 , further comprising:

updating and displaying the query result graph in response to a style setting operation performed by the user on a node or a connection edge;

wherein the style setting operation comprises a color/size setting operation or an attribute parameter setting operation.

10 . The method according to claim 1 , further comprising:

in response to a click operation performed by the user in the display area of the target node, adding and displaying each attribute parameter of the target node.

11 . The method according to claim 1 , further comprising:

receiving a graph export instruction, and determining a to-be-exported target format according to the graph export instruction; and

exporting the query result graph as a picture file in the target format;

wherein the target format comprises any one of the following: a json format, a png format, and a csv format.

12 . The method according to claim 1 , further comprising:

displaying a scaled-down/scaled-up query result graph in response to a scroll up/down operation by the user in the blank area.

13 . The method according to claim 1 , further comprising:

receiving a switching instruction for switching from a graph display mode to a tree display mode; and

switching the query result graph to a text tree according to the switching instruction;

wherein the text tree comprises at least a first text node, the first text node has two types of text sub-nodes, and one type of text sub-node is configured to record each query result in a query result set corresponding to the query result graph; and

the other type of text sub-node is configured to record each query field comprised in the query result set.

14 . The method according to claim 13 , wherein the two types of text sub-nodes support collapsing and expanding.

15 . A non-transitory computer readable storage medium having stored therein instructions that, when executed by a processor of a computing device, cause the computing device to:

receive query content input for a target relationship network graph in a graph database, wherein the target relationship network graph comprises multiple nodes and connection edges between the nodes, wherein the query content comprises graph query statement including at least a match clause, the match clause including a matching expression formed at least by a target node of the multiple nodes;

query a query result graph from the target relationship network graph according to the query content, wherein the query result graph comprises at least the target node;

display the query result graph; and

subsequent to the displaying the query result graph:

in response to a first operation performed by a user in a display area of the target node, add and display, in the query result graph, a first-order neighboring node of the target node and a connection edge between the target node and the first-order neighboring node; and simultaneously adjust positions of the target node, the first-order neighboring node, and the connection edge in response to a second operation performed by the user in a blank area other than a display area of the query result graph; and/or

in response to a filter condition set by the user on an attribute parameter of the multiple nodes for the query result graph, delete, from the query result graph, a node among the multiple nodes that does not meet the determined filter condition to obtain a filtered query result graph; and display the filtered query result graph;

wherein, the computing device is further caused to:

receive a hover mode trigger instruction and enter a hover mode; and

in the hover mode, display the target node and the first-order neighboring node in a highlight or flashing manner in response to a hover operation performed by the user in the display area of the target node.

16 . A computing device, comprising a memory and a processor, wherein the memory stores executable instructions that, in response to execution by the processor, cause the computing device to: receive query content input for a target relationship network graph in a graph database, wherein the target relationship network graph comprises multiple nodes and connection edges between the nodes, wherein the query content comprises graph query statement including at least a match clause, the match clause including a matching expression formed at least by a target node of the multiple nodes;

query a query result graph from the target relationship network graph according to the query content, wherein the query result graph comprises at least the target node;

display the query result graph; and

subsequent to the displaying the query result graph:

in response to a first operation performed by a user in a display area of the target node, add and display, in the query result graph, a first-order neighboring node of the target node and a connection edge between the target node and the first-order neighboring node; and simultaneously adjust positions of the target node, the first-order neighboring node, and the connection edge in response to a second operation performed by the user in a blank area other than a display area of the query result graph; and/or

in response to a filter condition set by the user on an attribute parameter of the multiple nodes for the query result graph, delete, from the query result graph, a node among the multiple nodes that does not meet the determined filter condition to obtain a filtered query result graph; and display the filtered query result graph;

wherein, the computing device is further caused to:

receive a hover mode trigger instruction and enter a hover mode; and

in the hover mode, display the target node and the first-order neighboring node in a highlight or flashing manner in response to a hover operation performed by the user in the display area of the target node.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 12, 2024
From: LI, PENGFEI
To: ALIPAY (HANGZHOU) INFORMATION TECHNOLOGY CO., LTD.
Reel/Frame 066114/0254 →
Continuity (1)
Related Publication 20240111778A1 · Apr 4, 2024
References Cited (9)
US 11030068B1 · Agarwal · 2021 [cited by examiner]
US 11580127B1 · Newman · 2023 [cited by examiner]
US 11669556B1 · Hasan · 2023 [cited by examiner]
US 12254033B2 · Pfitzmann · 2025 [cited by examiner]
US 20200356599A1 · Xia · 2020 [cited by examiner]
US 20220342932A1 · Monk · 2022 [cited by examiner]
US 20220414228A1 · Difonzo · 2022 [cited by examiner]
US 20230086327A1 · Song · 2023 [cited by examiner]
US 20230409610A1 · Gratzer · 2023 [cited by examiner]