Distributed Graph Write Failover Using Geo-Aware Replica Selection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In distributed graph databases, efficiently migrating the primary replica node cluster to another secondary replica node cluster for reinitiated graph data write operations after a write failure is challenging due to varying geographical locations of secondary clusters, affecting write operation efficiency.
Innovation Solution
A method and apparatus that select a new primary replica node cluster based on geographical location information of secondary replica node clusters, updating replica topology information to optimize the reinitiated graph data write operation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a distributed graph database uses multiple secondary replica node clusters with different geographical locations for data storage, then the storage capacity and availability are improved, but the efficiency of graph data write operations deteriorates due to varying network communication overheads
Solution Approach 1:
The patent applies local quality by selecting a new primary replica node cluster based on geographical location information. Specifically, the system identifies secondary replica node clusters that are geographically closer to the original primary cluster and preferentially selects among those, thereby optimizing write operation efficiency for the affected region while maintaining the distributed storage architecture's availability benefits
2Reliability
If the primary replica node cluster fails during graph data write operation, then data safety is improved through replication, but the write operation must be reinitiated with migration to another secondary cluster, increasing time loss
Solution Approach 1:
The patent implements preliminary action by pre-configuring multiple secondary replica node clusters with geographical location information and maintaining replica topology information that includes these geographical details. When a primary cluster failure occurs, the system can immediately query pre-stored geographical information to identify suitable candidate clusters for migration, eliminating the need for real-time discovery and selection processes that would increase failure recovery time
3Adaptability or versatility
If the system migrates primary replica node cluster to a secondary cluster far from the original location, then load balancing is improved, but communication overheads increase
Solution Approach 1:
The patent resolves this contradiction by introducing geographical location information as a key factor in primary replica cluster selection. The system prioritizes selecting new primary clusters from secondary clusters that are geographically closer to the original primary cluster, thereby minimizing communication overheads while still achieving load balancing through the distributed replica architecture
Data Source
AI summary
Embodiments of this specification disclose graph data writing in a distributed graph database. In response to receiving a graph data write request, a graph data write operation is initiated to a graph data storage layer based on stored replica topology information of the distributed graph database. At least partially based on the geographical location information of the secondary replica node cluster in response to a failure of the graph data write operation, a new primary replica node cluster is selected from a first secondary replica node cluster set that completes a previous round of graph data synchronization operation. Replica topology information is synchronously updated at an engine analysis layer. Updated replica topology information is obtained from the engine analysis layer, and the graph data write operation is reinitiated to the graph data storage layer based on the updated replica topology information.