Graph Dictionary Compression for Digital Metrics Across Time Slices
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional metric compression systems are inflexible and inefficient due to their reliance on static compression dictionaries and limited temporal compression, leading to high computational and bandwidth demands.
Innovation Solution
The implementation of a graph-based compression dictionary that dynamically updates nodes and edges, allowing for delta compression across time slices and windows, enabling flexible and efficient compression of metric data for both server-to-server and server-to-client communication.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If conventional static compression dictionaries are used, then implementation is simple, but compression efficiency and flexibility are poor
Solution Approach 1:
The patent transforms the static compression dictionary into a dynamic graph-based structure that adapts to metric data characteristics. The graph compression dictionary dynamically adjusts its structure based on the relationships between metric labels, enabling efficient compression while maintaining flexibility to handle varying data patterns without requiring complete dictionary replacements.
Solution Approach 2:
The patent segments metric labels into hierarchical components (prefixes, suffixes, and intermediate nodes) within the graph structure. This segmentation allows the compression system to process and compress metric data in manageable parts, improving efficiency while the graph structure maintains the relationships between segments for accurate reconstruction.
2Adaptability or versatility
If compression dictionaries are updated to handle new metrics, then adaptability improves, but bandwidth consumption increases due to transmitting full updates
Solution Approach 1:
The patent extracts only the necessary portions of the graph structure for updates. When the compression dictionary needs to adapt to new metrics, the system identifies and transmits only the specific graph nodes, edges, or subgraphs that contain new or modified metric information, rather than transmitting the entire dictionary. This dramatically reduces bandwidth consumption while maintaining adaptability.
Solution Approach 2:
The patent performs preliminary analysis to identify which parts of the graph structure require updates before initiating the transmission process. By pre-processing the dictionary to determine minimal update sets, the system prepares efficient update packets that contain only necessary changes, reducing bandwidth usage while ensuring the dictionary remains adaptive to new metrics.
3Productivity
If metric data is compressed across time windows, then compression ratio improves, but computational complexity increases
Solution Approach 1:
The patent applies delta compression dynamically across time windows by comparing metric values at different time points and encoding only the differences. This approach achieves high compression ratios for time-series metric data while the computational complexity is managed through efficient delta calculation algorithms that process only changed values rather than complete data sets.
4Adaptability or versatility
If graph-based compression dictionary is used, then compression flexibility improves, but initial setup and traversal complexity increases
Solution Approach 1:
The patent performs preliminary organization of metric labels into the graph structure during dictionary construction, establishing optimized traversal paths and node connections in advance. This preliminary setup reduces the complexity of graph traversal during actual compression operations, as the structure is pre-configured for efficient navigation rather than requiring complex real-time decision-making during compression.
Data Source
AI summary
The present disclosure relates to systems, methods, and non-transitory computer-readable media that generate compressed metric data for digital metrics utilizing a graph-based compression dictionary and time slice compression. For instance, the disclosed systems can utilize a dynamically modifiable graph-based compression dictionary to generate compressed metric label identifiers for metric labels of digital metrics. The graph-based compression dictionary can include nodes and edges corresponding to metric label segments and metric label identifier values, respectively. The disclosed systems can traverse the graph-based compression dictionary using a metric label to determine the corresponding compressed metric label identifier. The disclosed systems can further generate delta compression values for the metric values of the digital metrics. For instance, the disclosed systems can compare metric values within a single time slice (e.g., a time stamp) to generate corresponding delta compression values. In some cases, the disclosed systems further compare the metric values across a time window.