{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:54:17Z","timestamp":1775638457597,"version":"3.50.1"},"reference-count":21,"publisher":"Association for Computing Machinery (ACM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2009,8]]},"abstract":"<jats:p>\n            Query optimizers rely on accurate estimations of the sizes of intermediate results. Wrong size estimations can lead to overly expensive execution plans. We first define the\n            <jats:italic>q-error<\/jats:italic>\n            to measure deviations of size estimates from actual sizes. The q-error enables the derivation of two important results: (1) We provide bounds such that if the q-error is smaller than this bound, the query optimizer constructs an optimal plan. (2) If the q-error is bounded by a number\n            <jats:italic>q<\/jats:italic>\n            , we show that the cost of the produced plan is at most a factor of\n            <jats:italic>q<\/jats:italic>\n            <jats:sup>4<\/jats:sup>\n            worse than the optimal plan. Motivated by these findings, we next show how to find the best approximation under the q-error. These techniques can then be used to build synopsis for size estimates. Finally, we give some experimental results where we apply the developed techniques.\n          <\/jats:p>","DOI":"10.14778\/1687627.1687738","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"982-993","source":"Crossref","is-referenced-by-count":144,"title":["Preventing bad plans by bounding the impact of cardinality estimation errors"],"prefix":"10.14778","volume":"2","author":[{"given":"Guido","family":"Moerkotte","sequence":"first","affiliation":[{"name":"University of Mannheim, Mannheim, Germany"}]},{"given":"Thomas","family":"Neumann","sequence":"additional","affiliation":[{"name":"Max Planck Institute for Informatics, Saarbr\u00fccken, Germany"}]},{"given":"Gabriele","family":"Steidl","sequence":"additional","affiliation":[{"name":"University of Mannheim, Mannheim, Germany"}]}],"member":"320","published-online":{"date-parts":[[2009,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1394-9"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/335168.335230"},{"key":"e_1_2_1_3_1","volume-title":"Proc. of the National Academy of Sciences, 100(5)","author":"Donoho D.","year":"2003","unstructured":"D. Donoho and M. Elad . Optimally sparse representation in general (non-orthogonal) dictionaries via l1 minimization . Proc. of the National Academy of Sciences, 100(5) , 2003 . D. Donoho and M. Elad. Optimally sparse representation in general (non-orthogonal) dictionaries via l1 minimization. Proc. of the National Academy of Sciences, 100(5), 2003."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1114244.1114246"},{"key":"e_1_2_1_5_1","first-page":"541","volume-title":"VLDB","author":"Gibbons P.","year":"2001","unstructured":"P. Gibbons . Distinct sampling for highly-accurate answers to distinct values queries and event reports . In VLDB , pages 541 -- 550 , 2001 . P. Gibbons. Distinct sampling for highly-accurate answers to distinct values queries and event reports. In VLDB, pages 541--550, 2001."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780050043"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1270.1498"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1315451.1315455"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/115790.115835"},{"key":"e_1_2_1_10_1","volume-title":"VLDB","author":"Jagadish H. V.","year":"1998","unstructured":"H. V. Jagadish , N. Koudas , S. Muthukrishnan , V. Poosala , K. C. Sevcik , and T. Suel . Optimal histograms with quality guarantees . In VLDB , 1998 . H. V. Jagadish, N. Koudas, S. Muthukrishnan, V. Poosala, K. C. Sevcik, and T. Suel. Optimal histograms with quality guarantees. In VLDB, 1998."},{"key":"e_1_2_1_11_1","volume-title":"VLDB","author":"K\u00f6nig A. C.","year":"1999","unstructured":"A. C. K\u00f6nig and G. Weikum . Combining histograms and parametric curve fitting for feedback-driven query result-size estimation . In VLDB , 1999 . A. C. K\u00f6nig and G. Weikum. Combining histograms and parametric curve fitting for feedback-driven query result-size estimation. In VLDB, 1999."},{"key":"e_1_2_1_12_1","volume-title":"VLDB","author":"Krishnamurthy R.","year":"1986","unstructured":"R. Krishnamurthy , H. Boral , and C. Zaniolo . Optimization of nonrecursive queries . In VLDB , 1986 . R. Krishnamurthy, H. Boral, and C. Zaniolo. Optimization of nonrecursive queries. In VLDB, 1986."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276344"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70504-8_12"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/233269.233342"},{"key":"e_1_2_1_17_1","volume-title":"VLDB","author":"Reddy N.","year":"2005","unstructured":"N. Reddy and J. R. Haritsa . Analyzing plan diagrams of database query optimizers . In VLDB , 2005 . N. Reddy and J. R. Haritsa. Analyzing plan diagrams of database query optimizers. In VLDB, 2005."},{"key":"e_1_2_1_18_1","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"Rockafellar R.","year":"1970","unstructured":"R. Rockafellar . Convex Analysis . Princeton University Press , 1970 . R. Rockafellar. Convex Analysis. Princeton University Press, 1970."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316849"},{"key":"e_1_2_1_20_1","doi-asserted-by":"crossref","unstructured":"P. Spellucci. Numerische Verfahren der Nichtlinearen Optimierung. Birkh\u00e4user 1993.  P. Spellucci. Numerische Verfahren der Nichtlinearen Optimierung . Birkh\u00e4user 1993.","DOI":"10.1007\/978-3-0348-7214-0"},{"key":"e_1_2_1_21_1","volume-title":"Database and Knowledge Base Systems","author":"Ullman J.","year":"1989","unstructured":"J. Ullman . Database and Knowledge Base Systems , volume Volume 1 . Computer Science Press , 1989 . J. Ullman. Database and Knowledge Base Systems, volume Volume 1. Computer Science Press, 1989."},{"key":"e_1_2_1_22_1","volume-title":"Approximation Theory and Numerical Methods","author":"Watson G.","year":"1980","unstructured":"G. Watson . Approximation Theory and Numerical Methods . Addison-Wesley , 1980 . G. Watson. Approximation Theory and Numerical Methods. Addison-Wesley, 1980."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/1687627.1687738","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:34:15Z","timestamp":1672227255000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/1687627.1687738"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["10.14778\/1687627.1687738"],"URL":"https:\/\/doi.org\/10.14778\/1687627.1687738","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2009,8]]}}}