{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T01:11:04Z","timestamp":1778807464476,"version":"3.51.4"},"reference-count":23,"publisher":"Association for Computing Machinery (ACM)","issue":"11","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2018,7]]},"abstract":"<jats:p>The quality of query execution plans in database systems determines how fast a query can be executed. It has been shown that conventional query optimization still selects sub-optimal or even bad execution plans, due to errors in the cardinality estimation. Although cardinality estimation errors are an evident problem, they are in general not considered in the selection of query execution plans. In this paper, we present three novel metrics for the robustness of relational query execution plans w.r.t. cardinality estimation errors. We also present a novel plan selection strategy that takes both, estimated cost and estimated robustness into account, when choosing a plan for execution. Finally, we share the results of our experimental comparison between robust and conventional plan selection on real world and synthetic benchmarks, showing a speedup of at most factor 3.49.<\/jats:p>","DOI":"10.14778\/3236187.3236191","type":"journal-article","created":{"date-parts":[[2018,9,10]],"date-time":"2018-09-10T12:12:28Z","timestamp":1536581548000},"page":"1360-1372","source":"Crossref","is-referenced-by-count":14,"title":["Robustness metrics for relational query execution plans"],"prefix":"10.14778","volume":"11","author":[{"given":"Florian","family":"Wolf","sequence":"first","affiliation":[{"name":"TU Ilmenau, SAP SE"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Brendle","sequence":"additional","affiliation":[{"name":"University of Konstanz, SAP SE"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Norman","family":"May","sequence":"additional","affiliation":[{"name":"SAP SE"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul R.","family":"Willems","sequence":"additional","affiliation":[{"name":"SAP SE"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai-Uwe","family":"Sattler","sequence":"additional","affiliation":[{"name":"TU Ilmenau"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Grossniklaus","sequence":"additional","affiliation":[{"name":"University of Konstanz"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,7]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920983"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066172"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066171"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/335168.335230"},{"key":"e_1_2_1_6_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2009","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms , Third Edition. The MIT Press , 3 rd edition, 2009 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, Third Edition. The MIT Press, 3rd edition, 2009."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453976"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588566"},{"key":"e_1_2_1_9_1","first-page":"4","article-title":"Query optimization in the IBM DB2 family","volume":"16","author":"Gassner P.","year":"1993","unstructured":"P. Gassner , G. M. Lohman , K. B. Schiefer , and Y. Wang . Query optimization in the IBM DB2 family . IEEE Data Engineering Bulletin , 16 : 4 -- 18 , 1993 . P. Gassner, G. M. Lohman, K. B. Schiefer, and Y. Wang. Query optimization in the IBM DB2 family. IEEE Data Engineering Bulletin, 16:4--18, 1993.","journal-title":"IEEE Data Engineering Bulletin"},{"issue":"5","key":"e_1_2_1_10_1","first-page":"169","article-title":"Robust performance in database query processing (Dagstuhl seminar 17222)","volume":"7","author":"Graefe G.","year":"2017","unstructured":"G. Graefe , R. Borovica-Gajic , and A. Lee . Robust performance in database query processing (Dagstuhl seminar 17222) . Dagstuhl Reports , 7 ( 5 ): 169 -- 180 , 2017 . G. Graefe, R. Borovica-Gajic, and A. Lee. Robust performance in database query processing (Dagstuhl seminar 17222). Dagstuhl Reports, 7(5):169--180, 2017.","journal-title":"Dagstuhl Reports"},{"issue":"8","key":"e_1_2_1_11_1","first-page":"1","article-title":"Robust query processing (Dagstuhl seminar 12321)","volume":"2","author":"Graefe G.","year":"2012","unstructured":"G. Graefe , W. Guy , H. A. Kuno , and G. N. Paulley . Robust query processing (Dagstuhl seminar 12321) . Dagstuhl Reports , 2 ( 8 ): 1 -- 15 , 2012 . G. Graefe, W. Guy, H. A. Kuno, and G. N. Paulley. Robust query processing (Dagstuhl seminar 12321). Dagstuhl Reports, 2(8):1--15, 2012.","journal-title":"Dagstuhl Reports"},{"key":"e_1_2_1_12_1","series-title":"Dagstuhl Seminar 10381Dagstuhl Seminar Proceedings","volume-title":"Robust Query Processing","author":"Graefe G.","year":"2010","unstructured":"G. Graefe , A. C. K\u00f6nig , H. A. Kuno , V. Markl , and K. Sattler , editors . Robust Query Processing ( Dagstuhl Seminar 10381 ), volume 10381 of Dagstuhl Seminar Proceedings , Leibniz-Zentrum f\u00fcr Informatik, Germany, 2010 . Schloss Dagstuhl . G. Graefe, A. C. K\u00f6nig, H. A. Kuno, V. Markl, and K. Sattler, editors. Robust Query Processing (Dagstuhl Seminar 10381), volume 10381 of Dagstuhl Seminar Proceedings, Leibniz-Zentrum f\u00fcr Informatik, Germany, 2010. Schloss Dagstuhl."},{"key":"e_1_2_1_13_1","volume-title":"Inc.","author":"Hamming R. W.","year":"1986","unstructured":"R. W. Hamming . Numerical Methods for Scientists and Engineers. Dover Publications , Inc. , 1986 . R. W. Hamming. Numerical Methods for Scientists and Engineers. Dover Publications, Inc., 1986."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1287369.1287385"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/115790.115835"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850583.2850594"},{"key":"e_1_2_1_18_1","first-page":"1","volume-title":"The VLDB Journal","author":"Leis V.","year":"2017","unstructured":"V. Leis , B. Radke , A. Gubichev , A. Mirchev , P. Boncz , A. Kemper , and T. Neumann . Query optimization through the looking glass, and what we found running the join order benchmark . The VLDB Journal , pages 1 -- 26 , 2017 . V. Leis, B. Radke, A. Gubichev, A. Mirchev, P. Boncz, A. Kemper, and T. Neumann. Query optimization through the looking glass, and what we found running the join order benchmark. The VLDB Journal, pages 1--26, 2017."},{"key":"e_1_2_1_19_1","volume-title":"BTW '17","author":"Lohman G.","year":"2017","unstructured":"G. Lohman . Query optimization-are we there yet? In Datenbanksysteme f\u00fcr Business, Technologie und Web , BTW '17 . Gesellschaft f\u00fcr Informatik, Bonn , 2017 . G. Lohman. Query optimization-are we there yet? In Datenbanksysteme f\u00fcr Business, Technologie und Web, BTW '17. Gesellschaft f\u00fcr Informatik, Bonn, 2017."},{"key":"e_1_2_1_20_1","first-page":"13","volume-title":"Proceedings of the Workshop on Database Query Optimization","author":"Lohman G. M.","unstructured":"G. M. Lohman . Is query optimization a solved problem . In Proceedings of the Workshop on Database Query Optimization , page 13 . Oregon Graduate Center Comp. Sci. Tech. Rep, 2014. G. M. Lohman. Is query optimization a solved problem. In Proceedings of the Workshop on Database Query Optimization, page 13. Oregon Graduate Center Comp. Sci. Tech. Rep, 2014."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687738"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/263661.263687"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/582095.582099"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3183742"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2854006.2854012"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3236187.3236191","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T09:40:31Z","timestamp":1672220431000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3236187.3236191"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7]]},"references-count":23,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["10.14778\/3236187.3236191"],"URL":"https:\/\/doi.org\/10.14778\/3236187.3236191","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2018,7]]}}}