{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:50:35Z","timestamp":1773481835623,"version":"3.50.1"},"reference-count":70,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2015,12,3]],"date-time":"2015-12-03T00:00:00Z","timestamp":1449100800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMOD Rec."],"published-print":{"date-parts":[[2015,12,3]]},"abstract":"<jats:p>The quality of a query execution plan chosen by a Cost-Based Optimizer (CBO) depends greatly on the estimation accuracy of input parameter values. Many research results have been produced on improving the estimation accuracy, but they do not work for every situation. Therefore, \"robust query optimization\" was introduced, in an effort to minimize the sub-optimality risk by accepting the fact that estimates could be inaccurate. In this survey, we aim to provide an overview of robust query optimization methods by classifying them into different categories, explaining the essential ideas, listing their advantages and limitations, and comparing them with multiple criteria.<\/jats:p>","DOI":"10.1145\/2854006.2854012","type":"journal-article","created":{"date-parts":[[2015,12,4]],"date-time":"2015-12-04T13:43:07Z","timestamp":1449236587000},"page":"25-36","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Robust Query Optimization Methods With Respect to Estimation Errors"],"prefix":"10.1145","volume":"44","author":[{"given":"Shaoyi","family":"Yin","sequence":"first","affiliation":[{"name":"IRIT Laboratory, Paul Sabatier University, France"}]},{"given":"Abdelkader","family":"Hameurlain","sequence":"additional","affiliation":[{"name":"IRIT Laboratory, Paul Sabatier University, France"}]},{"given":"Franck","family":"Morvan","sequence":"additional","affiliation":[{"name":"IRIT Laboratory, Paul Sabatier University, France"}]}],"member":"320","published-online":{"date-parts":[[2015,12,3]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/304181.304198"},{"key":"e_1_2_1_2_1","volume-title":"PDIS.","author":"Amsaleg L.","unstructured":"Amsaleg , L. , al.1996. Scrambling Query Plans to Cope with Unexpected Delays . In PDIS. Miami, USA , 208--219. Amsaleg, L., al.1996. Scrambling Query Plans to Cope with Unexpected Delays. In PDIS. Miami, USA, 208--219."},{"key":"e_1_2_1_3_1","volume-title":"ICDE.","author":"Antonshenkov G.","unstructured":"Antonshenkov , G. 1993. Dynamic Query Optimization in Rdb\/VMS . In ICDE. Vienna, Austria , 538--547. Antonshenkov, G. 1993. Dynamic Query Optimization in Rdb\/VMS. In ICDE. Vienna, Austria, 538--547."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.4018\/jdm.2004100102"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335420"},{"key":"e_1_2_1_6_1","unstructured":"Babu S. and Bizarro P. 2005. Adaptive Query Processing in the Looking Glass. In CIDR. Asilomar USA 238--249. Babu S. and Bizarro P. 2005. Adaptive Query Processing in the Looking Glass. In CIDR. Asilomar USA 238--249."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066171"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066172"},{"key":"e_1_2_1_9_1","unstructured":"Bizarro P. etal 2005. Content-Based Routing: Different Plans for Different Data. In VLDB. Trondheim Norway 757--768. Bizarro P. et al. 2005. Content-Based Routing: Different Plans for Different Data. In VLDB. Trondheim Norway 757--768."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2008.160"},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Bonneau S. and Hameurlain A. 1999. Hybrid Simultaneous Scheduling and Mapping in SQL Multi-Query Parallelization. In DEXA. Florence Italy 88--98. Bonneau S. and Hameurlain A. 1999. Hybrid Simultaneous Scheduling and Mapping in SQL Multi-Query Parallelization. In DEXA. Florence Italy 88--98.","DOI":"10.1007\/3-540-48309-8_8"},{"key":"e_1_2_1_12_1","volume-title":"ICDE.","author":"Bouganim L.","unstructured":"Bouganim , L. , Dynamic Query Scheduling in Data Integration Systems . In ICDE. San Diego, USA , 425--434. Bouganim, L., et al. 2000. Dynamic Query Scheduling in Data Integration Systems. In ICDE. San Diego, USA, 425--434."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/376284.375686"},{"issue":"4","key":"e_1_2_1_14_1","first-page":"12","article-title":"AutoAdmin Project at Microsoft Research","volume":"34","author":"Bruno N.","year":"2011","unstructured":"Bruno , N. , 2011 . AutoAdmin Project at Microsoft Research : Lessons Learned. IEEE Data Eng. Bull , 34 ( 4 ): 12 -- 19 . Bruno, N., et al. 2011. AutoAdmin Project at Microsoft Research: Lessons Learned. IEEE Data Eng. Bull, 34(4): 12--19.","journal-title":"Lessons Learned. IEEE Data Eng. Bull"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536222.2536223"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732240.2732245"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453977"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559955"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687739"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/191839.191874"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/543613.543651"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/191839.191872"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/974121.974129"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1561\/1900000001"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588566"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/1338438.1338530"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008674905987"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213966"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/67544.66960"},{"key":"e_1_2_1_30_1","unstructured":"Graefe G. etal 2009. Visualizing the Robustness of Query Execution. In CIDR. Asilomar USA. Graefe G. et al. 2009. Visualizing the Robustness of Query Execution. In CIDR. Asilomar USA."},{"key":"e_1_2_1_31_1","volume-title":"Robust Query Processing. Dagstuhl Workshop Summary 10381","author":"Graefe G.","year":"2010","unstructured":"Graefe , G. , 2010 . Robust Query Processing. Dagstuhl Workshop Summary 10381 , Wadern, Germany. Graefe, G., et al. 2010. Robust Query Processing. Dagstuhl Workshop Summary 10381, Wadern, Germany."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767961"},{"key":"e_1_2_1_33_1","volume-title":"Robust Query Processing. Dagstuhl Workshop Summary 12321","author":"Graefe G.","year":"2012","unstructured":"Graefe , G. , 2012 . Robust Query Processing. Dagstuhl Workshop Summary 12321 , Wadern, Germany. Graefe, G., et al. 2012. Robust Query Processing. Dagstuhl Workshop Summary 12321, Wadern, Germany."},{"key":"e_1_2_1_34_1","volume-title":"BNCOD.","author":"Gounaris A.","unstructured":"Gounaris , A. , Adaptive Query Processing: A Survey . In BNCOD. Sheffield, UK , 11--25. Gounaris, A., et al. 2002. Adaptive Query Processing: A Survey. In BNCOD. Sheffield, UK, 11--25."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28323-9_9"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(02)00074-1"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247569"},{"key":"e_1_2_1_38_1","volume-title":"VLDB.","author":"Harish D.","unstructured":"Harish , D. , On the Production of Anorexic Plan Diagrams . In VLDB. Vienna, Austria , 1081--1092. Harish, D., et al.. 2007. On the Production of Anorexic Plan Diagrams. In VLDB. Vienna, Austria, 1081--1092."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453976"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920984"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01277518"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/115790.115835"},{"key":"e_1_2_1_43_1","volume-title":"VLDB.","author":"Ioannidis Y.","unstructured":"Ioannidis , Y. 2003. The History of Histograms (abridged) . In VLDB. Berlin, Germany , 19--30. Ioannidis, Y. 2003. The History of Histograms (abridged). In VLDB. Berlin, Germany, 19--30."},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304209"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007613"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276315"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247502"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/93597.93611"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/62061.62063"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007642"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-006-0030-1"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJIIDS.2009.030440"},{"key":"e_1_2_1_53_1","volume-title":"BTW.","author":"Neumann T.","unstructured":"Neumann , T. and Calindo-Legaria , C. 2013. Taking the Edge off Cardinality Estimation Errors using Incremental Execution. In BTW. Magdeburg, Germany , 73--92. Neumann, T. and Calindo-Legaria, C. 2013.Taking the Edge off Cardinality Estimation Errors using Incremental Execution. In BTW. Magdeburg, Germany, 73--92."},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687583"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2012.09.010"},{"key":"e_1_2_1_56_1","unstructured":"Olken F. and Rotem D. 1986. Simple Random Sampling from Relational Databases. In VLDB. Kyoto Japan 160--169. Olken F. and Rotem D. 1986. Simple Random Sampling from Relational Databases. In VLDB. Kyoto Japan 160--169."},{"key":"e_1_2_1_57_1","unstructured":"Picasso Database Query Optimizer Visualizer. http:\/\/dsl.serc.iisc.ernet.in\/projects\/PICASSO\/ Picasso Database Query Optimizer Visualizer. http:\/\/dsl.serc.iisc.ernet.in\/projects\/PICASSO\/"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/1099554.1099730"},{"key":"e_1_2_1_59_1","unstructured":"Raman V. etal 2003. Using State Modules for Adaptive Query Processing. In ICDE. Bangalore India 353--364. Raman V. et al. 2003. Using State Modules for Adaptive Query Processing. In ICDE. Bangalore India 353--364."},{"key":"e_1_2_1_60_1","unstructured":"Reddy N. and Harista J. 2005. Analyzing Plan Diagrams of Database Query Optimizers. In VLDB. Trondheim Norway 1228--1239. Reddy N. and Harista J. 2005. Analyzing Plan Diagrams of Database Query Optimizers. In VLDB. Trondheim Norway 1228--1239."},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/582095.582099"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.84"},{"key":"e_1_2_1_63_1","unstructured":"Stillger M. etal2001. LEO-DB2's Learning Optimizer. VLDB. Roma Italy 19--28. Stillger M. et al.2001. LEO-DB2's Learning Optimizer. VLDB. Roma Italy 19--28."},{"key":"e_1_2_1_64_1","volume-title":"VLDB.","author":"Tian F.","unstructured":"Tian , F. and DeWitt , D.J. 2003. Tuple Routing Strategies for Distributed Eddies . In VLDB. Berlin, Germany , 333--344. Tian, F. and DeWitt, D.J. 2003. Tuple Routing Strategies for Distributed Eddies. In VLDB. Berlin, Germany, 333--344."},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920911"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402724"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-012-0293-7"},{"key":"e_1_2_1_68_1","doi-asserted-by":"crossref","unstructured":"Wilschut A. N. and Apers P. M. G. 1991. Dataflow Query Execution in a Parallel Main-Memory Environment. In PDIS Miami Beach USA 68--77. Wilschut A. N. and Apers P. M. G. 1991. Dataflow Query Execution in a Parallel Main-Memory Environment. In PDIS Miami Beach USA 68--77.","DOI":"10.1109\/PDIS.1991.183069"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10424-4_12"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2004.08.004"}],"container-title":["ACM SIGMOD Record"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2854006.2854012","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2854006.2854012","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:04:30Z","timestamp":1750273470000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2854006.2854012"}},"subtitle":["A Survey"],"short-title":[],"issued":{"date-parts":[[2015,12,3]]},"references-count":70,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,12,3]]}},"alternative-id":["10.1145\/2854006.2854012"],"URL":"https:\/\/doi.org\/10.1145\/2854006.2854012","relation":{},"ISSN":["0163-5808"],"issn-type":[{"value":"0163-5808","type":"print"}],"subject":[],"published":{"date-parts":[[2015,12,3]]},"assertion":[{"value":"2015-12-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}