Workload-Aware Incremental Reclustering in Cloud Data Warehouses
Modern cloud data warehouses store data in micro-partitions and rely on metadata (e.g., zonemaps) for efficient data pruning during query processing. Maintaining data clustering in a large-scale table is crucial for effective data pruning. Existing automatic clustering approaches lack the flexibility required in dynamic cloud environments with continuous data ingestion and evolving workloads. This paper advocates a clean separation between reclustering policy and clustering-key selection. We introduce the concept of boundary micro-partitions that sit on the boundary of query ranges. We then present WAIR, a workload-aware algorithm to identify and recluster only boundary micro-partitions most critical for pruning efficiency. WAIR achieves near-optimal (with respect to fully sorted table layouts) query performance but incurs significantly lower reclustering cost with a theoretical upper bound. We further implement the algorithm into a prototype reclustering service and evaluate on standard benchmarks (TPC-H, DSB) and a real-world workload. Results show that WAIR improves query performance and reduces the overall cost compared to existing solutions.
Authors
- Renfei Zhou (ORCID: https://orcid.org/0000-0002-0095-0626)
- Yipeng Liu (ORCID: https://orcid.org/0000-0003-2084-8781)
- Jiaqi Yan (ORCID: https://orcid.org/0009-0008-5297-7557)
- Huanchen Zhang (ORCID: https://orcid.org/0009-0001-4821-1558)
Institutions
- Universidad San Carlos (PY)
- Carnegie Mellon University (US)
- Tsinghua University (CN)
Publication Details
- Journal
- Proceedings of the ACM on Management of Data
- Published
- 2026-05-18
- DOI
- https://doi.org/10.1145/3802127
- Primary Topic
- Cloud Computing and Resource Management
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China