Exploiting Data-pattern-aware Vertical Partitioning to Achieve Fast and Low-cost Cloud Log Storage

Использование вертикального разбиения с учетом шаблонов данных для создания быстрого и недорогого облачного хранилища журналов
Jiesheng Wu, Junyu Wei, Yang Wang, Guangyan Zhang, Junchao Chen, Tingtao Sun, Weimin Zheng, Jiangwei Jiang
2024-01-29

cloud log storagedata-pattern-aware vertical partitioningincremental locatinglog compression and queryruntime pattern extraction
Cloud logs can be categorized into on-line, off-line, and near-line logs based on the access frequency. Among them, near-line logs are mainly used for debugging, which means they prefer a low query latency for better user experience. Besides, the storage system for near-line logs prefers a low overall cost including the storage cost to store compressed logs, and the computation cost to compress logs and execute queries. These requirements pose challenges to achieving fast and cheap cloud log storage. This article proposes LogGrep, the first log compression and query tool that exploits both static and runtime patterns to properly structurize and organize log data in fine-grained units. The key idea of LogGrep is “vertical partitioning”: it stores each log entry into multiple partitions by first parsing logs into variable vectors according to static patterns and then extracting runtime pattern(s) automatically within each variable vector. Based on such runtime patterns, LogGrep further decomposes the variable vectors into fine-grained units called “Capsules” and stamps each Capsule with a summary of its values. During the query process, LogGrep can avoid decompressing and scanning Capsules that cannot match the keywords, with the help of the extracted runtime patterns and the Capsule stamps. We further show that the interactive debugging can well utilize the advantages of the vertical-partitioning-based method and mitigate its weaknesses as well. To this end, LogGrep integrates incremental locating and partial reconstruction to mitigate the read amplification incurred by vertical-partitioning-based method. We evaluate LogGrep on 37 cloud logs from the production environment of Alibaba Cloud and the public datasets. The results show that LogGrep can reduce the query latency and the overall cost by an order of magnitude compared with state-of-the-art works. Such results have confirmed that it is worthwhile applying a more sophisticated vertical-partitioning-based method to accelerate queries on compressed cloud logs.
1
During queries, LogGrep skips decompressing and scanning Capsules whose summaries and runtime patterns cannot match the requested keywords.
2
Evaluation on 37 Alibaba Cloud production and public datasets shows approximately an order-of-magnitude reduction in query latency and overall cost versus state-of-the-art methods.
3
Incremental locating and partial reconstruction mitigate read amplification, enabling interactive debugging despite vertical partitioning.
4
It parses log entries into variable vectors, extracts runtime patterns, and decomposes vectors into value-summary-stamped Capsules for selective querying.
5
LogGrep is presented as a log compression and query tool that exploits both static and runtime patterns through fine-grained vertical partitioning.

near-line cloud log storage and querying

the impact of data-pattern-aware vertical partitioning, runtime-pattern extraction, and selective Capsule reconstruction on query latency and overall storage/computation cost

Publication Details
Publication Date
2024-01-29
Journal
Publisher
ISSN
Cited by
3
Access Type
Author Information
Authors
Jiesheng Wu
Junyu Wei
Yang Wang
Guangyan Zhang
Junchao Chen
Tingtao Sun
Weimin Zheng
Jiangwei Jiang
Explore further
Open the scid.ai AI chat with a ready-made request: it will find papers on a similar topic and help build a literature review.
Find similar papers in the chat
Make a presentation
100%