{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:54:40Z","timestamp":1775638480661,"version":"3.50.1"},"reference-count":39,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T00:00:00Z","timestamp":1685059200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2023,5,26]]},"abstract":"<jats:p>Most existing parametric query optimization (PQO) techniques rely on traditional query optimizer cost models, which are often inaccurate and result in suboptimal query performance. We propose Kepler, an end-to-end learning-based approach to PQO that demonstrates significant speedups in query latency over a traditional query optimizer. Central to our method is Row Count Evolution (RCE), a novel plan generation algorithm based on perturbations in the sub-plan cardinality space. While previous approaches require accurate cost models, we bypass this requirement by evaluating candidate plans via actual execution data and training anML model to predict the fastest plan given parameter binding values. Our models leverage recent advances in neural network uncertainty in order to robustly predict faster plans while avoiding regressions in query performance. Experimentally, we show that Kepler achieves significant improvements in query runtime on multiple datasets on PostgreSQL.<\/jats:p>","DOI":"10.1145\/3588963","type":"journal-article","created":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T17:42:05Z","timestamp":1685468525000},"page":"1-25","source":"Crossref","is-referenced-by-count":26,"title":["Kepler: Robust Learning for Parametric Query Optimization"],"prefix":"10.1145","volume":"1","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-1234-0283","authenticated-orcid":false,"given":"Lyric","family":"Doshi","sequence":"first","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-2931-3069","authenticated-orcid":false,"given":"Vincent","family":"Zhuang","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-9980-7737","authenticated-orcid":false,"given":"Gaurav","family":"Jain","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1279-1124","authenticated-orcid":false,"given":"Ryan","family":"Marcus","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0940-228X","authenticated-orcid":false,"given":"Haoyu","family":"Huang","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4558-2847","authenticated-orcid":false,"given":"Deniz","family":"Altinb\u00fcken","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-7965-3534","authenticated-orcid":false,"given":"Eugene","family":"Brevdo","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-2035-4409","authenticated-orcid":false,"given":"Campbell","family":"Fraser","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,5,30]]},"reference":[{"key":"e_1_2_2_1_1","unstructured":"2022. Introduction to Aurora PostgreSQL Query Plan Management. https:\/\/aws.amazon.com\/blogs\/database\/introduction-to-aurora-postgresql-query-plan-management\/"},{"key":"e_1_2_2_2_1","unstructured":"2022. Oracle: Improving Real-World Performance Through Cursor Sharing. https:\/\/docs.oracle.com\/en\/database\/oracle\/oracle-database\/18\/tgsql\/improving-rwp-cursor-sharing.html"},{"key":"e_1_2_2_3_1","unstructured":"2022. Parameter Sensitivity Plan optimization. https:\/\/docs.microsoft.com\/en-us\/sql\/relational-databases\/performance\/parameter-sensitivity-plan-optimization?view=sql-server-ver16"},{"key":"e_1_2_2_4_1","unstructured":"2022. Skewed Data Generator for TPCH. https:\/\/github.com\/gunaprsd\/SkewedDataGenerator"},{"key":"e_1_2_2_5_1","unstructured":"2022. TPCH Benchmark. https:\/\/www.tpc.org\/tpc_documents_current_versions\/current_specifications5.asp"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.64"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.57"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICMLA.2014.48"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807226"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687739"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732240.2732246"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3324957"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064040"},{"key":"e_1_2_2_14_1","volume-title":"Kai Zeng, Gao Cong, Yanzhao Qin, Andreas Pfadler, et al .","author":"Han Yuxing","year":"2021","unstructured":"Yuxing Han, Ziniu Wu, Peizhi Wu, Rong Zhu, Jingyi Yang, Liang Wei Tan, Kai Zeng, Gao Cong, Yanzhao Qin, Andreas Pfadler, et al . 2021. Cardinality Estimation in DBMS: A Comprehensive Benchmark Evaluation. arXiv preprint arXiv:2109.05877 (2021)."},{"key":"e_1_2_2_15_1","volume-title":"Proceedings of the 31st international conference on Very large data bases. VLDB Endowment. 1228--1239","author":"Haritsa Naveen Reddy","year":"2005","unstructured":"Naveen Reddy Jayant R Haritsa. 2005. Analyzing plan diagrams of database query optimizers. In Proceedings of the 31st international conference on Very large data bases. VLDB Endowment. 1228--1239."},{"key":"e_1_2_2_16_1","volume-title":"Second International Workshop on Learning with Imbalanced Domains: Theory and Applications. PMLR, 52--66","author":"Hepburn Alexander","year":"2018","unstructured":"Alexander Hepburn, Ryan McConville, Ra\u00fal Santos-Rodr\u00edguezo, Jes\u00fas Cid-Sueiro, and Dario Garc\u00eda-Garc\u00eda. 2018. Proper losses for learning with example-dependent costs. In Second International Workshop on Learning with Imbalanced Domains: Theory and Applications. PMLR, 52--66."},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-155860869-6\/50023-8"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780050037"},{"key":"e_1_2_2_19_1","volume-title":"Seo, Wook-Shin Han, Kangwoo Choi, and Jaehyok Chong. 2022. Learned Cardinality Estimation: An In-depth Study. In Proceedings of the 2022 International Conference on Management of Data. 1214--1227","author":"Kim Kyoungmin","unstructured":"Kyoungmin Kim, Jisung Jung, In Seo, Wook-Shin Han, Kangwoo Choi, and Jaehyok Chong. 2022. Learned Cardinality Estimation: An In-depth Study. In Proceedings of the 2022 International Conference on Management of Data. 1214--1227."},{"key":"e_1_2_2_20_1","volume-title":"Learned cardinalities: Estimating correlated joins with deep learning. arXiv preprint arXiv:1809.00677","author":"Kipf Andreas","year":"2018","unstructured":"Andreas Kipf, Thomas Kipf, Bernhard Radke, Viktor Leis, Peter Boncz, and Alfons Kemper. 2018. Learned cardinalities: Estimating correlated joins with deep learning. arXiv preprint arXiv:1809.00677 (2018)."},{"key":"e_1_2_2_21_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)."},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850583.2850594"},{"key":"e_1_2_2_23_1","first-page":"7498","article-title":"Simple and principled uncertainty estimation with deterministic deep learning via distance awareness","volume":"33","author":"Liu Jeremiah","year":"2020","unstructured":"Jeremiah Liu, Zi Lin, Shreyas Padhy, Dustin Tran, Tania Bedrax Weiss, and Balaji Lakshminarayanan. 2020. Simple and principled uncertainty estimation with deterministic deep learning via distance awareness. Advances in Neural Information Processing Systems 33 (2020), 7498--7512.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/3494124.3494127"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3452838"},{"key":"e_1_2_2_26_1","volume-title":"Neo: A learned query optimizer. arXiv preprint arXiv:1904.03711","author":"Marcus Ryan","year":"2019","unstructured":"Ryan Marcus, Parimarjan Negi, Hongzi Mao, Chi Zhang, Mohammad Alizadeh, Tim Kraska, Olga Papaemmanouil, and Nesime Tatbul. 2019. Neo: A learned query optimizer. arXiv preprint arXiv:1904.03711 (2019)."},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3211954.3211957"},{"key":"e_1_2_2_28_1","volume-title":"Towards a hands-free query optimizer through deep learning. arXiv preprint arXiv:1809.10212","author":"Marcus Ryan","year":"2018","unstructured":"Ryan Marcus and Olga Papaemmanouil. 2018. Towards a hands-free query optimizer through deep learning. arXiv preprint arXiv:1809.10212 (2018)."},{"key":"e_1_2_2_29_1","volume-title":"Flow-Loss: learning cardinality estimates that matter. arXiv preprint arXiv:2101.04964","author":"Negi Parimarjan","year":"2021","unstructured":"Parimarjan Negi, Ryan Marcus, Andreas Kipf, Hongzi Mao, Nesime Tatbul, Tim Kraska, and Mohammad Alizadeh. 2021. Flow-Loss: learning cardinality estimates that matter. arXiv preprint arXiv:2101.04964 (2021)."},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-021-00689-y"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.14778\/3485450.3485459"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300087"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.4018\/jdwm.2007070101"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/3494124.3494126"},{"key":"e_1_2_2_35_1","volume-title":"Are we ready for learned cardinality estimation? arXiv preprint arXiv:2012.06743","author":"Wang Xiaoying","year":"2020","unstructured":"Xiaoying Wang, Changbo Qu, Weiyuan Wu, Jiannan Wang, and Qingqing Zhou. 2020. Are we ready for learned cardinality estimation? arXiv preprint arXiv:2012.06743 (2020)."},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882914"},{"key":"e_1_2_2_37_1","volume-title":"Balsa: Learning a Query Optimizer Without Expert Demonstrations. arXiv preprint arXiv:2201.01441","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. arXiv preprint arXiv:2201.01441 (2022)."},{"key":"e_1_2_2_38_1","volume-title":"NeuroCard: one cardinality estimator for all tables. arXiv preprint arXiv:2006.08109","author":"Yang Zongheng","year":"2020","unstructured":"Zongheng Yang, Amog Kamsetty, Sifei Luan, Eric Liang, Yan Duan, Xi Chen, and Ion Stoica. 2020. NeuroCard: one cardinality estimator for all tables. arXiv preprint arXiv:2006.08109 (2020)."},{"key":"e_1_2_2_39_1","volume-title":"Deep unsupervised cardinality estimation. arXiv preprint arXiv:1905.04278","author":"Yang Zongheng","year":"2019","unstructured":"Zongheng Yang, Eric Liang, Amog Kamsetty, Chenggang Wu, Yan Duan, Xi Chen, Pieter Abbeel, Joseph M Hellerstein, Sanjay Krishnan, and Ion Stoica. 2019. Deep unsupervised cardinality estimation. arXiv preprint arXiv:1905.04278 (2019)."}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3588963","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3588963","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:38Z","timestamp":1750178858000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3588963"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,26]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,5,26]]}},"alternative-id":["10.1145\/3588963"],"URL":"https:\/\/doi.org\/10.1145\/3588963","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,26]]}}}