{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T02:22:09Z","timestamp":1773886929736,"version":"3.50.1"},"reference-count":33,"publisher":"Association for Computing Machinery (ACM)","issue":"11","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2023,7]]},"abstract":"<jats:p>\n            The traditional and well-established cost-based query optimizer approach enumerates different execution plans for each query, assesses each plan with costs, and selects the plan that promises the lowest costs for execution. However, the optimal execution plan is not always selected. To steer the optimizer in the right direction, many query optimizers provide configuration parameters called query optimizer hints. These hints can be set for every single query separately. To show the great potential of these hints for the optimization of analytical queries, we present results of a comprehensive and in-depth evaluation using three benchmarks and two different versions of the open-source database system PostgreSQL. In particular, we highlight that query optimizer hinting is a non-trivial challenge. To solve this challenge, we propose\n            <jats:italic>FASTgres<\/jats:italic>\n            , a learning-based context-aware classification strategy for hint set prediction. Compared to related work,\n            <jats:italic>FASTgres<\/jats:italic>\n            provides transparent and direct hint set predictions with consistent performance improvements. In our end-to-end evaluation, we demonstrate that\n            <jats:italic>FASTgres<\/jats:italic>\n            effectively reduces benchmark runtimes by a factor of up to 3.25x with only steering the cost-based optimizer.\n          <\/jats:p>","DOI":"10.14778\/3611479.3611528","type":"journal-article","created":{"date-parts":[[2023,8,25]],"date-time":"2023-08-25T02:08:08Z","timestamp":1692929288000},"page":"3310-3322","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["FASTgres: Making Learned Query Optimizer Hinting Effective"],"prefix":"10.14778","volume":"16","author":[{"given":"Lucas","family":"Woltmann","sequence":"first","affiliation":[{"name":"Technische Universit\u00e4t Dresden, Dresden Database Research Group, Dresden, Germany"}]},{"given":"Jerome","family":"Thiessat","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Dresden, Dresden Database Research Group, Dresden, Germany"}]},{"given":"Claudio","family":"Hartmann","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Dresden, Dresden Database Research Group, Dresden, Germany"}]},{"given":"Dirk","family":"Habich","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Dresden, Dresden Database Research Group, Dresden, Germany"}]},{"given":"Wolfgang","family":"Lehner","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Dresden, Dresden Database Research Group, Dresden, Germany"}]}],"member":"320","published-online":{"date-parts":[[2023,8,24]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Walter Cai Magdalena Balazinska and Dan Suciu. 2019. Pessimistic Cardinality Estimation: Tighter Upper Bounds for Intermediate Join Cardinalities. In SIGMOD. 18--35.  Walter Cai Magdalena Balazinska and Dan Suciu. 2019. Pessimistic Cardinality Estimation: Tighter Upper Bounds for Intermediate Join Cardinalities. In SIGMOD. 18--35."},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Surajit Chaudhuri. 1998. An Overview of Query Optimization in Relational Systems. In SIGMOD Alberto O. Mendelzon and Jan Paredaens (Eds.). 34--43.  Surajit Chaudhuri. 1998. An Overview of Query Optimization in Relational Systems. In SIGMOD Alberto O. Mendelzon and Jan Paredaens (Eds.). 34--43.","DOI":"10.1145\/275487.275492"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Surajit Chaudhuri. 2009. Query optimizers: time to rethink the contract?. In SIGMOD Ugur \u00c7etintemel Stanley B. Zdonik Donald Kossmann and Nesime Tatbul (Eds.). 961--968.  Surajit Chaudhuri. 2009. Query optimizers: time to rethink the contract?. In SIGMOD Ugur \u00c7etintemel Stanley B. Zdonik Donald Kossmann and Nesime Tatbul (Eds.). 961--968.","DOI":"10.1145\/1559845.1559955"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1978542.1978562"},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Yu Chen and Ke Yi. 2017. Two-Level Sampling for Join Size Estimation. In SIGMOD. 759--774.  Yu Chen and Ke Yi. 2017. Two-Level Sampling for Join Size Estimation. In SIGMOD. 759--774.","DOI":"10.1145\/3035918.3035921"},{"key":"e_1_2_1_6_1","unstructured":"Transaction Processing Council. 2023. TPC-H. https:\/\/www.tpc.org\/tpch\/. Accessed: 2023-03-25.  Transaction Processing Council. 2023. TPC-H. https:\/\/www.tpc.org\/tpch\/. Accessed: 2023-03-25."},{"key":"e_1_2_1_7_1","unstructured":"Axel Hertzschuch Claudio Hartmann Dirk Habich and Wolfgang Lehner. 2021. Simplicity Done Right for Join Ordering. In CIDR.  Axel Hertzschuch Claudio Hartmann Dirk Habich and Wolfgang Lehner. 2021. Simplicity Done Right for Join Ordering. In CIDR."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551825"},{"key":"e_1_2_1_9_1","volume-title":"COMPASS: Online Sketch-based Query Optimization for In-Memory Databases. In SIGMOD. 804--816.","author":"Izenov Yesdaulet","year":"2021","unstructured":"Yesdaulet Izenov , Asoke Datta , Florin Rusu , and Jun Hyung Shin . 2021 . COMPASS: Online Sketch-based Query Optimization for In-Memory Databases. In SIGMOD. 804--816. Yesdaulet Izenov, Asoke Datta, Florin Rusu, and Jun Hyung Shin. 2021. COMPASS: Online Sketch-based Query Optimization for In-Memory Databases. In SIGMOD. 804--816."},{"key":"e_1_2_1_10_1","volume-title":"Learned Cardinalities: Estimating Correlated Joins with Deep Learning. In CIDR.","author":"Kipf Andreas","year":"2019","unstructured":"Andreas Kipf , Thomas Kipf , Bernhard Radke , Viktor Leis , Peter A. Boncz , and Alfons Kemper . 2019 . Learned Cardinalities: Estimating Correlated Joins with Deep Learning. In CIDR. Andreas Kipf, Thomas Kipf, Bernhard Radke, Viktor Leis, Peter A. Boncz, and Alfons Kemper. 2019. Learned Cardinalities: Estimating Correlated Joins with Deep Learning. In CIDR."},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Andreas Kipf Dimitri Vorona Jonas M\u00fcller Thomas Kipf Bernhard Radke Viktor Leis Peter A. Boncz Thomas Neumann and Alfons Kemper. 2019. Estimating Cardinalities with Deep Sketches. In SIGMOD. 1937--1940.  Andreas Kipf Dimitri Vorona Jonas M\u00fcller Thomas Kipf Bernhard Radke Viktor Leis Peter A. Boncz Thomas Neumann and Alfons Kemper. 2019. Estimating Cardinalities with Deep Sketches. In SIGMOD. 1937--1940.","DOI":"10.1145\/3299869.3320218"},{"key":"e_1_2_1_12_1","volume-title":"Learning to optimize join queries with deep reinforcement learning. arXiv preprint arXiv:1808.03196","author":"Krishnan Sanjay","year":"2018","unstructured":"Sanjay Krishnan , Zongheng Yang , Ken Goldberg , Joseph Hellerstein , and Ion Stoica . 2018. Learning to optimize join queries with deep reinforcement learning. arXiv preprint arXiv:1808.03196 ( 2018 ). Sanjay Krishnan, Zongheng Yang, Ken Goldberg, Joseph Hellerstein, and Ion Stoica. 2018. Learning to optimize join queries with deep reinforcement learning. arXiv preprint arXiv:1808.03196 (2018)."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850583.2850594"},{"key":"e_1_2_1_14_1","unstructured":"Viktor Leis Bernhard Radke Andrey Gubichev Alfons Kemper and Thomas Neumann. 2017. Cardinality Estimation Done Right: Index-Based Join Sampling. In CIDR.  Viktor Leis Bernhard Radke Andrey Gubichev Alfons Kemper and Thomas Neumann. 2017. Cardinality Estimation Done Right: Index-Based Join Sampling. In CIDR."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-017-0480-7"},{"key":"e_1_2_1_16_1","unstructured":"Henry Liu Mingbin Xu Ziting Yu Vincent Corvinelli and Calisto Zuzarte. 2015. Cardinality estimation using neural networks. In CASCON. 53--59.  Henry Liu Mingbin Xu Ziting Yu Vincent Corvinelli and Calisto Zuzarte. 2015. Cardinality estimation using neural networks. In CASCON. 53--59."},{"key":"e_1_2_1_17_1","unstructured":"R. Marcus. 2022. Bao Postgres extension. https:\/\/github.com\/learnedsystems\/BaoForPostgreSQL. Accessed: 2023-03-01.  R. Marcus. 2022. Bao Postgres extension. https:\/\/github.com\/learnedsystems\/BaoForPostgreSQL. Accessed: 2023-03-01."},{"key":"e_1_2_1_18_1","volume-title":"Bao: Making Learned Query Optimization Practical. In SIGMOD. 1275--1288.","author":"Marcus Ryan","year":"2021","unstructured":"Ryan Marcus , Parimarjan Negi , Hongzi Mao , Nesime Tatbul , Mohammad Alizadeh , and Tim Kraska . 2021 . Bao: Making Learned Query Optimization Practical. In SIGMOD. 1275--1288. Ryan Marcus, Parimarjan Negi, Hongzi Mao, Nesime Tatbul, Mohammad Alizadeh, and Tim Kraska. 2021. Bao: Making Learned Query Optimization Practical. In SIGMOD. 1275--1288."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342644"},{"key":"e_1_2_1_20_1","volume-title":"NIPS Conference","author":"Mason Llew","year":"1999","unstructured":"Llew Mason , Jonathan Baxter , Peter L. Bartlett , and Marcus R. Frean . 1999. Boosting Algorithms as Gradient Descent. In Advances in Neural Information Processing Systems 12 , NIPS Conference , Denver, Colorado, USA, November 29 - December 4, 1999 , Sara A. Solla, Todd K. Leen, and Klaus-Robert M\u00fcller (Eds.). The MIT Press, 512--518. Llew Mason, Jonathan Baxter, Peter L. Bartlett, and Marcus R. Frean. 1999. Boosting Algorithms as Gradient Descent. In Advances in Neural Information Processing Systems 12, NIPS Conference, Denver, Colorado, USA, November 29 - December 4, 1999, Sara A. Solla, Todd K. Leen, and Klaus-Robert M\u00fcller (Eds.). The MIT Press, 512--518."},{"key":"e_1_2_1_21_1","unstructured":"Guido Moerkotte and Axel Hertzschuch. 2020. alpha to omega: the G(r)eek Alphabet of Sampling. In CIDR.  Guido Moerkotte and Axel Hertzschuch. 2020. alpha to omega: the G(r)eek Alphabet of Sampling. In CIDR."},{"key":"e_1_2_1_22_1","unstructured":"MySQL. 2023. Optimizer Hints. https:\/\/dev.mysql.com\/doc\/refman\/8.0\/en\/optimizer-hints.html. Accessed: 2023-03-01.  MySQL. 2023. Optimizer Hints. https:\/\/dev.mysql.com\/doc\/refman\/8.0\/en\/optimizer-hints.html. Accessed: 2023-03-01."},{"key":"e_1_2_1_23_1","unstructured":"Magnus M\u00fcller Lucas Woltmann and Wolfgang Lehner. 2023. Enhanced Featurization of Queries with Mixed Combinations of Predicates for ML-based Cardinality Estimation. In EDBT. 273--284.  Magnus M\u00fcller Lucas Woltmann and Wolfgang Lehner. 2023. Enhanced Featurization of Queries with Mixed Combinations of Predicates for ML-based Cardinality Estimation. In EDBT. 273--284."},{"key":"e_1_2_1_24_1","unstructured":"Oracle. 2023. Optimizer Hints. https:\/\/docs.oracle.com\/cd\/B12037_01\/server.101\/b10752\/hintsref.htm. Accessed: 2023-03-01.  Oracle. 2023. Optimizer Hints. https:\/\/docs.oracle.com\/cd\/B12037_01\/server.101\/b10752\/hintsref.htm. Accessed: 2023-03-01."},{"key":"e_1_2_1_25_1","unstructured":"PostgreSQL. 2023. Query Planning. https:\/\/www.postgresql.org\/docs\/current\/runtime-config-query.html. Accessed: 2023-03-01.  PostgreSQL. 2023. Query Planning. https:\/\/www.postgresql.org\/docs\/current\/runtime-config-query.html. Accessed: 2023-03-01."},{"key":"e_1_2_1_26_1","unstructured":"SQL Server. 2023. Hints (Transact-SQL) - Query. https:\/\/learn.microsoft.com\/en-us\/sql\/t-sql\/queries\/hints-transact-sql-query?view=sql-server-ver16. Accessed: 2023-03-01.  SQL Server. 2023. Hints (Transact-SQL) - Query. https:\/\/learn.microsoft.com\/en-us\/sql\/t-sql\/queries\/hints-transact-sql-query?view=sql-server-ver16. Accessed: 2023-03-01."},{"key":"e_1_2_1_27_1","unstructured":"Michael Stillger Guy M. Lohman Volker Markl and Mokhtar Kandil. 2001. LEO - DB2's LEarning Optimizer. In VLDB. 19--28.  Michael Stillger Guy M. Lohman Volker Markl and Mokhtar Kandil. 2001. LEO - DB2's LEarning Optimizer. In VLDB. 19--28."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/3368289.3368296"},{"key":"e_1_2_1_29_1","volume-title":"andWolfgang Lehner","author":"Woltmann Lucas","year":"2023","unstructured":"Lucas Woltmann , Patrick Damme , Claudio Hartmann , Dirk Habich , andWolfgang Lehner . 2023 . Learned Selection Strategy for Lightweight Integer Compression Algorithms. In EDBT (Ioannina, Greece) (EDBT 2023). Ioannina, Greece , 13. Lucas Woltmann, Patrick Damme, Claudio Hartmann, Dirk Habich, andWolfgang Lehner. 2023. Learned Selection Strategy for Lightweight Integer Compression Algorithms. In EDBT (Ioannina, Greece) (EDBT 2023). Ioannina, Greece, 13."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3329859.3329875"},{"key":"e_1_2_1_31_1","volume-title":"Balsa: Learning a Query Optimizer Without Expert Demonstrations. In SIGMOD. 931--944.","author":"Yang Zongheng","year":"2022","unstructured":"Zongheng Yang , Wei-Lin Chiang , Sifei Luan , Gautam Mittal , Michael Luo , and Ion Stoica . 2022 . Balsa: Learning a Query Optimizer Without Expert Demonstrations. In SIGMOD. 931--944. Zongheng Yang, Wei-Lin Chiang, Sifei Luan, Gautam Mittal, Michael Luo, and Ion Stoica. 2022. Balsa: Learning a Query Optimizer Without Expert Demonstrations. In SIGMOD. 931--944."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/3565838.3565846"},{"key":"e_1_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Zhuoyue Zhao Robert Christensen Feifei Li Xiao Hu and Ke Yi. 2018. Random Sampling over Joins Revisited. In SIGMOD. 1525--1539.  Zhuoyue Zhao Robert Christensen Feifei Li Xiao Hu and Ke Yi. 2018. Random Sampling over Joins Revisited. In SIGMOD. 1525--1539.","DOI":"10.1145\/3183713.3183739"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3611479.3611528","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,23]],"date-time":"2023-09-23T22:17:31Z","timestamp":1695507451000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3611479.3611528"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7]]},"references-count":33,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["10.14778\/3611479.3611528"],"URL":"https:\/\/doi.org\/10.14778\/3611479.3611528","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2023,7]]},"assertion":[{"value":"2023-08-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}