Product History Graph Querying for Fast Defect Tracing

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current product history tracing methods based on relational databases are inefficient due to time-consuming query procedures, leading to low query efficiency for defective product tracing.

Innovation Solution

A product graph database is used to store a relational map constructed based on the manufacturing process, allowing for rapid querying of product history data by searching for product and manufacturing entities and their relations, eliminating the need for complex join operations across multiple data sheets.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If product history tracing is based on relational database, then data can be stored systematically, but query procedure becomes time-consuming and complicated

Engineering Contradiction:
Improvedata storage systematicsVSAvoidquery time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent pre-constructs a graph database model that stores product manufacturing relationships in advance. When a query is needed, the pre-established graph structure allows direct traversal of manufacturing entities and their relations without performing complex join operations at query time, thus reducing query time while maintaining systematic data storage

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent creates a graph database copy or alternative representation of the manufacturing data from the relational database. This graph structure copy enables efficient querying through graph traversal algorithms, avoiding the need to execute complex SQL join operations on the original relational database while preserving the systematic organization of manufacturing data

Inventive Principle:
Principle #26Copying

2Reliability

If product history tracing is based on relational database, then data can be stored with clear relationships, but query procedure becomes complicated

Engineering Contradiction:
Improvedata relationship clarityVSAvoidquery procedure complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent pre-constructs a graph database model that stores product manufacturing relationships in advance. When a query is needed, the pre-established graph structure allows direct traversal of manufacturing entities and their relations without performing complex join operations at query time, thus reducing query time while maintaining systematic data storage

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent creates a graph database copy or alternative representation of the manufacturing data from the relational database. This graph structure copy enables efficient querying through graph traversal algorithms, avoiding the need to execute complex SQL join operations on the original relational database while preserving the systematic organization of manufacturing data

Inventive Principle:
Principle #26Copying

3Loss of information

If complex join operations are performed across multiple data sheets, then complete product history can be retrieved, but query efficiency decreases

Engineering Contradiction:
Improveproduct history completenessVSAvoidquery efficiency
Core Design Contradiction:
Loss of informationVSProductivity

Solution Approach 1:

The patent pre-constructs a graph database model that stores product manufacturing relationships in advance. When a query is needed, the pre-established graph structure allows direct traversal of manufacturing entities and their relations without performing complex join operations at query time, thus reducing query time while maintaining systematic data storage

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent creates a graph database copy or alternative representation of the manufacturing data from the relational database. This graph structure copy enables efficient querying through graph traversal algorithms, avoiding the need to execute complex SQL join operations on the original relational database while preserving the systematic organization of manufacturing data

Inventive Principle:
Principle #26Copying

Data Source

PatentUS11645272B2Method, system, device and medium for querying product history
Publication Date: 2023.05.09 BEIJING ZHONGXIANGYING TECH CO LTD
  • US11645272B2 patent drawing
  • US11645272B2 patent drawing
  • US11645272B2 patent drawing

AI summary

A method for querying a product history is disclosed. The method includes receiving a product query request including at least one product query parameter for a target product to a product graph database that stores a relational map constructed based on a manufacturing process of the target product and describing entities including product entities and manufacturing entities and entity relations therebetween involved in the manufacturing process, querying the product graph database according to the product query parameter to obtain product history data of the target product by searching for a product entity corresponding to the target product as a target product entity in the relational map according to the parameter, searching for associated manufacturing entities of the target product entity according to the entity relations, obtaining the product history data based on the associated manufacturing entities, and sending a notification message to notify obtained product history data.