US 12,353,585 B2
Dual write and dual read access to graph databases
Xia Zhang, Shanghai (CN); Pengshan Zhang, Shanghai (CN); Kun Wang, Shanghai (CN); Jiaxin Fang, Shanghai (CN); Jun Li, Shanghai (CN); Xin Wang, Shanghai (CN); Yangxing Liu, Shanghai (CN); Yu Zhang, Shanghai (CN); Changle Lian, Suzhou (CN); Ying Yue, Shanghai (CN); and Xiaojun Luan, Shanghai (CN)
Assigned to PayPal, Inc., San Jose, CA (US)
Filed by PayPal, Inc., San Jose, CA (US)
Filed on Nov. 9, 2022, as Appl. No. 18/053,870.
Claims priority of application No. PCT/CN2022/118421 (WO), filed on Sep. 13, 2022.
Prior Publication US 2024/0086563 A1, Mar. 14, 2024
Int. Cl. G06F 21/62 (2013.01); G06F 16/2453 (2019.01)
CPC G06F 21/6227 (2013.01) [G06F 16/24535 (2019.01); G06F 2221/2141 (2013.01)] 20 Claims
OG exemplary drawing
 
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.