Dual write and dual read access to graph databases

Patent metadata

Field	Value
Publication number	US-12353585-B2
Application number	US-202218053870-A
Country	US
Kind code	B2
Filing date	Nov 9, 2022
Priority date	Sep 13, 2022
Publication date	Jul 8, 2025
Grant date	Jul 8, 2025

Abstract

A method for operating a graph database, including receiving, by a computer system, a query to a particular graph database, the query identifying a plurality of vertices of the particular graph database. The method further includes performing, by the computer system, hash operations on two or more of the plurality of vertices to generate respective hash values and dividing, using the respective hash values, the query into a plurality of sub-queries, each corresponding to a subset of the plurality of vertices. The method also includes sending, by the computer system, ones of the plurality of sub-queries to a plurality of database repositories for the particular graph database.

First claim

What is claimed is:

1. A method comprising:
maintaining a primary copy of a particular graph database on a first repository of a plurality of database repositories;
maintaining one or more redundant copies of the particular graph database on respective one or more different repositories of the plurality of database repositories;
receiving, by a computer system, a query to retrieve information from the particular graph database, the query identifying a plurality of vertices of the particular graph database;
performing, by the computer system, hash operations on two or more of the plurality of vertices to generate respective hash values;
dividing, by the computer system using the respective hash values, the query into a plurality of sub-queries, each corresponding to a subset of the plurality of vertices; and
sending, by the computer system, ones of the plurality of sub-queries to respective ones of the plurality of database repositories to retrieve corresponding portions of the information from a plurality of copies of the particular graph database.

2. The method of claim 1 , further comprising:
receiving, by the computer system from the respective ones of the plurality of database repositories, corresponding results for the ones of the plurality of sub-queries; and
based on the received results, sending a response to the query.

3. The method of claim 1 , further comprising:
receiving, by the computer system, an indication that a particular one of the plurality of database repositories is unavailable; and
distributing, by the computer system, vertices included in a sub-query intended for the unavailable database repository into remaining ones of the plurality of sub-queries.

4. The method of claim 1 , further comprising:
receiving, by the computer system, an indication that a particular one of the plurality of database repositories is unavailable; and
reassigning, by the computer system, a sub-query intended for the unavailable database repository to an available one of the plurality of database repositories.

5. The method of claim 1 , further comprising:
storing, by the computer system, a duplicate of the particular graph database into a different plurality of database repositories;
wherein the particular graph database is accessible by a first group of users categorized as risk; and
wherein the duplicate graph database is accessible by a second group of users categorized as non-risk and is not accessible by the first group.

6. The method of claim 5 , further comprising:
receiving a first query from a user of the first group using a first process running on the computer system; and
receiving a second query from a user of the second group using a second process running on the computer system, wherein the first and second processes do not communicate with one another.

7. The method of claim 5 , wherein storing the particular and duplicate graph databases includes sending, by the computer system using respective data storage engines for the particular and duplicate graph databases, a new record to the particular and duplicate graph databases concurrently.

8. The method of claim 7 , further comprising validating storage of the new record to the particular and duplicate graph databases by:
reading respective copies of the new record from the particular and duplicate graph databases; and
comparing the respective copies to a copy of the new record held in the computer system.

9. A computer-readable, non-transient memory including instructions that when executed by a computer system within a computer network, cause the computer system to perform operations including:
maintaining a primary copy of a particular graph database in a first database repository of a plurality of database repositories;
maintaining one or more redundant copies of the particular graph database on respective one or more different database repositories of the plurality of database repositories;
receiving a query to retrieve information from the particular graph database, the query identifying a plurality of vertices of the particular graph database;
generating respective hash values for two or more of the plurality of vertices;
dividing, using the respective hash values, the query into a plurality of sub-queries, ones of the sub-queries corresponding to a subset of the plurality of vertices; and
sending ones of the plurality of sub-queries to respective repositories of the plurality of database repositories to retrieve corresponding portions of the information from the redundant copies of the particular graph database.

10. The computer-readable, non-transient memory of claim 9 , wherein generating the respective hash values includes performing hash operations on user identification information associated with ones of the subset of vertices.

11. The computer-readable, non-transient memory of claim 9 , further comprising, in response to an indication that a particular one of the plurality of database repositories is unavailable, distributing vertices included in a sub-query intended for the unavailable database repository into remaining ones of the plurality of sub-queries.

12. The computer-readable, non-transient memory of claim 9 , further comprising, in response to an indication that a particular one of the plurality of database repositories is unavailable, reassigning a sub-query intended for the unavailable database repository to an available one of the plurality of database repositories.

13. The computer-readable, non-transient memory of claim 9 , further comprising:
storing a duplicate of the particular graph database into a different plurality of database repositories;
wherein the particular graph database is accessible by a first group of users; and
wherein the duplicate graph database is accessible by a second group of users and is not accessible by the first group.

14. The computer-readable, non-transient memory of claim 13 , further comprising:
receiving a first query from a user of the first group using a first process running on the computer system; and
receiving a second query from a user of the second group using a second process running on the computer system, wherein the first and second processes are isolated from one another.

15. The computer-readable, non-transient memory of claim 13 , wherein storing the particular and duplicate graph databases includes sending, using respective data storage engines for the particular and duplicate graph databases, a new record to the particular and duplicate graph databases concurrently.

16. A system comprising:
a processor circuit; and
a memory circuit including instructions that when executed by the processor circuit, cause the system to perform operations including:
maintaining a primary copy of a particular graph database on a first repository of a plurality of database repositories;
maintaining one or more redundant copies of the particular graph database on a respective one or more different repositories of the plurality of database repositories;
receiving a query to retrieve information from the particular graph database, the query identifying a plurality of vertices of the particular graph database;
generating respective hash values for two or more of the plurality of vertices;
dividing, using the respective hash values, the query into a plurality of sub-queries, ones of the sub-queries corresponding to a subset of the plurality of vertices; and
sending ones of the plurality of sub-queries to respective repositories of the plurality of database repositories to retrieve corresponding portions of the information from the

Assignees

• Paypal Inc

Inventors

• Zhang Xia
• Zhang Pengshan
• Wang Kun
• Fang Jiaxin
• Li Jun
• Wang Xin
• Liu Yangxing
• Zhang Yu
• Lian Changle
• Yue Ying
• Luan Xiaojun

Classifications

• G06F16/24535

  of sub-queries or views · CPC title

• G06F2221/2141

  Access rights, e.g. capability lists, access control lists, access tables, access matrices · CPC title

• G06F16/289

  Object oriented databases · CPC title

• G06F21/6227 Primary

  where protection concerns the structure of data, e.g. records, types, queries · CPC title