DBMS metrology: measuring query time

Authors:
Sabah Currim;Richard T. Snodgrass;Young-Kyoon Suh;Rui Zhang;Matthew Wong Johnson;Cheng Yi
Affiliations:
University of Arizona, Tucson, AZ, USA;University of Arizona, Tucson, AZ, USA;University of Arizona, Tucson, AZ, USA;Teradata Corporation, Torrence, CA, USA;USDS, San Diego, CA, USA;University of Arizona, Tucson, AZ, USA
Venue:
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Year:
2013

Citing 10
Cited 0

On Workload Characterization of Relational Database Environments

IEEE Transactions on Software Engineering
An Analytical Method for Estimating and Interpreting Query Time

VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
LEO - DB2's LEarning Optimizer

Proceedings of the 27th International Conference on Very Large Data Bases
XBench Benchmark and Performance Testing of XML DBMSs

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Understanding The Linux Kernel

Understanding The Linux Kernel
Predicting Multiple Metrics for Queries: Better Decisions Enabled by Machine Learning

ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Benchmarking cloud serving systems with YCSB

Proceedings of the 1st ACM symposium on Cloud computing
Towards cost-effective storage provisioning for DBMSs

Proceedings of the VLDB Endowment
Learning-based Query Performance Modeling and Prediction

ICDE '12 Proceedings of the 2012 IEEE 28th International Conference on Data Engineering
Micro-Specialization in DBMSes

ICDE '12 Proceedings of the 2012 IEEE 28th International Conference on Data Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is surprisingly hard to obtain accurate and precise measurements of the time spent executing a query. We review relevant process and overall measures obtainable from the Linux kernel and introduce a structural causal model relating these measures. A thorough correlational analysis provides strong support for this model. Using this model, we developed a timing protocol, which (1) performs sanity checks to ensure validity of the data, (2) drops some query executions via clearly motivated predicates, (3) drops some entire queries at a cardinality, again via clearly motivated predicates, (4) for those that remain, for each computes a single measured time by a carefully justified formula over the underlying measures of the remaining query executions, and (5) performs post-analysis sanity checks. The resulting query time measurement procedure, termed the Tucson Protocol, applies to proprietary and open-source DBMSes.