Real-Time Compressed Log Viewing via In-Memory Decompression Index

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Traditional log file systems store redundant information, consuming storage resources and complicating data analysis, and existing compression methods are inefficient for real-time decompression and storage optimization.

Innovation Solution

The method involves decompressing compressed log data in memory using a decompression index that maps message signatures to message templates, allowing for real-time viewing and navigation of log files without extracting the entire file, reducing storage needs and improving analysis efficiency.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Loss of information

If the entire compressed log file is decompressed for viewing, then complete log data is available for analysis, but storage requirements and processing time increase significantly

Engineering Contradiction:
Improvelog data accessibilityVSAvoidstorage requirements
Core Design Contradiction:
Loss of informationVSQuantity of substance

Solution Approach 1:

The patent divides the compressed log file into multiple blocks, where each block contains a portion of the compressed log messages. The system loads only the necessary blocks into memory for viewing, rather than decompressing the entire file. This segmentation allows selective access to log data, reducing storage requirements while maintaining data accessibility for analysis.

Inventive Principle:
Principle #1Segmentation

2Loss of information

If the entire compressed log file is decompressed for viewing, then complete log data is available for analysis, but processing time and system resources increase

Engineering Contradiction:
Improvelog data accessibilityVSAvoidprocessing time
Core Design Contradiction:
Loss of informationVSLoss of time

Solution Approach 1:

The patent pre-computes and stores a decompression index during the compression phase. This index contains mappings from compressed log messages to their original formats. When viewing log data, the system uses this pre-computed index to rapidly decompress and display only the necessary portions, avoiding the need to decompress the entire file and significantly reducing processing time.

Inventive Principle:
Principle #10Preliminary action

3Loss of information

If traditional log file systems store all log data, then complete log information is preserved, but storage resources are consumed and data analysis becomes complicated

Engineering Contradiction:
Improvelog information completenessVSAvoiddata analysis complexity
Core Design Contradiction:
Loss of informationVSDevice complexity

Solution Approach 1:

The patent introduces a decompression index as an intermediary structure that bridges the compressed log storage and the original log format. This index enables efficient translation between the compressed representation and the human-readable format, allowing complete log information to be preserved in compressed form while simplifying data analysis through rapid, on-demand decompression of only the necessary data portions.

Inventive Principle:
Principle #24Intermediary (Mediator)

Data Source

PatentUS11126531B2Real-time viewing tool for compressed log data
Publication Date: 2021.09.21 EMC IP HLDG CO LLC
  • US11126531B2 patent drawing
  • US11126531B2 patent drawing
  • US11126531B2 patent drawing

AI summary

Techniques are provided for decompression of compressed log data, such as for a real-time viewing of compressed log data. An exemplary method comprises: obtaining a compressed log file comprised of a plurality of compressed log messages, wherein a given compressed log message is comprised of one or more message variables and a message signature corresponding to a message template of the given compressed log message; and presenting a first subset of the compressed log file by translating, in memory, the message signatures of the compressed log messages within the first subset to corresponding message templates using a decompression index that maps a plurality of the message signatures to corresponding message templates. The first subset of the compressed log file may comprise a predefined number of lines surrounding a requested line of the compressed log file. In further variations, at least one additional subset of the compressed log file is precomputed using the disclosed decompression techniques.