Knowledge Graph Child Entity Inheritance for Storage Optimization

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current knowledge reuse methods are inefficient in integrating and improving knowledge graphs, as they lack effective mechanisms for inheriting and processing instance data to generate new knowledge.

Innovation Solution

The method involves defining a child entity based on a parent entity in a knowledge graph, performing knowledge inheritance to inherit instance data, and storing increment information, which allows for efficient knowledge reuse and storage.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If knowledge graphs are integrated and improved by using existing knowledge, then knowledge value is enhanced, but processing efficiency and storage optimization are insufficient

Engineering Contradiction:
Improveknowledge reuse efficiencyVSAvoidknowledge processing time
Core Design Contradiction:
ProductivityVSLoss of time

Solution Approach 1:

The patent segments knowledge graphs into parent entities and child entities, allowing independent processing and inheritance. Child entities inherit instance data from parent entities, enabling modular knowledge reuse without processing entire graphs, thus improving efficiency and reducing time loss.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent performs preliminary knowledge inheritance by pre-defining parent-child entity relationships and pre-inheriting instance data. This preliminary structuring allows faster knowledge reuse and processing during actual operations, reducing processing time and improving productivity.

Inventive Principle:
Principle #10Preliminary action

2Loss of information

If complete instance data is stored for child entities, then knowledge completeness is ensured, but storage occupancy increases

Engineering Contradiction:
Improveknowledge completenessVSAvoidstorage occupancy
Core Design Contradiction:
Loss of informationVSQuantity of substance

Solution Approach 1:

The patent implements a nested storage structure where child entities store only incremental differences from their parent entities rather than complete data. The instance data is nested through inheritance relationships, allowing complete knowledge representation with minimal storage occupancy by storing only what differs from the parent.

Inventive Principle:
Principle #7Nested doll (Nesting)

Solution Approach 2:

Instead of storing complete instance data for each child entity, the patent uses copying through inheritance where child entities reference and inherit data from parent entities. Only necessary increments are stored separately, reducing storage occupancy while maintaining knowledge completeness.

Inventive Principle:
Principle #26Copying

Data Source

PatentUS20240144033A1Knowledge reuse methods and systems
Publication Date: 2024.05.02 ALIPAY (HANGZHOU) INFORMATION TECH CO LTD
  • US20240144033A1 patent drawing
  • US20240144033A1 patent drawing
  • US20240144033A1 patent drawing

AI summary

This specification relates to the field of knowledge graphs, and in particular, to knowledge reuse methods, apparatuses, computer-readable media, and systems. In an example computer-implemented method, a child entity is defined based on a parent entity, where the parent entity is selected from entities in a knowledge graph. A knowledge inheritance method is performed to inherit a portion of instance data of the parent entity. Instance data of the child entity are determined. First graph increment information corresponding to the instance data of the child entity is stored.