Graph-Based Account Linkage Across Service and Data Servers
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Users face the burden of performing multiple operations to link accounts between various service providers and data holders, leading to increased complexity and communication overhead in accessing user data across different services.
Innovation Solution
A system and method that utilize a graph structure to connect accounts between service providers and data holders, allowing data access even when direct linkages are not established, by tracing edges in the graph and using comprehensive consent mechanisms to facilitate data acquisition without requiring explicit linkages between all service providers and data holders.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If users perform multiple operations to link accounts between service providers and data holders, then account linkage is established, but operational complexity and communication overhead increase
Solution Approach 1:
The patent introduces a graph data structure as an intermediary mechanism to represent account linkage relationships. Instead of requiring direct linkages between all service providers and data holders, the graph serves as a mediator that stores and processes linkage information, enabling indirect connections through graph traversal (edges) to achieve data access across services without manual operations for each connection.
Solution Approach 2:
The system performs preliminary actions by pre-establishing account linkages between service providers and data holders, storing these relationships in the graph structure. This allows the system to later query and traverse existing linkages to enable data access without requiring users to perform multiple linkage operations, as the foundational connections are already in place and indexed in the graph.
2Adaptability or versatility
If direct linkages are established between all service providers and data holders, then data access is enabled, but the number of required operations increases
Solution Approach 1:
The patent transitions from a direct, two-dimensional connection model (service provider directly linked to data holder) to a multi-dimensional graph structure where accounts are nodes and linkages are edges. This dimensional expansion allows the system to represent complex relationship networks, enabling data access through graph traversal algorithms that can find paths between any two nodes, thereby reducing the need for direct linkages between all pairs of service providers and data holders.
Solution Approach 2:
The graph data structure serves multiple functions simultaneously: it stores linkage information, enables indirect data access, facilitates query processing, and supports various access patterns. This universal structure allows a single graph to replace multiple direct linkage mechanisms, reducing the total number of operations needed while maintaining comprehensive data access capability across all service providers and data holders.
Data Source
AI summary
A system includes a plurality of service providing servers, a plurality of data holding servers, and a platform server. The platform server acquires, for a first user, a graph having an account as a node, a first linkage between accounts at different service providing servers as a first edge, and a second linkage between an account at the service providing server and an account at the data holding server as a second edge. The platform server notify, when it is possible to reach a second account of a first user at a first data holding server from a first account of the first user at a first service providing server by tracing one or more first edges and one second edge, the first service providing server of information enabling the first service providing server to acquire data corresponding to the second account from the first data holding server.