LogShrink: Effective Log Compression by Leveraging Commonality and Variability of Log Data
Authors: Xiaoyun Li, Hongyu Zhang, Van-Hoang Le, Pengfei Chen
AI-generated Key Points
- Log data plays a vital role in system execution by capturing events and states.
- The increasing scale of systems has led to a surge in log data generation, reaching several petabytes per day in production environments.
- Log compression is crucial to reduce storage burden while enabling comprehensive log analysis.
- Existing compression methods struggle to effectively leverage the unique characteristics of log data.
- A comprehensive empirical study identified key characteristics of log data that can enhance the compression process.
- LogShrink was introduced as an innovative and efficient log compression method that utilizes commonality and variability in log data.
- LogShrink employs an analyzer based on longest common subsequence and entropy techniques to identify shared patterns and differences within log messages for more compact representations.
- The clustering-based sequence sampler in LogShrink expedites the identification of commonality and variability in log data.
- Extensive experiments using 16 public datasets showcased LogShrink's superior performance over specific and general-purpose compression methods, achieving compression ratios ranging from 16% to 356% on average while maintaining reasonable speeds.
Abstract: Log data is a crucial resource for recording system events and states during system execution. However, as systems grow in scale, log data generation has become increasingly explosive, leading to an expensive overhead on log storage, such as several petabytes per day in production. To address this issue, log compression has become a crucial task in reducing disk storage while allowing for further log analysis. Unfortunately, existing general-purpose and log-specific compression methods have been limited in their ability to utilize log data characteristics. To overcome these limitations, we conduct an empirical study and obtain three major observations on the characteristics of log data that can facilitate the log compression task. Based on these observations, we propose LogShrink, a novel and effective log compression method by leveraging commonality and variability of log data. An analyzer based on longest common subsequence and entropy techniques is proposed to identify the latent commonality and variability in log messages. The key idea behind this is that the commonality and variability can be exploited to shrink log data with a shorter representation. Besides, a clustering-based sequence sampler is introduced to accelerate the commonality and variability analyzer. The extensive experimental results demonstrate that LogShrink can exceed baselines in compression ratio by 16% to 356% on average while preserving a reasonable compression speed.
Tools for this paper
Ask questions about this paper to our AI assistant
You can also chat with multiple papers at once here.
The previous summary was created more than a year ago and can be re-run (if necessary) by clicking on the Run button below.
Similar papers summarized with our AI tools
Navigate through even more similar papers through a
tree representationLook for similar papers (in beta version)
We compare the title and abstract with papers indexed in our database. For arXiv papers, we search within the same category; for DOI and other sources, we search across sources and subjects. You can rerun the search as our database grows.
Disclaimer: The AI-based summarization tool and virtual assistant provided on this website may not always provide accurate and complete summaries or responses. We encourage you to carefully review and evaluate the generated content to ensure its quality and relevance to your needs.