ScaleSense predicts per-query resource and latency quantiles from execution-plan graphs and uses them to choose cost-effective compute configurations, reporting a 76.7% relative improvement in constraint satisfaction over baselines.
Evaluating Learned Query Performance Prediction Models at LinkedIn: Challenges, Opportunities, and Findings
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Recent advancements in learning-based query performance prediction models have demonstrated remarkable efficacy. However, these models are predominantly validated using synthetic datasets focused on cardinality or latency estimations. This paper explores the application of these models to LinkedIn's complex real-world OLAP queries executed on Trino, addressing four primary research questions: (1) How do these models perform on real-world industrial data with limited information? (2) Can these models generalize to new tasks, such as CPU time prediction and classification? (3) What additional information available from the query plan could be utilized by these models to enhance their performance? (4) What are the theoretical performance limits of these models given the available data? To address these questions, we evaluate several models-including TLSTM, TCNN, QueryFormer, and XGBoost, against the industrial query workload at LinkedIn, and extend our analysis to CPU time regression and classification tasks. We also propose a multi-task learning approach to incorporate underutilized operator-level metrics that could enhance model understanding. Additionally, we empirically analyze the inherent upper bound that can be achieved from the models.
citation-role summary
citation-polarity summary
fields
cs.DB 1years
2026 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
ScaleSense: Cost-Intelligent Scaling Framework via Learned Resource Estimation in Alibaba AnalyticDB
ScaleSense predicts per-query resource and latency quantiles from execution-plan graphs and uses them to choose cost-effective compute configurations, reporting a 76.7% relative improvement in constraint satisfaction over baselines.