Towards Automated Log Parsing for Large-Scale Log Data Analysis
The DOI matches its Crossref record; 41 of the 42 references it cites were found in a registry or an index.
Abstract
Logs are widely used in system management for dependability assurance because they are often the only data available that record detailed system runtime behaviors in production. Because the size of logs is constantly increasing, developers (and operators) intend to automate their analysis by applying data mining methods, therefore structured input data (e.g., matrices) are required. This triggers a number of studies on log parsing that aims to transform free-text log messages into structured events. However, due to the lack of open-source implementations of these log parsers and benchmarks for performance comparison, developers are unlikely to be aware of the effectiveness of existing log parsers and their limitations when applying them into practice. They must often reimplement or redesign one, which is time-consuming and redundant. In this paper, we first present a characterization study of the current state of the art log parsers and evaluate their efficacy on five real-world datasets with over ten million log messages. We determine that, although the overall accuracy of these parsers is high, they are not robust across all datasets. When logs grow to a large scale (e.g., 200 million log messages), which is common in practice, these parsers are not efficient enough to handle such data on a single computer. To address the above limitations, we design and implement a parallel log parser (namely POP) on top of Spark, a large-scale data processing platform. Comprehensive experiments have been conducted to evaluate POP on both synthetic and real-world datasets. The evaluation results demonstrate the capability of POP in terms of accuracy, efficiency, and effectiveness on subsequent log mining tasks.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Introduction to information retrieval
(2009) · Choice Reviews Online · doi:10.5860/choice.46-2715 · Cited by 12,278
Introduction to Information Retrieval
Manning, C. D., Raghavan, P., & Schütze, H. (2008) · doi:10.1017/cbo9780511809071 · Cited by 11,288
Everitt, B. J., Landau, S., & Leese, M. (1974) · Cited by 9,358
Resilient distributed datasets: a fault-tolerant abstraction for in-memory cluster computing
Zaharia, M., Chowdhury, M., Das, T., Dave, A., Ma, J. H., McCauley, M., Franklin, M. J. M., Shenker, S. J., & Stoica, I. G. (2012) · UC Berkeley · Cited by 4,891
Everitt, B. S., Landau, S., Leese, M., & Stahl, D. (2011) · Wiley Series in Probability and Statistics · doi:10.1002/9780470977811 · Cited by 2,907
Detecting large-scale system problems by mining console logs
Xu, W., Huang, L., Fox, A., Patterson, D., & Jordan, M. I. (2009) · Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles · doi:10.1145/1629575.1629587 · Cited by 1,332 · cited 10×
“Furthermore, modern systems often integrate open-source software components written by hundreds of developers [3].”
BackgroundMethodInfluentialMinimum Spanning Trees and Single Linkage Cluster Analysis
Gower, J. C., & Ross, G. J. S. (1969) · Applied Statistics · doi:10.2307/2346439 · Cited by 1,223 · cited 1×
“To address over-parsing and further improve parsing accuracy, in this step, POP employs hierarchical clustering [27] to cluster similar groups based on their log events.”
MethodDiagnosing network-wide traffic anomalies
Lakhina, A., Crovella, M., & Diot, C. (2004) · Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1015467.1015492 · Cited by 1,039 · cited 1×
“However, the anomaly detection task evaluated is an important log mining task widely studied [37], [38], which is presented in a paper [3] enjoying more than 300 citations.”
BackgroundWhat Supercomputers Say: A Study of Five System Logs
Oliner, A., & Stearley, J. (2007) · 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07) · doi:10.1109/dsn.2007.103 · Cited by 620 · cited 2×
“Besides, we thank those who release log data [3], [33], [34], which greatly facilitates our research.”
MethodThe Complexity of Some Problems on Subsequences and Supersequences
Maier, D. (1978) · Journal of the ACM · doi:10.1145/322063.322075 · Cited by 616 · cited 1×
“The groups in the same cluster will be merged, and a new log event will be generated by calculating the Longest Common Subsequence (LCS) [28] of the original log events.”
Method
Research works printed but not linked: 4
- salfner, 2004, Comprehensive logfiles for autonomic systems, Proc 18th Int Parallel Distrib Process Symp
- krause, 1987, Taxicab Geometry
- gu, 2015, Proc 45th Annu IEEE/IFIP Int Conf Dependable Syst Netw, 57
- lang, 2013, Using SEC, LOGIN The USENIX Magazine, 38, 38
Cited by
Robust log-based anomaly detection on unstable log data
Zhang, X., Xu, Y., Lin, Q., Qiao, B., Zhang, H., Dang, Y., Xie, C., Yang, X., Cheng, Q., Li, Z., et al. (2019) · Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering · doi:10.1145/3338906.3338931 · Cited by 761
“Over the years, many automated log-based approaches have been proposed to detect system anomalies [3, 10, 18, 29, 44].”
BackgroundMethodInfluentialTools and benchmarks for automated log parsing
Zhu, J., He, S., Liu, J., He, P., Xie, Q., Zheng, Z., & Lyu, M. R. (2019) · 2019 IEEE/ACM 41st International Conference on Software Engineering: Software Engineering in Practice (ICSE-SEIP) · doi:10.1109/icse-seip.2019.00021 · Cited by 574
“[53] have studied large-scale log parsing through the parallelization on Spark.”
MethodSelf-citationSarker, I. H. (2021) · SN Computer Science · doi:10.1007/s42979-021-00765-8 · Cited by 570
A Survey on Automated Log Analysis for Reliability Engineering
He, S., He, P., Chen, Z., Yang, T., Su, Y., & Lyu, M. R. (2022) · ACM Computing Surveys · doi:10.1145/3460345 · Cited by 334
“ch [82] in logging practice and Deeplog [42] in anomaly detection. Besides machine learning, parallelization has been employed in various recent papers, such as Logzip [90] in log compression and POP [59] in log parsing. These extensive studies on automated log analysis across multiple core directions have largely boo…”
BackgroundMethodInfluentialSelf-citationUllah, F., Ullah, S., Srivastava, G., & Lin, J. C.-W. (2024) · Digital Communications and Networks · doi:10.1016/j.dcan.2023.03.008 · Cited by 266
Metadata
- Authors
- He, P., Zhu, J., He, S., Li, J., & Lyu, M. R.
- Affiliations
- Chinese University of Hong Kong, Shenzhen (CN)
- Huawei Technologies (China) (CN)
- Venue
- IEEE Transactions on Dependable and Secure Computing
- Published
- 2018-11-01
- Volume
- 15
- Issue
- 6
- Pages
- 931-944
- ISSN
- 1545-5971 (ISSN-L)
- 1941-0018
- 2160-9209
- OpenAlex
- W2762028850
- Cited by
- 230
- References
- 42
- Citations by year
- 2026: 12 · 2025: 26 · 2024: 28 · 2023: 40 · 2022: 23 · 2021: 45 · 2020: 30 · 2019: 18 · 2018: 8
- FWCI
- 10.19
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- IEEE Transactions on Dependable and Secure Computing (publishedVersion)
- Funders
- National Natural Science Foundation of China (61332010)
- Research Grants Council of the Hong Kong Special Administrative Region, China (CUHK 14205214)
- 2015 Microsoft Research Asia Collaborative Research Program (FY16-RES-THEME-005)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Software System Performance and Reliability
- Physical Sciences › Computer Science › Information Systems › Advanced Database Systems and Queries
- Physical Sciences › Computer Science › Information Systems › Software Engineering Research
- Keywords
- log parsing, log mining, Apache Spark, dependability assurance
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Towards Automated Log Parsing for Large-Scale Log Data Analysis. https://app.cochat.ai/papers/10.1109/tdsc.2017.2762673
- The paper
- He, P., Zhu, J., He, S., Li, J., & Lyu, M. R. (2018). Towards Automated Log Parsing for Large-Scale Log Data Analysis. IEEE Transactions on Dependable and Secure Computing. https://doi.org/10.1109/tdsc.2017.2762673
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.