LogFold: Compressing Logs with Structured Tokens and Hybrid Encoding

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Shan, Shiwen, Huo, Yintong, Zhong, Hongzhan, Wang, Zhining, Su, Yuxin, Zheng, Zibin
Format: Preprint
Published: 2026
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866908903453753344
author Shan, Shiwen
Huo, Yintong
Zhong, Hongzhan
Wang, Zhining
Su, Yuxin
Zheng, Zibin
author_facet Shan, Shiwen
Huo, Yintong
Zhong, Hongzhan
Wang, Zhining
Su, Yuxin
Zheng, Zibin
contents Logs are essential for diagnosing failures and conducting retrospective studies, leading many software organizations to retain log messages for a long time. Nevertheless, the volume of generated log data grows rapidly as software systems grow, necessitating an effective compression method. Apart from general-purpose compressors (e.g., Gzip, Bzip2), many recent studies developed log-specific compression algorithms, but they offer suboptimal performance because of (1) overlooking redundancies within certain complex tokens, and (2) lacking a fine-grained encoding strategy for diverse token types. This work uncovers a new redundancy pattern in structured tokens and proposes a new type-aware encoding strategy to improve log compression. Building on this insight, we introduce LogFold, a novel log compression method consisting of four components: a token analyzer to classifies tokens as structured, unstructured, or static types; a processor that mines recurring patterns within structured tokens based on their delimiter skeletons; a hybrid encoder that tailors data representation according to token types; and a packer that compresses the output into an archive file. Extensive experiments on 16 public log datasets demonstrate that LogFold surpasses state-of-the-art baselines, achieving average compression ratio improvements by 11.11%, with a compression speed of 9.842 MB/s. Ablation studies further indicate the importance of each component. We also conduct sensitivity analyses to verify LogFold's robustness and stability across various internal settings.
format Preprint
id arxiv_https___arxiv_org_abs_2603_20618
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle LogFold: Compressing Logs with Structured Tokens and Hybrid Encoding
Shan, Shiwen
Huo, Yintong
Zhong, Hongzhan
Wang, Zhining
Su, Yuxin
Zheng, Zibin
Software Engineering
Logs are essential for diagnosing failures and conducting retrospective studies, leading many software organizations to retain log messages for a long time. Nevertheless, the volume of generated log data grows rapidly as software systems grow, necessitating an effective compression method. Apart from general-purpose compressors (e.g., Gzip, Bzip2), many recent studies developed log-specific compression algorithms, but they offer suboptimal performance because of (1) overlooking redundancies within certain complex tokens, and (2) lacking a fine-grained encoding strategy for diverse token types. This work uncovers a new redundancy pattern in structured tokens and proposes a new type-aware encoding strategy to improve log compression. Building on this insight, we introduce LogFold, a novel log compression method consisting of four components: a token analyzer to classifies tokens as structured, unstructured, or static types; a processor that mines recurring patterns within structured tokens based on their delimiter skeletons; a hybrid encoder that tailors data representation according to token types; and a packer that compresses the output into an archive file. Extensive experiments on 16 public log datasets demonstrate that LogFold surpasses state-of-the-art baselines, achieving average compression ratio improvements by 11.11%, with a compression speed of 9.842 MB/s. Ablation studies further indicate the importance of each component. We also conduct sensitivity analyses to verify LogFold's robustness and stability across various internal settings.
title LogFold: Compressing Logs with Structured Tokens and Hybrid Encoding
topic Software Engineering
url https://arxiv.org/abs/2603.20618