Pith. sign in

REVIEW 1 cited by

Uncertainty Aware Query Execution Time Prediction

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1408.6589 v1 pith:QDV4QG4F submitted 2014-08-27 cs.DB

classification cs.DB
keywords predictionqueryexecutiontimeconstantserrorsuncertaintycost
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Predicting query execution time is a fundamental issue underlying many database management tasks. Existing predictors rely on information such as cardinality estimates and system performance constants that are difficult to know exactly. As a result, accurate prediction still remains elusive for many queries. However, existing predictors provide a single, point estimate of the true execution time, but fail to characterize the uncertainty in the prediction. In this paper, we take a first step towards providing uncertainty information along with query execution time predictions. We use the query optimizer's cost model to represent the query execution time as a function of the selectivities of operators in the query plan as well as the constants that describe the cost of CPU and I/O operations in the system. By treating these quantities as random variables rather than constants, we show that with low overhead we can infer the distribution of likely prediction errors. We further show that the estimated prediction errors by our proposed techniques are strongly correlated with the actual prediction errors.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. CONCERTO: Complex Query Execution Mechanism-Aware Learned Cost Estimation

    cs.DB 2024-12 conditional novelty 6.0 of 10

    CONCERTO predicts query latency on parallel OLAP databases by estimating per-operator costs, calibrating resource contention with graph attention networks, and aggregating calibrated costs with a tree convolutional network.

Pith tools