Dynamic Time-Series Data Compression Algorithm Selection

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

The transmission of time-series data from sources to destinations burdens networks and often requires inefficient compression methods, which may not guarantee reduction in data size for all input datasets, leading to suboptimal network performance and storage demands.

Innovation Solution

A method that dynamically selects the best-fit compression algorithm for time-series data by profiling and sampling the data stream, synchronizing the source and destination, and periodically optimizing the compression algorithm based on time density and performance metrics to avoid inappropriate compression.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Quantity of substance

If compression algorithms are applied to time-series data, then data size is reduced, but network bandwidth requirements may still be insufficient for massive datasets

Engineering Contradiction:
Improvedata sizeVSAvoidnetwork bandwidth efficiency
Core Design Contradiction:
Quantity of substanceVSProductivity

Solution Approach 1:

The system dynamically adapts compression parameters and algorithms based on real-time analysis of data characteristics, time density, and compression performance metrics. This allows the compression process to optimize for both data size reduction and network transmission efficiency under varying conditions

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The system changes compression parameters such as time density thresholds, sampling intervals, and algorithm selection based on analyzed data characteristics. By adjusting these parameters dynamically, the system achieves better compression ratios while maintaining network bandwidth efficiency

Inventive Principle:
Principle #35Parameter changes

2Ease of manufacture

If fixed compression algorithms are used, then implementation is simple, but compression performance is suboptimal for varying data characteristics

Engineering Contradiction:
Improveimplementation simplicityVSAvoidcompression performance
Core Design Contradiction:
Ease of manufactureVSProductivity

Solution Approach 1:

The system segments the compression process into distinct phases: data characteristic analysis, time density determination, candidate algorithm evaluation, and selective application. This modular approach maintains implementation simplicity while enabling optimal compression performance for different data types

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The system changes compression parameters including algorithm selection, time density thresholds, and sampling intervals based on analyzed data characteristics. This allows the system to adapt to varying data patterns while maintaining a relatively simple implementation framework

Inventive Principle:
Principle #35Parameter changes

3Quantity of substance

If compression is applied to all time-series data, then data size is reduced, but worst-case performance may occur for certain data patterns

Engineering Contradiction:
Improvedata size reductionVSAvoidcompression reliability
Core Design Contradiction:
Quantity of substanceVSReliability

Solution Approach 1:

The system performs preliminary analysis of data characteristics and time density before applying compression. This preliminary action identifies suitable candidate algorithms and determines optimal compression parameters, avoiding worst-case scenarios by selecting appropriate compression methods in advance

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The system uses feedback from data characteristic analysis and compression performance metrics to adjust compression strategy. By monitoring compression results and data patterns, the system can avoid applying inappropriate compression that would lead to worst-case performance

Inventive Principle:
Principle #23Feedback

4Productivity

If dynamic algorithm selection is implemented, then compression optimality is improved, but system complexity increases

Engineering Contradiction:
Improvecompression optimalityVSAvoidsystem complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The system segments the complex dynamic selection process into manageable modules: data profiling, time density calculation, candidate algorithm ranking, and selection. Each module handles a specific aspect of the problem, reducing overall system complexity while maintaining compression optimality

Inventive Principle:
Principle #1Segmentation

Data Source

PatentUS10827039B1Systems and methods for dynamic compression of time-series data
Publication Date: 2020.11.03 QUEST SOFTWARE INC
  • US10827039B1 patent drawing
  • US10827039B1 patent drawing
  • US10827039B1 patent drawing

AI summary

In an embodiment, a method includes receiving, from a data source, time-series data of a time-series data stream produced by the data source. The method further includes identifying a target compression algorithm for the time-series data, wherein the target compression algorithm is linked to the data source in memory pursuant to a dynamically-variable assignment. The method also includes compressing the time-series data using the target compression algorithm and transmitting the compressed time-series data to a destination. Furthermore the method includes periodically optimizing the dynamically-variable assignment in real-time as the time-series data is received.