Meta-Layer Knowledge Graph Linking
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods for managing and linking knowledge graphs lack consistent access rights management and metadata handling, especially when combining multiple knowledge graphs, leading to inefficiencies and potential data integrity issues.
Innovation Solution
A computer-implemented method and system that links a first knowledge graph with a second knowledge graph using a meta-layer knowledge graph, allowing for independent management and access rights management, while utilizing a third knowledge graph to establish content relationships without merging the graphs, thus maintaining their autonomy and reducing computational effort.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If multiple knowledge graphs are merged into a single integrated graph, then data completeness and relationship coverage are improved, but system complexity and computational overhead increase significantly
Solution Approach 1:
The patent segments the knowledge graph system into multiple independent knowledge graphs, each managing its own data and relationships autonomously. This segmentation allows each graph to remain manageable in size and complexity while the system as a whole achieves comprehensive relationship coverage through inter-graph links and a meta-layer that coordinates across graphs.
2Loss of information
If multiple knowledge graphs are merged into a single integrated graph, then data completeness is improved, but computational overhead and processing time increase
Solution Approach 1:
By segmenting data across multiple independent knowledge graphs, the system avoids the computational burden of processing a single massive integrated graph. Each graph can be processed independently, improving computational efficiency while the meta-layer ensures data completeness by coordinating relationships across graphs.
Solution Approach 2:
The patent introduces a meta-layer as an intermediary that manages relationships between multiple knowledge graphs without requiring their full integration. This meta-layer acts as a mediator that provides data completeness by coordinating cross-graph relationships while maintaining the computational efficiency of separate graph processing.
3Reliability
If knowledge graphs are linked with unified access rights management, then data consistency is improved, but system complexity and management overhead increase
Solution Approach 1:
The patent segments access rights management by allowing each knowledge graph to maintain its own independent access control policies and metadata. This segmentation reduces management complexity compared to unified access rights, while the meta-layer ensures data consistency by coordinating access across graphs through standardized inter-graph link mechanisms.
Data Source
AI summary
A method for linking a first knowledge graph (KG) and a second KG in the presence of a third KG is provided. Content of nodes of the first KG is compared to nodes of the second KG. If a first KG node has a content relationship to a related second KG node, an edge identified by a tuple identifying the first KG and the first KG node and a tuple identifying the second KG and the second KG node is stored in a meta-layer KG. The method comprises comparing content of the nodes from the third KG with the content of nodes from the first and second KG, and in case relationships are identified, more complex tuples establishing this relationship in the meta-layer are stored. Finally, the method also comprises storing at least all nodes and edges of the meta-layer knowledge graph.