Practical Multi-pattern Matching Approach for Fast and Scalable
Log Abstraction

D 2016

Practical Multi-pattern Matching Approach for Fast and Scalable Log Abstraction

TOVARŇÁK, Daniel

Základní údaje

Originální název

Practical Multi-pattern Matching Approach for Fast and Scalable Log Abstraction

Autoři

TOVARŇÁK, Daniel (203 Česká republika, garant, domácí)

Vydání

Lisbon, Portugal, ICSOFT-EA 2016 - Proceedings of the 11th International Joint Conference on Software Technologies, od s. 319-329, 11 s. 2016

Nakladatel

SCITEPRESS

Další údaje

Jazyk

angličtina

Typ výsledku

Stať ve sborníku

Obor

10201 Computer sciences, information science, bioinformatics

Utajení

není předmětem státního či obchodního tajemství

Forma vydání

tištěná verze "print"

Odkazy

URL

Kód RIV

RIV/00216224:14330/16:00091170

Organizační jednotka

Fakulta informatiky

ISBN

978-989-758-194-6

DOI

http://dx.doi.org/10.5220/0006006603190329

UT WoS

000391095600037

Klíčová slova anglicky

Log Processing; Pattern Matching; Log Abstraction; Big Data

Štítky

core_B, firank_B

Změněno: 13. 5. 2020 19:19, RNDr. Pavel Šmerk, Ph.D.

Anotace

V originále

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.

Citovat

TOVARŇÁK, Daniel. Practical Multi-pattern Matching Approach for Fast and Scalable Log Abstraction. In ICSOFT-EA 2016 - Proceedings of the 11th International Joint Conference on Software Technologies. Lisbon, Portugal: SCITEPRESS, 2016, s. 319-329. ISBN 978-989-758-194-6. Dostupné z: https://dx.doi.org/10.5220/0006006603190329.

@inproceedings{1356567,
   author = {Tovarňák, Daniel},
   address = {Lisbon, Portugal},
   booktitle = {ICSOFT-EA 2016 - Proceedings of the 11th International Joint Conference on Software Technologies},
   doi = {http://dx.doi.org/10.5220/0006006603190329},
   keywords = {Log Processing; Pattern Matching; Log Abstraction; Big Data},
   howpublished = {tištěná verze "print"},
   language = {eng},
   location = {Lisbon, Portugal},
   isbn = {978-989-758-194-6},
   pages = {319-329},
   publisher = {SCITEPRESS},
   title = {Practical Multi-pattern Matching Approach for Fast and Scalable Log Abstraction},
   url = {http://www.scitepress.org/DigitalLibrary/PublicationsDetail.aspx?ID=SFHlGUrQnPo=&t=1},
   year = {2016}
}

TY  - JOUR
ID  - 1356567
AU  - Tovarňák, Daniel
PY  - 2016
TI  - Practical Multi-pattern Matching Approach for Fast and Scalable Log Abstraction
PB  - SCITEPRESS
CY  - Lisbon, Portugal
SN  - 9789897581946
KW  - Log Processing
KW  - Pattern Matching
KW  - Log Abstraction
KW  - Big Data
UR  - http://www.scitepress.org/DigitalLibrary/PublicationsDetail.aspx?ID=SFHlGUrQnPo=&t=1
N2  - 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.
ER  -

TOVARŇÁK, Daniel. Practical Multi-pattern Matching Approach for Fast and Scalable Log Abstraction. In \textit{ICSOFT-EA 2016 - Proceedings of the 11th International Joint Conference on Software Technologies}. Lisbon, Portugal: SCITEPRESS, 2016, s.~319-329. ISBN~978-989-758-194-6. Dostupné z: https://dx.doi.org/10.5220/0006006603190329.

Podrobný výpis o publikaci