Demo Data from VLDB 2026 / reviewers in the wild / expert
Xiaofan Cai
dblp:411/2483
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, 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.
| Databases, data mining, and information retrieval
1 paper |
Database system architecture and tuning · 87% Transaction processing and concurrency control · 13% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Database system architecture and tuning › configuration tuning
knob tuning |
0.9 | 1 | 2025 | SCompression: Enhancing Database Knob Tuning Efficiency Through Slice-Based OLTP Workload Compression · Proc. VLDB Endow. 2025 |
Database system architecture and tuning › workload management
workload reduction |
0.9 | 1 | 2025 | SCompression: Enhancing Database Knob Tuning Efficiency Through Slice-Based OLTP Workload Compression · Proc. VLDB Endow. 2025 |
Transaction processing and concurrency control
OLTP |
0.3 | 1 | 2025 | SCompression: Enhancing Database Knob Tuning Efficiency Through Slice-Based OLTP Workload Compression · Proc. VLDB Endow. 2025 |
Methods — techniques the papers use, named apart from their topics
slice-based compression · 0.9cluster-based sampling · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | SCompression: Enhancing Database Knob Tuning Efficiency Through Slice-Based OLTP Workload CompressionabstractWorkload execution can account for 90% of the total database knob tuning time, which is often the bottleneck for efficient knob tuning in practice. Reducing the tuning time by using a compressed workload is a natural solution. However, many existing workload compression methods are designed for OLAP workloads, which reduce the number of queries needed for analysis tasks by sampling a small subset of queries. These methods are less effective for OLTP workloads in knob-tuning tasks, as they often disregard essential contextual details, including query sequence and concurrency. As a result, configurations that perform well on the compressed OLTP workload may not deliver similar competitive performance on the original workload. To address these challenges, we first define the objective of OLTP workload compression for knob tuning. We then propose a slice-based compression method, SCompression , which compresses workloads by slicing based on time intervals while preserving concurrency. SCompression achieves the objective by focusing on generating a compressed workload that (1) executes faster than the original workload and (2) produces performance variations similar to the source workload under different configurations. SCompression works in three steps: (1) dividing the workload into segments to capture regular performance fluctuations, (2) slicing each segment to preserve concurrency and transaction context, and (3) sampling slices under execution time constraints using a cluster-based approach to ensure representativeness. Finally, SCompression replays the compressed workload to produce the performance that mirrors the source workload. Extensive experiments on real-world and benchmark OLTP workloads show that SCompression is a cost-effective solution for knob tuning, accelerating tuning by up to 40× with only a 5% performance reduction. Baoqing Cai, Yu Liu 0040, Lin Ma 0006, Pingqi Huang, Bingcheng Lian, Ke Zhou 0001, Jia Yuan, Xiaofan Cai, Peijun Wu |
Proc. VLDB Endow. | 9 |