Local Knowledge Graph Linking for Consistent User Customization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Large and frequently accessed knowledge graphs face challenges in managing user interactions and maintaining consistency, with existing techniques from Unified Modeling Language (UML) not effectively adaptable due to differences in structured relationships and semantics.
Innovation Solution
The implementation of local knowledge graphs that reference and link to a core knowledge graph, allowing users to create elements that may not modify the core, while maintaining consistency and reducing computing resources, through techniques that manage access rights and establish semantically equivalent elements.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a core knowledge graph is used to ensure consistency across users, then data integrity is improved, but computing resource use and system complexity increase
Solution Approach 1:
The system segments the knowledge graph into a core knowledge graph (shared by all users) and local knowledge graphs (specific to each user or application). This segmentation allows the core graph to maintain consistency and data integrity while local graphs handle user-specific variations, reducing the complexity burden on any single component.
Solution Approach 2:
The patent introduces intermediary components including a graph storage that manages multiple knowledge graphs, a matching system that identifies corresponding elements between core and local graphs, and a rights management component that mediates access control. These intermediaries enable consistent data management without requiring direct complex interactions between all users and the core graph.
2Adaptability or versatility
If users can create and modify elements in the knowledge graph, then adaptability and ease of operation are improved, but consistency and data integrity deteriorate
Solution Approach 1:
By dividing the knowledge graph into core and local segments, the system allows users to freely create and modify elements in their local knowledge graphs without affecting the consistency of the core graph. This segmentation enables user customization while preserving overall data integrity.
Solution Approach 2:
The system performs preliminary actions by establishing a structured framework with the core knowledge graph before allowing user modifications. The matching system proactively identifies corresponding elements between core and local graphs, and the rights management component pre-configures access controls, ensuring that user creativity operates within boundaries that maintain consistency.
3Reliability
If the knowledge graph is centralized for consistency, then data integrity is improved, but computing resource use and access efficiency worsen
Solution Approach 1:
Segmenting the knowledge graph into core and local portions allows the system to load and process only relevant subsets of data. Users access their local knowledge graphs which contain only the data specific to their needs, reducing memory usage and processing requirements compared to loading the entire centralized graph.
Solution Approach 2:
Each local knowledge graph is optimized with local quality characteristics, containing only the elements and relationships relevant to specific users or applications. This local optimization reduces the amount of data that needs to be processed and accessed, thereby reducing computing resource consumption while maintaining data integrity through links to the core graph.
4Ease of operation
If local knowledge graphs are created for each user, then access efficiency and ease of operation are improved, but system complexity and data consistency management worsen
Solution Approach 1:
The patent implements universal, reusable components that serve multiple functions: the matching system identifies corresponding elements across different knowledge graphs, the rights management component handles access control uniformly, and the graph storage manages multiple graphs with a single interface. This multi-functionality reduces management complexity despite having multiple local knowledge graphs.
Solution Approach 2:
The system incorporates feedback mechanisms where the matching system continuously monitors and identifies relationships between core and local knowledge graphs, and the rights management component receives feedback about access attempts to enforce consistency rules. This automated feedback loop manages complexity without requiring manual intervention.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
The present disclosure provides techniques and solutions for linking elements of different knowledges graph and for using such links during knowledge graph processing. When an element of a knowledge graph is created, such as a class, a property, or a class instance, it can be determined whether a corresponding element exists in another knowledge graph. If so, the elements can be operatively linked. When a query is executed against a knowledge graph, if an element is linked to an element of another knowledge graph, the other knowledge graph can be accessed for query processing. When statements are made about a knowledge graph element that is defined in a first knowledge graph element and where the element is defined with respect to an element of a second knowledge graph, the scope of the statement can be limited to the second knowledge graph.