{"id":1166,"date":"2020-03-01T11:32:17","date_gmt":"2020-03-01T10:32:17","guid":{"rendered":"http:\/\/blog.zhaw.ch\/splab\/?p=1166"},"modified":"2020-03-02T16:44:12","modified_gmt":"2020-03-02T15:44:12","slug":"log-files-semantic-compression-and-learned-attribute-based-notifications","status":"publish","type":"post","link":"https:\/\/blog.zhaw.ch\/splab\/2020\/03\/01\/log-files-semantic-compression-and-learned-attribute-based-notifications\/","title":{"rendered":"Log files: Semantic compression and learned attribute-based notifications"},"content":{"rendered":"\n

Many providers of hosted services, including cloud applications, are subject to a contradiction in handling log data. On the one hand, storing logs consumes resources and should be minimised or avoided altogether to save resource cost. On the other hand, regulatory constraints such as keeping the data for the purpose of future audits exist. A smart solution to encode the data appropriately needs to be found. The coding encompasses both compression, to keep resource use low, and encryption, to prevent leaking information to unauthorised parties, for instance when logging for the purpose of intrusion detection. On an algorithmic level, the encoded data should still be usable for computation, in particular comparison and search. In this blog post, based on the didactic log example shown in the figure below, we present algorithms and architectures to handle cloud log files in a smart way.<\/p>\n\n\n\n

\"\"<\/figure>\n\n\n\n\n\n\n\n

The example shows two hypothetic log lines, both simplified by not carrying timestamp or associated device information. When the first line is parsed, the significance of any information contained therein can only be evaluated by using named-entity recognition and rule-\/pattern-based entity extraction<\/a>. When the second line is parsed, byte-level and contextual differences to the previous one can also be taken into account. A sound approach is therefore to combine both techniques, extract the significant data parts, and compress the remainder with good to excellent compression ratios, aided by long log files with almost monotonic but not quite identical messages.<\/p>\n\n\n\n

Finding differences the right way is not trivial<\/a>. Apart from byte-level identification of changes, insertions or removals, context elements such as separators (spaces, commas, semicolons) need to be considered to reduce unnecessary diffs.<\/p>\n\n\n\n

Beyond the algorithm, an architectural integration is needed. A sound approach is to divide the system into four parts: log file provisioning (this part is optional and is typically implemented already with network logging<\/a>), file parsing and semantic detection of attributes along with attribute-based compression, interactive attribute-based search<\/a>, and attribute-based alerting and notification. The following figure shows the architecture, again in simplified form, of the algorithmic-architectural approach called “Semlog”<\/em> for semantic log handling.<\/p>\n\n\n\n

\"\"<\/figure>\n\n\n\n

All of this appears to be over-engineered at first. Why not just compress with gzip, use zgrep for search, and something based on ztail for notification? Oh wait, there is no ztail (yet<\/a>)… and the other “Z commands”<\/a> may also have their drawbacks, however established they may be on today’s systems, in particular regarding memory use and operation speed.<\/p>\n\n\n\n

Furthermore, the system should not only use with static logfiles, but instead also with continuous log streams. Given the modular architecture, which could be implemented as command-line tools or microservices, and the preference for JSON for structured messaging among developers, partial JSON stream processing using JSONpath<\/a> is another suitable ingredient for convenient programmatic access. In contrast to typical DOM-style document parsing, the document can still be incomplete, yet in contrast to SAX-style stream parsing, not every opening and closing brace needs to be accounted for in code. Instead, triggers are set on whole blocks identified with these paths.<\/p>\n\n\n\n

The implementation thus consists of four parts:<\/p>\n\n\n\n