Pith. sign in

REVIEW 2 cited by

Stronger, Cheaper and Demonstration-Free Log Parsing with LLMs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2406.06156 v2 pith:S7PPJCNC submitted 2024-06-10 cs.SE

classification cs.SE
keywords logsparsingllmsprocessdatalogbatcheroverheadparsers
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Log parsing, the process of converting raw log messages into structured formats, is an important initial step for automated analysis of logs of large-scale software systems. Traditional log parsers often rely on heuristics or handcrafted features, which may not generalize well across diverse log sources or require extensive model tuning. Recently, some log parsers have utilized powerful generative capabilities of large language models (LLMs). However, they heavily rely on demonstration examples, resulting in substantial overhead in LLM invocations. To address these issues, we propose LogBatcher, a cost-effective LLM-based log parser that requires no training process or labeled data. To leverage latent characteristics of log data and reduce the overhead, we divide logs into several partitions through clustering. Then we perform a cache matching process to match logs with previously parsed log templates. Finally, we provide LLMs with better prompt context specialized for log parsing by batching a group of logs from each partition. We have conducted experiments on 16 public log datasets and the results show that LogBatcher is effective and efficient for log parsing.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A Word is Worth 4-bit: Efficient Log Parsing with Binary Coded Decimal Recognition

    cs.CL 2025-06 conditional novelty 5.0 of 10

    A 312k-parameter character-level log parser using 4-bit BCD encoding matches LLM-based parser accuracy at up to 20x higher throughput.

  2. A Survey of AIOps in the Era of Large Language Models

    cs.SE 2025-06 conditional novelty 3.0 of 10

    A systematic survey that categorizes LLM-based AIOps research into four dimensions: data sources, tasks, methods, and evaluation, claiming to be the first comprehensive such overview.

Pith tools