Hierarchical Log Storage with Pointer-Based Compression
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing log processing systems consume large amounts of storage space and computing resources due to the need for long-term storage of logs, and they do not efficiently manage logs to reduce storage requirements.
Innovation Solution
A computer-implemented method that creates a hierarchical structure to identify primary and secondary relationships between log messages, adds pointers to primary messages with secondary messages, removes duplicate secondary messages, and saves header and content information to form compressed log information, reducing storage needs.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If logs are stored in traditional flat structure without compression, then log retrieval is simple and fast, but storage space consumption is large
Solution Approach 1:
The patent segments log messages into hierarchical groups based on primary and secondary relationships. Primary log messages serve as parent nodes while secondary log messages become child nodes, creating a segmented structure that eliminates redundancy. This segmentation reduces storage space by storing each unique log message only once while maintaining retrieval efficiency through the hierarchical organization.
Solution Approach 2:
The patent implements a nested hierarchical structure where primary log messages contain references to secondary log messages, which may themselves contain tertiary log messages. This nesting approach allows the system to store log messages in a compact tree structure where parent nodes reference child nodes, significantly reducing the total storage required while preserving the ability to retrieve any log message through its hierarchical path.
2Loss of information
If all log messages are stored in full detail, then complete information is preserved, but processing resources increase
Solution Approach 1:
The patent creates a compressed copy of the log storage structure where secondary and tertiary log messages are stored once in the hierarchical tree rather than being duplicated in every parent context. The system maintains information completeness by preserving references and relationships in the hierarchical structure, while the compressed format reduces processing resources needed for storage and retrieval operations.
3Quantity of substance
If hierarchical structure with pointers is implemented, then storage efficiency improves, but retrieval complexity increases
Solution Approach 1:
The patent performs preliminary organization of log messages into a hierarchical structure with pre-established pointers and references. By pre-processing logs to create the tree structure with primary, secondary, and tertiary relationships before retrieval operations, the system enables efficient access through the organized hierarchy. The preliminary structuring reduces retrieval complexity compared to searching through uncompressed flat log data, as the hierarchical paths provide direct access routes to specific log messages.
Data Source
AI summary
An approach for managing log messages. In this approach, a hierarchical structure identifies primary and secondary relationships between the log messages. In this approach, primary log messages in the log messages that has one or more secondary log messages is identified using the hierarchical structure. One or more pointers are added to each primary log message in the log messages having the one or more secondary log messages. Each pointer points to a secondary log message in the hierarchical structure. The one or more secondary log messages are removed from the log messages to form remaining log messages. Header information from log message headers and content information from log message content in the remaining log messages are saved to form compressed log information.