Cache Node Data Visualization for Supply Chain

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Global companies face inefficiencies and operational delays in managing and visualizing complex supply chain data due to lack of transparency and compliance issues, especially with increased global sourcing and complex logistics networks, which hinder regulatory compliance and adaptability to changing demand.

Innovation Solution

A computer-implemented method and system for data visualization that creates a cache node in a database for search parameters, identifies and stores search results, and provides visualization options, allowing for fast access and updating of data through a graphical user interface, utilizing an internal queue system and worker processes to maintain data relevance.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Speed

If traditional data visualization methods are used for complex supply chain data, then data can be displayed, but data processing speed is slow and access time is long

Engineering Contradiction:
Improvedata processing speedVSAvoiddata access time
Core Design Contradiction:
SpeedVSLoss of time

Solution Approach 1:

The patent implements a caching mechanism that pre-processes and stores search results in cache nodes before they are needed. When a search is performed, the system checks the cache first and retrieves pre-computed results, avoiding repeated processing of the same data. This preliminary action significantly reduces data access time and improves processing speed for frequently requested supply chain information.

Inventive Principle:
Principle #10Preliminary action

2Loss of information

If detailed supply chain data is visualized, then transparency is improved, but data complexity and noise increase

Engineering Contradiction:
Improvedata transparencyVSAvoiddata structure complexity
Core Design Contradiction:
Loss of informationVSDevice complexity

Solution Approach 1:

The patent segments supply chain data into hierarchical levels (e.g., executive summary, detailed operational data, raw transaction data). Users can select their desired level of detail, and the system retrieves only the relevant segment from the cache. This segmentation maintains transparency by providing access to detailed data when needed while reducing complexity by defaulting to summarized views, allowing users to drill down only when necessary.

Inventive Principle:
Principle #1Segmentation

3Reliability

If real-time updates are implemented for supply chain data, then data relevance is improved, but system resource consumption increases

Engineering Contradiction:
Improvedata relevanceVSAvoidsystem resource consumption
Core Design Contradiction:
ReliabilityVSUse of energy by moving object

Solution Approach 1:

The patent implements a periodic update mechanism where cache nodes are refreshed at scheduled intervals or based on event triggers (e.g., when new supply chain data becomes available). Instead of continuous real-time updates, the system periodically checks for changes and updates cache nodes accordingly. This periodic action maintains data relevance and reliability while significantly reducing system resource consumption compared to continuous real-time synchronization.

Inventive Principle:
Principle #19Periodic action

Data Source

PatentUS11789959B2Data visualization method
Publication Date: 2023.10.17 S&P GLOBAL INC
  • US11789959B2 patent drawing
  • US11789959B2 patent drawing
  • US11789959B2 patent drawing

AI summary

A method for data visualization is provided. The method comprises receiving an input comprising a number of search parameters and then creating a cache node for the number of search parameters in the database, wherein the cache node comprises a first reference associated with the number of search parameters. Then identifying a number of search results related to the number of search parameters and storing the number of search results related to the number of search parameters in the cache node. Further, identifying a number of visualization options related to the number of search results stored in the cache node, wherein each visualization option comprises a second reference associated with the cache node.