Management Computer Routing Data Requests via Metadata

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Conventional network monitoring systems face inefficiencies in data retrieval due to the need for complex data management and the requirement to know the attributes of data stored in multiple data stores, especially when data is dynamically updated, making it difficult to obtain aggregated data in real time and history.

Innovation Solution

A computer system with a management computer that analyzes data obtaining requests and determines the appropriate data store to retrieve data from based on metadata management information, including time attributes, allowing for efficient data retrieval without the user needing to know the attributes of the data stored.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If multiple data stores are constructed for different aggregation processes, then data retrieval efficiency is improved, but data store management complexity increases

Engineering Contradiction:
Improvedata retrieval efficiencyVSAvoiddata store management complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent introduces a management computer as an intermediary between the user and multiple data stores. The management computer receives data obtaining requests, analyzes them, determines the appropriate data store based on metadata, and issues requests to the correct data store. This mediator handles the complexity of managing multiple data stores, allowing users to retrieve data efficiently without directly dealing with the complexity of multiple data store constructions.

Inventive Principle:
Principle #24Intermediary (Mediator)

Solution Approach 2:

The system uses metadata management information that includes time attributes of data stored in each data store. The management computer refers to this metadata to determine which data store should be queried. This feedback mechanism allows the system to automatically route requests to the appropriate data store based on the characteristics of the requested data, improving retrieval efficiency while managing complexity through automated decision-making.

Inventive Principle:
Principle #23Feedback

2Adaptability or versatility

If data is stored in multiple data stores with different attributes, then data aggregation capability is improved, but user difficulty in identifying appropriate data store increases

Engineering Contradiction:
Improvedata aggregation capabilityVSAvoiduser difficulty in identifying data store
Core Design Contradiction:
Adaptability or versatilityVSEase of operation

Solution Approach 1:

The management computer serves as an intermediary that handles the complexity of identifying the appropriate data store. Instead of requiring users to know which data store contains the needed data, the management computer analyzes the data obtaining request, refers to metadata management information, and automatically determines the correct data store. This eliminates the burden on users while maintaining the versatility of having multiple specialized data stores.

Inventive Principle:
Principle #24Intermediary (Mediator)

Solution Approach 2:

The system performs preliminary organization of data into multiple data stores with different attributes (real-time, history, aggregated) before user requests are made. Metadata management information is prepared in advance, including time attributes and other characteristics of the data in each data store. When a user makes a request, the management computer can quickly determine the appropriate data store by referring to this pre-prepared metadata, without requiring the user to perform complex analysis.

Inventive Principle:
Principle #10Preliminary action

3Loss of information

If conventional search and aggregation processes are executed, then data can be obtained from logs, but data obtaining efficiency decreases

Engineering Contradiction:
Improvedata accessibilityVSAvoiddata obtaining time
Core Design Contradiction:
Loss of informationVSLoss of time

Solution Approach 1:

The patent segments data into multiple specialized data stores based on their characteristics (real-time data, historical data, aggregated data). Each data store is optimized for specific types of data retrieval. When a data obtaining request is received, the management computer determines which segmented data store contains the needed data and queries only that store, rather than searching through all data or executing complex aggregation processes on raw logs. This segmentation dramatically improves data obtaining efficiency while maintaining full data accessibility.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

Data is pre-processed and organized into appropriate data stores before user requests are made. Real-time data is stored in real-time data stores, historical data in history data stores, and aggregated data in dedicated aggregation data stores. Metadata is prepared in advance to describe the contents and characteristics of each data store. When users need data, the management computer can directly query the appropriate pre-organized data store without needing to perform time-consuming search and aggregation processes on raw data.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS10664496B2Computer system
Publication Date: 2020.05.26 HITACHI LTD
  • US10664496B2 patent drawing
  • US10664496B2 patent drawing
  • US10664496B2 patent drawing

AI summary

A computer system, comprising a plurality of computers; and a management computer, wherein a plurality of data stores which store data obtained from a data source and having differing attributes, wherein the management computer has a request allocation unit and holds metadata management information. The request allocation unit is configured to: refer to the metadata management information to select a candidate data store based on analysis results of the data obtaining request including the time attribute of the requested data; determine whether the requested data can be obtained from the candidate data store; determine a data store to which to issue a request for obtaining the requested data; and issue the request to the determined data store.