简化预训练数据集,让基数估计模型更高效且不降性能。
Optimize Cardinality Estimation Model Pretraining by Simplifying the Training Datasets
- 用分组分布鲁棒优化筛选关键数据集,剔除低效样本。
- 新数据集仅需原大小的几分之一,零样本测试性能相当。
- 适合想降低训练成本、提升模型泛化性的数据库研究者。
基数估计是查询优化的关键,机器学习已显著提升其性能。为解决学习型基数估计器的‘冷启动’或迁移性差问题,已有研究提出跨多个数据集和工作负载的预训练模型。然而,现有方法通常对多数据集进行均匀采样,效率不高。本文通过应用分组分布鲁棒优化(Group DRO)发现,部分数据集对模型性能贡献更大。基于此,我们深入实验分析了预训练基数估计器受数据集与工作负载的影响。最终提出一种简化版训练数据集,规模仅为原有数据集的极小比例。大量实验表明,基于该简化数据集的预训练模型在零样本设置下仍可达到与现有模型相当的性能。
原文摘要 · Abstract (English)
The cardinality estimation is a key aspect of query optimization research, and its performance has significantly improved with the integration of machine learning. To overcome the "cold start" problem or the lack of model transferability in learned cardinality estimators, some pre-training cardinality estimation models have been proposed that use learning across multiple datasets and corresponding workloads. These models typically train on a dataset created by uniformly sampling from many datasets, but this approach may not be optimal. By applying the Group Distributionally Robust Optimization (Group DRO) algorithm to training datasets, we find that some specific training datasets contribute more significantly to model performance than others. Based on this observation, we conduct extensive experiments to delve deeper into pre-training cardinality estimators. Our results show how the performance of these models can be influenced by the datasets and corresponding workloads. Finally, we introduce a simplified training dataset, which has been reduced to a fraction of the size of existing pretraining datasets. Sufficient experimental results demonstrate that the pre-trained cardinality estimator based on this simplified dataset can still achieve comparable performance to existing models in zero-shot setups.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。