Granted Patent B2

US 12,339,841 · App. 18/063,343 · Granted Jun 24, 2025

Inventors: Chao Zhang (Helsinki, FI); Jiaheng Lu (Helsinki, FI); Xiaochun Han (Shanghai, CN); Xinyong Zhang (Beijing, CN)

Assignee: HUAWEI TECHNOLOGIES CO., LTD.

G06F16/2453G06F16/9024

Abstract

Claims (27)

1. A database management system for performing a graph query based on one or more graph views of a relational-graph database, comprising:

at least one processor and a memory storing instructions that, when executed by the at least one processor, cause the database management system to:

determine a plurality of graph views of the relational-graph database based on one or more graph queries of the relational-graph database to obtain a plurality of candidate graph views of the relational-graph database;

store a subset of the plurality of candidate graph views of the relational-graph database in the memory; and

perform a graph query of the relational-graph database based on the subset of the plurality of candidate graph views of the relational-graph database,

wherein the database management system further comprises a graph query engine and a relational query engine, wherein each query engine is executed by the at least one processor, and

wherein the instructions, when executed by the at least one processor, further cause the database management system to determine a respective performance indicator for each of the plurality of candidate graph views by comparing one or more queries processed by the graph query engine, using the respective candidate graph view with the same one or more queries processed by the relational query engine.

2. The database management system of claim 1 , wherein each of the plurality of candidate graph views occupies a respective portion of the memory, and

wherein the instructions, when executed by the at least one processor, further cause the database management system to determine the subset of the plurality of candidate graph views of the relational-graph database based on a total size of the memory available for storing the determined subset of the plurality of candidate graph views of the relational-graph database and/or one or more performance indicators associated with the plurality of candidate graph views.

3. The database management system of claim 1 , wherein the instructions, when executed by the at least one processor, further cause the database management system to translate the one or more graph queries for the graph query engine into one or more relational queries for the relational query engine, when the one or more graph queries are not processable by the graph query engine.

4. The database management system of claim 1 , wherein the instructions, when executed by the at least one processor, further cause the database management system to determine the subset of the plurality of candidate graph views of the relational-graph database based on the one or more performance indicators of the plurality of candidate graph views and the total size of the memory available for storing the determined subset of the plurality of candidate graph views of the relational-graph database.

5. The database management system of claim 1 , wherein the instructions, when executed by the at least one processor, further cause the database management system to determine whether the one or more graph queries are processable by the graph query engine using the respective candidate graph view.

6. The database management system of claim 2 , wherein the one or more performance indicators associated with the plurality of candidate graph views comprise a plurality of global performance indicators, wherein each of the plurality of global performance indicators is associated with a respective combination of the plurality of candidate graph views, and wherein the instructions, when executed by the at least one processor, further cause the database management system to determine the subset of the plurality of candidate graph views of the relational-graph database based on the plurality of global performance indicators.

7. The database management system of claim 6 , wherein the instructions, when executed by the at least one processor, further cause the database management system to determine the global performance indicator for a respective combination of the plurality of candidate graph views by splitting a respective candidate graph view into at least two candidate sub-graph views.

8. The database management system of claim 6 , wherein the instructions, when executed by the at least one processor, further cause the database management system to determine the global performance indicator for a respective combination of the plurality of candidate graph views by merging sub-graphs of at least two of the plurality of candidate graph views to generate a Previously Presented candidate graph view.

9. The database management system of claim 1 , wherein each of the plurality of the candidate graph views comprises a candidate graph view pattern and a candidate graph view content, and wherein the instructions, when executed by the at least one processor, further cause the database management system to determine the plurality of candidate graph views based on the one or more graph queries by mapping the one or more graph queries to one or more candidate graph view patterns.

10. The database management system of claim 9 , wherein the instructions, when executed by the at least one processor, further cause the database management system to map the one or more graph queries to the one or more candidate graph view patterns by sequentially mapping nodes and edges of the one or more graph queries to nodes and edges of the one or more candidate graph view patterns.

11. The database management system of claim 9 , wherein the instructions, when executed by the at least one processor, further cause the database management system to generate, based on the one or more graph queries, a respective edge-induced graph for generating the respective candidate graph view content of the respective candidate graph view.

12. The database management system of claim 1 , wherein the instructions, when executed by the at least one processor, further cause the database management system to determine a cost measure value for each of the plurality of candidate graph views and to limit the number of candidate graph views by removing the candidate graph views having a cost measure value larger than a cost measure threshold value.

13. The database management system of claim 1 , wherein the instructions, when executed by the at least one processor, further cause the database management system to receive one or more further graph queries and to adjust the subset of the plurality of candidate graph views of the relational-graph database in the memory based on the one or more further graph queries of the relational-graph database.

14. A method for performing a graph query based on one or more graph views of a relational-graph database, the method comprising:

determining a plurality of graph views of the relational-graph database based on one or more graph queries of the relational-graph database to obtain a plurality of candidate graph views of the relational-graph database;

storing a subset of the plurality of candidate graph views of the relational-graph database; and

performing a graph query of the relational-graph database based on the subset of the plurality of candidate graph views of the relational-graph database,

wherein the method further comprises determining a respective performance indicator for each of the plurality of candidate graph views by comparing one or more queries processed by a graph query engine, executed by at least one processor, using the respective candidate graph view with the same one or more queries processed by a relational query engine, executed by the at least one processor.

15. The method of claim 14 , wherein each of the plurality of candidate graph views occupies a respective portion of a memory of a database management system, and

the method further comprises determining the subset of the plurality of candidate graph views of the relational-graph database based on a total size of the memory available for storing the determined subset of the plurality of candidate graph views of the relational-graph database and/or one or more performance indicators associated with the plurality of candidate graph views.

Assignments (1)

Continuity (2)

References Cited (44)