Cross-Regional Data Search via Regional Metadata Caching
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In edge architectures, high network latency between regions leads to prolonged data acquisition times when nodes need to route through multiple hops to locate data across regions, degrading performance.
Innovation Solution
A method that involves a first node acquiring a data identifier and determining a second node storing metadata within the same region, which is then used to find a third node in a different region storing the target data, thereby accelerating cross-regional data searching by decoupling geographic location identifiers and updating metadata to reduce latency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If nodes route through multiple hops to obtain metadata across regions, then data can be located in a decentralized system, but network latency increases and data acquisition time is prolonged
Solution Approach 1:
The patent pre-generates and caches routing information for cross-regional data access at each node. When a node needs to access data in another region, it uses the pre-cached routing information to directly locate the metadata without performing multi-hop routing queries, thus eliminating the time penalty while maintaining the ability to find data across regions
Solution Approach 2:
The patent introduces a regional caching mechanism that acts as an intermediary between nodes and remote data. Each node caches routing metadata locally, serving as a mediator that provides fast access to cross-regional data location information without requiring direct communication with remote nodes, thereby reducing latency while preserving data location capability
2Adaptability or versatility
If nodes are widely distributed across regions in edge architecture, then system adaptability and low-latency local services are improved, but cross-regional data searching becomes slower
Solution Approach 1:
The patent pre-computes and caches routing metadata at each node before actual data access occurs. This preliminary action ensures that when cross-regional data search is needed, nodes can immediately use the pre-prepared routing information without performing time-consuming multi-hop queries, thus maintaining high search speed while preserving the benefits of distributed architecture
Solution Approach 2:
The patent implements region-specific caching where each node maintains cached routing information relevant to its region and other regions. This local quality approach allows nodes to have optimized access patterns for their specific context while maintaining overall system-wide adaptability and cross-regional search capability
Data Source
AI summary
Embodiments of the present disclosure relate to a method, an electronic device, and a computer program product for cross-regional data searching. The method includes acquiring a data identifier of target data in response to receiving a searching request for the target data at a first node. The method includes determining, based on the data identifier, a second node storing metadata of the target data, wherein both the first node and the second node are located in a first region, and the metadata includes the data identifier. The method further includes determining, based on the metadata, a third node storing the target data, wherein the third node is located in a second region different from the first region.