Data processing method and apparatus, readable storage medium, and electronic device

Patent metadata

Field	Value
Publication number	US-2024256613-A1
Application number	US-202418423743-A
Country	US
Kind code	A1
Filing date	Jan 26, 2024
Priority date	Jan 29, 2023
Publication date	Aug 1, 2024
Grant date	—

Abstract

A data processing method applied to a graph database, includes: determining each to-be-queried object in a received query statement and a screening condition for each to-be-queried object based on the query statement, wherein the to-be-queried object includes at least one of a graph data vertex or a graph data edge in the graph database; generating a target node corresponding to each to-be-queried object, performing semantic analysis on the screening condition for the to-be-queried object, determining a semantic query condition, and determining a sub-node of the target node based on each determined semantic query condition; determining, based on a sub-node of each target node, each database operation corresponding to the target node that needs to be performed by the graph database; and executing a data processing task corresponding to the query statement based on each database operation, and returning an execution result based on the query statement.

First claim

What is claimed is:

1 . A data processing method applied to a graph database, the method comprising:
determining each to-be-queried object in a received query statement and a screening condition for each to-be-queried object based on the query statement, wherein the to-be-queried object comprises at least one of a graph data vertex or a graph data edge in the graph database; generating a target node corresponding to each to-be-queried object, performing semantic analysis on the screening condition for the to-be-queried object, determining a semantic query condition, and determining a sub-node of the target node based on each determined semantic query condition; determining, based on a sub-node of each target node, each database operation corresponding to the target node that needs to be performed by the graph database; and executing a data processing task corresponding to the query statement based on each database operation, and returning an execution result based on the query statement.

2 . The method according to claim 1 , wherein determining each to-be-queried object in the received query statement and the screening condition for each to-be-queried object based on the query statement comprises:
receiving the query statement, and determining syntax information corresponding to the query statement; determining each to-be-queried object in the query statement and description information of each to-be-queried object based on the syntax information; and determining the screening condition for each to-be-queried object based on the description information of the to-be-queried object.

3 . The method according to claim 1 , wherein the to-be-queried object comprises at least a graph data vertex, and the graph data vertex comprises at least one of a graph data start point or a graph data end point; and
performing the semantic analysis on the screening condition for the to-be-queried object, determining the semantic query condition, and determining the sub-node of the target node based on each determined semantic query condition comprises: performing semantic analysis on a screening condition for the graph data vertex to determine at least one of a name, a type, or a description of the to-be-queried object; and determining at least one of a name node, a type node, or a description node in the graph database as the sub-node of the target node corresponding to the to-be-queried object based on the at least one of the name, the type, or the description of the to-be-queried object.

4 . The method according to claim 1 , wherein the to-be-queried object comprises at least a graph data edge; and
performing the semantic analysis on the screening condition for the to-be-queried object, determining the semantic query condition, and determining the sub-node of the target node based on each determined semantic query condition comprises: performing semantic analysis on a screening condition for the graph data edge to determine at least one of a name, a type, a direction, or a description of the to-be-queried object; and determining at least one of a name node, a type node, a direction node, or a description node as the sub-node of the target node corresponding to the to-be-queried object based on the at least one of the name, the type, the direction, or the description of the to-be-queried object.

5 . The method according to claim 1 , wherein the query statement further comprises a screening condition for a query result; and the method further comprises:
determining the screening condition for the query result from the query statement; determining a target node corresponding to the query result, performing semantic analysis on the screening condition for the query result to obtain a semantic query condition corresponding to the query result, and determining a result constraint node as a sub-node of the target node corresponding to the query result based on the determined semantic query condition; and updating, based on the target node corresponding to the query result and the result constraint node, each database operation that needs to be performed by the graph database.

6 . The method according to claim 1 , wherein the graph database stores a vertex table and a relationship table, the vertex table stores property information of each graph data vertex, and the relationship table stores property information of each graph data edge; and
determining, based on the target node corresponding to each to-be-queried object and the sub-node corresponding to each target node, each database operation corresponding to each target node that needs to be performed by the graph database comprises: determining, from the vertex table and the relationship table based on the target node corresponding to each to-be-queried object, a target table that needs to be queried for the to-be-queried object; and determining, based on each sub-node corresponding to the target node, a database operation performed on the target table.

7 . The method according to claim 1 , wherein the query statement comprises a screening condition for a query result, and the screening condition for the query result comprises a first screening condition to indicate whether the query result can be empty; and
returning the execution result based on the query statement comprises: determining the screening condition for the query result in the query statement; determining whether the execution result matches the first screening condition in the screening condition for the query result; if it is determined that the execution result matches the first screening condition, returning the execution result; and if it is determined that the execution result does not match the first screening condition, returning prompt information to indicate that execution of the query statement fails.

8 . An electronic device, comprising:
a processor; and a memory storing instructions executable by the processor, wherein the processor is configured to: determine each to-be-queried object in a received query statement and a screening condition for each to-be-queried object based on the query statement, wherein the to-be-queried object comprises at least one of a graph data vertex or a graph data edge in a graph database; generate a target node corresponding to each to-be-queried object, perform semantic analysis on the screening condition for the to-be-queried object, determine a semantic query condition, and determine a sub-node of the target node based on each determined semantic query condition; determine, based on a sub-node of each target node, each database operation corresponding to the target node that needs to be performed by the graph database; and execute a data processing task corresponding to the query statement based on each database operation, and return an execution result based on the query statement.

9 . The electronic device according to claim 8 , wherein the processor is further configured to:
receive the query statement, and determine syntax information corresponding to the query statement; determine each to-be-queried object in the query statement and description information of each to-be-queried object based on the syntax information; and determine the screening condition for each to-be-queried object based on the description information of the to-be-queried object.

10 . The electronic device according to claim 8 , wherein the to-be-queried object comprises at least a graph data vertex, and the graph data vertex comprises at least one of a graph data start point or a graph data end point; and
the processor is further configured to: perform semantic analysis on a screening condition for the graph data vertex to determine at leas

Assignees

• Alipay Hangzhou Inf Tech Co Ltd

Inventors

• Huang Ke
• Wang Tao
• Li Kaiwei
• Gao Hongpeng

Classifications

• G06F16/9024

  Graphs; Linked lists (G06F16/9027 takes precedence) · CPC title

• G06F16/90335 Primary

  Query processing · CPC title

• Y02D10/00

  Energy efficient computing, e.g. low power processors, power management or thermal management · CPC title