Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Tingtao Sun

dblp:43/10103 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
3since 2021 · last 2024
0000-0002-3334-1309ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3 · 3 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
3 papers
Storage systems · 82% Cloud and datacenter computing · 18%
Databases, data mining, and information retrieval
1 paper
Query processing and optimization · 100%
Software engineering, system software, and programming languages
1 paper
Program analysis · 100%

Topics — the 4 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Storage systems › logging
log storage
1.422024
Exploiting Data-pattern-aware Vertical Partitioning to Achieve Fast and Low-cost Cloud Log Storage · ACM Trans. Storage 2024
LogGrep: Fast and Cheap Cloud Log Storage by Exploiting both Static and Runtime Patterns · EuroSys 2023
Storage systems › data compression
log compression
1.222023
LogGrep: Fast and Cheap Cloud Log Storage by Exploiting both Static and Runtime Patterns · EuroSys 2023
On the Feasibility of Parser-based Log Compression in Large-Scale Cloud Systems · FAST 2021
Storage systems
data layout
0.212024
Exploiting Data-pattern-aware Vertical Partitioning to Achieve Fast and Low-cost Cloud Log Storage · ACM Trans. Storage 2024
Storage systems › data placement
vertical partitioning
0.212024
Exploiting Data-pattern-aware Vertical Partitioning to Achieve Fast and Low-cost Cloud Log Storage · ACM Trans. Storage 2024

Methods — techniques the papers use, named apart from their topics

static and runtime pattern exploitation · 1.3parsing · 1.0static and runtime pattern extraction · 0.8partial reconstruction · 0.8incremental locating · 0.8capsule summarization · 0.8
YearPublicationVenuePosition
2024 Exploiting Data-pattern-aware Vertical Partitioning to Achieve Fast and Low-cost Cloud Log Storage
abstract
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.
Junyu Wei, Guangyan Zhang, Junchao Chen 0005, Yang Wang 0009, Tingtao Sun, Jiesheng Wu, Jiangwei Jiang
ACM Trans. Storage6
2023 LogGrep: Fast and Cheap Cloud Log Storage by Exploiting both Static and Runtime Patterns
abstract
In cloud systems, near-line logs are mainly used for debugging, which means they prefer a low query latency for a better user experience, and like any other logs, they also prefer a low overall cost including storage cost to store compressed logs and computation cost to compress logs and execute queries.
Junyu Wei, Guangyan Zhang, Junchao Chen 0005, Yang Wang 0009, Tingtao Sun, Jiesheng Wu, Jiangwei Jiang
EuroSys6
2021 On the Feasibility of Parser-based Log Compression in Large-Scale Cloud Systems
Junyu Wei, Guangyan Zhang, Yang Wang 0009, Zhanyang Zhu, Junchao Chen 0005, Tingtao Sun, Qi Zhou 0001
FAST7
2012 Performance problems diagnosis in cloud computing systems by mining request trace logs
abstract
In cloud computing systems, end-to-end request tracing approach is helpful for developers to understand the runtime behavior of user requests. Based on trace logs, we propose an approach to localize the abnormal methods that are the primary causes of performance problems. Our approach involves three steps: (1) cluster the user requests into different categories according to request call sequences and select major categories; (2) extract the principal methods that might be the causes of performance degradation; (3) pick out abnormal methods from those principal methods in each major category. We conduct four cases of performance degradations to validate our approach over a real-world enterprise-class cloud computing platform. The experimental results show that our approach can locate the prime causes of performance problems with low false-positive rate and false-negative rate.
Haibo Mi, Huaimin Wang 0001, Gang Yin, Hua Cai, Tingtao Sun
NOMS6