Dual Write and Dual Read Access to Graph Databases

Patent metadata

Field	Value
Publication number	US-2025348615-A1
Application number	US-202519225555-A
Country	US
Kind code	A1
Filing date	Jun 2, 2025
Priority date	Sep 13, 2022
Publication date	Nov 13, 2025
Grant date	—

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

1 . (canceled)

2 . A method comprising:
storing, by a computer system, a primary copy of a graph database on a first repository of a plurality of database repositories, wherein the primary copy of the graph database is accessible by a first group of users categorized as risk; storing, by the computer system, a duplicate copy of the graph database on a second repository of the plurality of database repositories, wherein the duplicate copy of the graph database is accessible by a second group of users categorized as non-risk and is not accessible by the first group of users; receiving, by the computer system from a particular user, a particular query to retrieve information from the graph database; determining, by the computer system, that the particular user belongs to the first group of users; and processing, by the computer system, the particular query using only the primary copy of the graph database.

3 . The method of claim 2 , further comprising:
receiving, by the computer system from a different user, a different query to retrieve information from the graph database; determining, by the computer system, that the different user belongs to the second group of users; and processing, by the computer system, the different query using only the duplicate copy of the graph database.

4 . The method of claim 3 , wherein receiving the particular query from the particular user includes receiving the particular query via a first server process;
wherein receiving the different query from the different user includes receiving the particular query via a second server process; and wherein the first and second server processes are isolated from one another.

5 . The method of claim 2 , further comprising using, by the computer system, respective data storage engines to concurrently send a new record to the particular and duplicate copies of the graph database.

6 . The method of claim 5 , further comprising:
using, by the computer system, a data process engine to monitor activity associated with the graph database; determining, by the data process engine, that monitored activity results in a change to the graph database; and generating, by the data process engine, the new record based on the monitored activity.

7 . The method of claim 5 , further comprising:
using, by the computer system, a data verification engine to read respective copies of the new record from the particular and duplicate copies of the graph database; comparing, by the data verification engine, the respective copies of the new record to a copy of the new record held in the computer system; and validating, by the data verification engine, that the new record was successfully stored in the particular and duplicate copies of the graph database.

8 . The method of claim 2 , wherein the first and second repositories are isolated from one another.

9 . The method of claim 2 , wherein users categorized as risk include users that have been associated with prior activities that were identified as potential fraudulent behavior.

10 . 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 graph database on a first repository of a plurality of database repositories, wherein the primary copy of the graph database is accessible by a first group of users included in a first risk category; maintaining a duplicate copy of the graph database on a second repository of the plurality of database repositories, wherein the duplicate copy of the graph database is accessible by a second group of users included in a second risk category and is not accessible by the first group of users; receiving, from a particular user, a particular query to retrieve information from the graph database; and based on determining that the particular user belongs to the first group of users, processing the particular query using only the primary copy of the graph database.

11 . The computer-readable, non-transient memory of claim 10 , further comprising:
receiving, from a different user, a different query to retrieve information from the graph database; and based on determining that the different user belongs to the second group of users processing, by the computer system, the different query using only the duplicate copy of the graph database.

12 . The computer-readable, non-transient memory of claim 10 , further comprising:
monitoring activity associated with the graph database; and based on determining that monitored activity results in a change to the graph database, generating a new record based on the monitored activity.

13 . The computer-readable, non-transient memory of claim 12 , further comprising:
concurrently sending the new record to the particular and duplicate copies of the graph database.

14 . The computer-readable, non-transient memory of claim 13 , wherein concurrently sending the new record includes:
sending a first copy of the new record to a first storage engine; sending a second copy of the new record to a second storage engine; and using the first and second storage engines to concurrently send the first and second copies of the new record, respectively, to the particular and duplicate copies of the graph database, wherein the first and second storage engines are isolated from one another.

15 . The computer-readable, non-transient memory of claim 13 ,
after sending the new record to the particular and duplicate copies of the graph database, reading respective copies of the new record from the particular and duplicate copies of the graph database; comparing the respective copies of the new record to a copy of the new record held in the computer system; and validating that the new record was successfully stored in the particular and duplicate copies of the graph database.

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:
storing a particular copy of a graph database on a first database repository, wherein the particular copy of the graph database is accessible by a first group of users included in a first risk category;
storing a duplicate copy of the graph database on a second database repository, wherein the duplicate copy of the graph database is accessible by a second group of users included in a second risk category and is not accessible by the first group of users;
based on monitored activity associated with the graph database, determining that a record maintained in the graph database was modified by a user of the second group; and
concurrently sending the modified record to the particular and duplicate copies of the graph database for storage.

17 . The system of claim 16 , wherein concurrently sending the modified record includes:
sending a first copy of the modified record to a first storage engine; sending a second copy of the modified record to a second storage engine; and using the first and second storage engines to concurrently send the first and second copies of the modified record, respectively, to the particular and duplicate copies of the graph database, wherein the first and second storage engines are isolated from one another.

18 . The system of claim 16 , wherein the operations further include:
after sending the modified record to the particular and duplicate copies of the graph database, reading respective copies of the modifi

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