TOVARŇÁK, Daniel. Practical Multi-pattern Matching Approach for Fast and Scalable Log Abstraction. Online. In ICSOFT-EA 2016 - Proceedings of the 11th International Joint Conference on Software Technologies. Lisbon, Portugal: SCITEPRESS, 2016. p. 319-329. ISBN 978-989-758-194-6. Available from: https://dx.doi.org/10.5220/0006006603190329. [citováno 2024-04-24]
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Practical Multi-pattern Matching Approach for Fast and Scalable Log Abstraction
Authors TOVARŇÁK, Daniel (203 Czech Republic, guarantor, belonging to the institution)
Edition Lisbon, Portugal, ICSOFT-EA 2016 - Proceedings of the 11th International Joint Conference on Software Technologies, p. 319-329, 11 pp. 2016.
Publisher SCITEPRESS
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Confidentiality degree is not subject to a state or trade secret
Publication form printed version "print"
WWW URL
RIV identification code RIV/00216224:14330/16:00091170
Organization unit Faculty of Informatics
ISBN 978-989-758-194-6
Doi http://dx.doi.org/10.5220/0006006603190329
UT WoS 000391095600037
Keywords in English Log Processing; Pattern Matching; Log Abstraction; Big Data
Tags firank_B
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 13/5/2020 19:19.
Abstract
Log abstraction, i.e. the separation of static and dynamic part of log message, is becoming an indispensable task when processing logs generated by large enterprise systems and networks. In practice, the log message types are described via regex matching patterns that are in turn used to actually facilitate the abstraction process. Although the area of multi-regex matching is well studied, there is a lack of suitable practical implementations available for common programming languages. In this paper we present an alternative approach to multi-pattern matching for the purposes of log abstraction that is based on a trie-like data structure we refer to as regex trie. REtrie is easy to implement and the real world experiments show its scalability and good performance even for thousands of matching patterns.
PrintDisplayed: 24/4/2024 13:52