Cross-Domain Knowledge Graph Coupling Without Moving Personal Data
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data structures across different domains face challenges in sharing personal identifying information due to regulatory restrictions, limiting the flow of insights and links between individuals and entities while maintaining compliance with data protection regulations.
Innovation Solution
A system and method for coupling and decoupling data structures using message keys that comply with regional regulations, allowing access to information while maintaining data within its domain, by compiling and verifying message keys for query responses across domains.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If data structures are coupled across different domains to enable information sharing, then the flow of insights and links between individuals and entities is improved, but compliance with data protection regulations deteriorates
Solution Approach 1:
The patent introduces message keys as an intermediary mechanism that enables data coupling across domains without directly exposing or transferring personal identifying information. The message key acts as a mediator that links data structures in different domains while maintaining regulatory compliance by preventing direct access to sensitive data.
Solution Approach 2:
The patent extracts personal identifying information from the data coupling process by using message keys that reference data without containing the actual sensitive information. This extraction allows data structures to be coupled for analytical purposes while the harmful element (PII) is removed from the transmission path.
2Adaptability or versatility
If personal identifying information is shared across domains for business objectives, then the utility of information is improved, but regulatory restrictions worsen
Solution Approach 1:
The patent creates a functional copy of data relationships through message keys that preserve the utility and links between data structures without copying the actual personal identifying information. This allows the system to maintain data versatility while avoiding the harmful effects of sharing sensitive information.
Solution Approach 2:
Message keys serve as an intermediary that enables cross-domain information utility without violating regulatory restrictions. The mediator allows business objectives to be achieved through referenced data coupling while the regulatory harmful factors are avoided by not directly sharing PII.
3Ease of operation
If data is moved or copied across domains for query responses, then information access is improved, but data compliance and security deteriorate
Solution Approach 1:
The patent extracts the essential linking function from data movement by using message keys that provide query response capabilities without moving or copying personal identifying information across domains. This maintains ease of operation for information access while preserving data compliance.
Data Source
AI summary
Systems and methods are provided for coupling data structures in different domains to provide cross-domain data access. One example computer-implemented method includes receiving, from a requestor, an access request including a case type and indicators for multiple domains and determining restrictions associated with the domains. The method also includes compiling a first message key specific to the access request and transmitting the first message key to the requestor. The method further includes receiving an information request including a second message key and a query specific to a person, verifying the second message key based on the first message key, and coupling multiple knowledge graphs for multiple data structures across the domains. The method then includes, in response to verifying the second message key, submitting the query from the information request to the data structures of the coupled knowledge graphs and providing a response to the query to the requestor.