Definition
Execution costs, or simply costs, is a generic term to collectively refer to the various goals or objectives of database query optimization. Optimization aims at finding the “cheapest” (“best” or at least a “reasonably good”) query execution plan (QEP) among semantically equivalent alternative plans for the given query. Cost is used as a metric to compare plans. Depending on the application, different types of costs are considered. Traditional optimization goals include minimizing response time (for the first answer or the complete result), minimizing resource consumption (like CPU time, I/O, network bandwidth, or amount of memory required), or maximizing throughput, i.e., the number of queries that the system can answer per time. Other, less obvious objectives – e.g., in a mobile environment – may be to minimize the power consumption needed to answer the query or the on-line time being connected to a remote database server.
Obviously, evaluating a QEP to measure its...
Recommended Reading
Blohsfeld B, Korus D, Seeger B. A comparison of selectivity estimators for range queries on metric attributes. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1999. p. 239–50.
Chakrabarti K, Garofalakis MN, Rastogi R, Shim K. Approximate query processing using wavelets. In: Proceedings of the 26th International Conference on Very Large Data Bases; 2000. p. 111–22.
Chaudhuri S, Motwani R, Narasayya VR. On random sampling over joins. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Philadephia; 1999. p. 263–74.
Chen CM, Roussopoulos N. Adaptive selectivity estimation using query feedback. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1994. p. 161–72.
Garcia-Molina H, Ullman JD, Widom J. Database systems: the complete book. Englewood Cliffs: Prentice Hall; 2002.
Gibbons PB, Matias Y. Synopsis data structures for massive data sets. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms; 1999. p. 909–10.
Gibbons PB, Matias PB, Poosala V. Fast incremental maintenance of approximate histograms. In: Proceedings of the 23th International Conference on Very Large Data Bases; 1997. p. 466–75.
Haas PJ, Naughton JF, Seshadri S, Swami AN. Selectivity and cost estimation for joins based on random sampling. J Comput Syst Sci. 1996;52(3):550–69.
Ioannidis YE, Christodoulakis S. On the propagation of errors in the size of join results. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1991. p. 268–77.
Ioannidis YE, Poosala V. Histogram-based approximation of set-valued query-answers. In: Proceedings of the 25th International Conference on Very Large Data Bases; 1999. p. 174–85.
König AC, Weikum G. Combining histograms and parametric curve fitting for feedback-driven query result-size estimation. In: Proceedings of the 25th International Conference on Very Large Data Bases; 1999. p. 423–34.
König AC, Weikum G. Auto-tuned spline synopses for database statistics management. In: Proceedings of the International Conference on Management of Data; 2000.
Korth H, Silberschatz A. Database systems concepts. New York/San Francisco/Washington, DC: McGraw-Hill; 1991.
Lu H, Tan KL, Shan MC. Hash-based join algorithms for multiprocessor computers. In: Proceedings of the 16th International Conference on Very Large Data Bases; 1990. p. 198–209.
Manegold S. Understanding, modeling, and improving main-memory database performance. PhD thesis, Universiteit van Amsterdam, Amsterdam; 2002.
Manegold S., Boncz PA, Kersten ML. Generic database cost models for hierarchical memory systems. In: Proceedings of the 28th International Conference on Very Large Data Bases; 2002. p. 191–202.
Matias Y, Vitter JS, Wang M. Wavelet-based histograms for selectivity estimation. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1998. p. 448–59.
Selinger PG, Astrahan MM, Chamberlin DD, Lorie RA, Price TG. Access path selection in a relational database management system. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1979. p. 23–34.
Spiliopoulou M, Freytag J-C. Modelling resource utilization in pipelined query execution. In: Proceedings of the European Conference on Parallel Processing; 1996. p. 872–80.
Sun W, Ling Y, Rishe N, Deng Y. An instant and accurate size estimation method for joins and selection in a retrieval-intensive environment. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1993. p. 79–88.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media LLC
About this entry
Cite this entry
Manegold, S. (2016). Cost Estimation. In: Liu, L., Özsu, M. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4899-7993-3_857-2
Download citation
DOI: https://doi.org/10.1007/978-1-4899-7993-3_857-2
Received:
Accepted:
Published:
Publisher Name: Springer, New York, NY
Online ISBN: 978-1-4899-7993-3
eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering