Table of Contents
Fetching ...

WAter: A Workload-Adaptive Knob Tuning System based on Workload Compression

Yibo Wang, Jiale Lao, Chen Zhang, Cehua Yang, Jianguo Wang, Mingjie Tang

Abstract

Selecting appropriate values for the configurable parameters of Database Management Systems (DBMS) to improve performance is a significant challenge. Recent machine learning (ML)-based tuning systems have shown strong potential, but their practical adoption is often limited by the high tuning cost. This cost arises from two main factors: (1) the system needs to evaluate a large number of configurations to identify a satisfactory one, and (2) for each configuration, the system must execute the entire target workload on the DBMS, which is both time-consuming. Existing studies have primarily addressed the first factor by improving sample efficiency, that is, by reducing the number of configurations evaluated. However, the second factor, improving runtime efficiency by reducing the time required for each evaluation, has received limited attention and remains an underexplored direction. We develop WAter, a runtime-efficient and workload-adaptive tuning system that finds near-optimal configurations at a fraction of the tuning cost compared with state-of-the-art methods. We divide the tuning process into multiple time slices and evaluate only a small subset of queries from the workload in each slice. Different subsets are evaluated across slices, and a runtime profile is used to dynamically identify more representative subsets for evaluation in subsequent slices. At the end of each time slice, the most promising configurations are evaluated on the original workload to measure their actual performance. Evaluations demonstrate that WAter identifies the best-performing configurations with up to 73.5% less tuning time and achieves up to 16.2% higher performance than the best-performing alternative.

WAter: A Workload-Adaptive Knob Tuning System based on Workload Compression

Abstract

Selecting appropriate values for the configurable parameters of Database Management Systems (DBMS) to improve performance is a significant challenge. Recent machine learning (ML)-based tuning systems have shown strong potential, but their practical adoption is often limited by the high tuning cost. This cost arises from two main factors: (1) the system needs to evaluate a large number of configurations to identify a satisfactory one, and (2) for each configuration, the system must execute the entire target workload on the DBMS, which is both time-consuming. Existing studies have primarily addressed the first factor by improving sample efficiency, that is, by reducing the number of configurations evaluated. However, the second factor, improving runtime efficiency by reducing the time required for each evaluation, has received limited attention and remains an underexplored direction. We develop WAter, a runtime-efficient and workload-adaptive tuning system that finds near-optimal configurations at a fraction of the tuning cost compared with state-of-the-art methods. We divide the tuning process into multiple time slices and evaluate only a small subset of queries from the workload in each slice. Different subsets are evaluated across slices, and a runtime profile is used to dynamically identify more representative subsets for evaluation in subsequent slices. At the end of each time slice, the most promising configurations are evaluated on the original workload to measure their actual performance. Evaluations demonstrate that WAter identifies the best-performing configurations with up to 73.5% less tuning time and achieves up to 16.2% higher performance than the best-performing alternative.

Paper Structure

This paper contains 19 sections, 11 equations, 14 figures, 3 tables.

Figures (14)

  • Figure 1: Tuning Time Breakdown (Percentage)
  • Figure 2: Overview of Knob Tuning Paradigm
  • Figure 3: Tuning Subsets VS Tuning the Original Workload
  • Figure 4: Overview of the Components in the WAter System
  • Figure 5: WAter Tuning Workflow
  • ...and 9 more figures

Theorems & Definitions (9)

  • definition 1: Original Workload
  • definition 2: Compressed Workload
  • definition 3: Query Cost
  • definition 4: Compression Ratio
  • definition 5: Run History
  • definition 6: Representativity
  • definition 7: Lacked History
  • definition 8: Uncertainty
  • definition 9: SetSimilarity