LogProb: Online Parsing Evolving Logs With Complex Parameters

To cope with the massive volume of log messages in complex systems, effective and accurate log parsers are crucial for system maintenance. However, existing log parsers have accuracy issues, particularly when handling evolving logs with complex structures. To address this, this paper proposes LogProb, an online log parsing method that incorporates a token state prediction component and a search tree-based template extraction component. The token state prediction component determines whether each token in a log message is static (template word) or dynamic (parameter value). The token sequence and predicted token states are parsed by the template extraction component to generate event templates. The extraction process includes two stages: identifying candidate templates with predicted static tokens, and using a fast matching algorithm to determine the final template. Experiments on 16 benchmark datasets show that LogProb outperforms state-of-the-art methods in accuracy while maintaining comparable efficiency.

Authors

Institutions

Publication Details

Journal
IEEE Access
Published
2025-01-01
DOI
https://doi.org/10.1109/access.2025.3569548
Primary Topic
Natural Language Processing Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

LogProb: Online Parsing Evolving Logs With Complex Parameters

Jiaming Mao, Zhimin Gu, Haitao Jiang, Yan Li et al.
IEEE Access
Natural Language Processing Techniques
article

LogProb: Online Parsing Evolving Logs With Complex Parameters

Jiaming Mao, Zhimin Gu, Haitao Jiang, Yan Li, Ziying Wang
article en

Abstract

To cope with the massive volume of log messages in complex systems, effective and accurate log parsers are crucial for system maintenance. However, existing log parsers have accuracy issues, particularly when handling evolving logs with complex structures. To address this, this paper proposes LogProb, an online log parsing method that incorporates a token state prediction component and a search tree-based template extraction component. The token state prediction component determines whether each token in a log message is static (template word) or dynamic (parameter value). The token sequence and predicted token states are parsed by the template extraction component to generate event templates. The extraction process includes two stages: identifying candidate templates with predicted static tokens, and using a fast matching algorithm to determine the final template. Experiments on 16 benchmark datasets show that LogProb outperforms state-of-the-art methods in accuracy while maintaining comparable efficiency.

IEEE AccessVol. 13
Shanghai Electric (China) (CN)
State Grid Jiangsu Electric Power
Openalex Percentile: Top 95%
Natural Language Processing Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.