{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T20:57:23Z","timestamp":1775595443262,"version":"3.50.1"},"reference-count":71,"publisher":"Association for Computing Machinery (ACM)","issue":"1","funder":[{"name":"Australian Research Council","award":["FT240100832"],"award-info":[{"award-number":["FT240100832"]}]},{"name":"Australian Research Council","award":["DP240101211"],"award-info":[{"award-number":["DP240101211"]}]},{"name":"National Key Research and Development Program of China","award":["2023YFB4503604"],"award-info":[{"award-number":["2023YFB4503604"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2026,4,2]]},"abstract":"<jats:p>Modern analytical workloads, particularly those powering business intelligence dashboards, are dominated by parameterized queries, where a small number of query templates are executed repeatedly with varying predicate values. Classical cost-based optimizers frequently fail to produce efficient execution plans in this setting due to inaccurate cardinality estimation and unstable plan choices. Although numerous learning-based optimizers have been proposed, most are designed for general, ad-hoc query optimization and overlook the repetitive structure of parameterized workloads. As a result, they often incur high training or serving overheads or require substantial modifications to existing database systems, limiting their practical adoption. We propose PLARQ, a practical learned optimizer tailored for Parameterized Query Optimization (PQO). We begin by analyzing existing approaches through a unified two-stage framework: (1) Plan Candidate Generation (PCG), which forms a set of plausible execution plans, and (2) Plan Ranking (PR), which selects the most promising one. This abstraction captures the core design principles of prior work and provides a foundation for systematic comparison. Building on this framework, PLARQ employs a similarity-based PCG approach to retrieve a compact, high-quality set of plan candidates from a precomputed plan pool, and a list-wise, attention-based ranking model to effectively identify the optimal plan among them. PLARQ integrates seamlessly with PostgreSQL without modifying the optimizer internals. Extensive experiments across five benchmarks demonstrate that PLARQ improves end-to-end query performance, achieving speedups of up to 420.31x over PostgreSQL and up to 2x over existing learned methods.<\/jats:p>","DOI":"10.1145\/3788254","type":"journal-article","created":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T17:54:13Z","timestamp":1775584453000},"page":"1-26","source":"Crossref","is-referenced-by-count":0,"title":["Practical Parameterized Query Optimization via Efficient Plan Reuse and List-wise Ranking"],"prefix":"10.1145","volume":"4","author":[{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0009-0007-4433-9232","authenticated-orcid":false,"given":"Hai","family":"Lan","sequence":"first","affiliation":[{"name":"School of Electrical Engineering and Computer Science, The University of Queensland, Brisbane, Queensland, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0009-0007-4342-6713","authenticated-orcid":false,"given":"Yang","family":"Yu","sequence":"additional","affiliation":[{"name":"School of Computer Science, Wuhan University, Wuhan, Hubei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0003-2477-381X","authenticated-orcid":false,"given":"Zhifeng","family":"Bao","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering and Computer Science, The University of Queensland, Brisbane, Queensland, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-9738-4949","authenticated-orcid":false,"given":"Zi","family":"Huang","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering and Computer Science, The University of Queensland, Brisbane, Queensland, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-6860-1342","authenticated-orcid":false,"given":"Yuwei","family":"Peng","sequence":"additional","affiliation":[{"name":"School of Computer Science, Wuhan University, Wuhan, Hubei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2026,4,7]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"n.d.. Bao's Source Code. https:\/\/2.zoppoz.workers.dev:443\/https\/github.com\/learnedsystems\/BaoForPostgreSQL."},{"key":"e_1_2_1_2_1","unstructured":"n.d.. Lero's Source Code. https:\/\/2.zoppoz.workers.dev:443\/https\/github.com\/AlibabaIncubator\/Lero-on-PostgreSQL."},{"key":"e_1_2_1_3_1","unstructured":"n.d.. Oracle. https:\/\/2.zoppoz.workers.dev:443\/https\/www.oracle.com\/."},{"key":"e_1_2_1_4_1","unstructured":"n.d.. pg_hint_plan. https:\/\/2.zoppoz.workers.dev:443\/https\/github.com\/ossc-db\/pg_hint_plan."},{"key":"e_1_2_1_5_1","unstructured":"n.d.. PostgreSQL. https:\/\/2.zoppoz.workers.dev:443\/http\/www.postgresql.org\/."},{"key":"e_1_2_1_6_1","unstructured":"n.d.. SQL Server. https:\/\/2.zoppoz.workers.dev:443\/https\/www.microsoft.com\/en-au\/sql-server\/sql-server-2019."},{"key":"e_1_2_1_7_1","unstructured":"n.d.. Stack. https:\/\/2.zoppoz.workers.dev:443\/https\/rmarcus.info\/stack.html."},{"key":"e_1_2_1_8_1","unstructured":"n.d.. STATS. https:\/\/2.zoppoz.workers.dev:443\/https\/github.com\/Nathaniel-Han\/End-to-End-CardEst-Benchmark."},{"key":"e_1_2_1_9_1","unstructured":"n.d.. TPC-DS. https:\/\/2.zoppoz.workers.dev:443\/https\/www.tpc.org\/tpcds\/."},{"key":"e_1_2_1_10_1","unstructured":"n.d.. TPC-H. https:\/\/2.zoppoz.workers.dev:443\/https\/www.tpc.org\/tpch\/."},{"key":"e_1_2_1_11_1","volume-title":"Zdonik","author":"Akdere Mert","year":"2012","unstructured":"Mert Akdere, Ugur \u00c7etintemel, Matteo Riondato, Eli Upfal, and Stanley B. Zdonik. 2012. Learning-based Query Performance Modeling and Prediction. In ICDE. IEEE Computer Society, 390--401."},{"key":"e_1_2_1_12_1","volume-title":"Bowman","author":"Alu\u00e7 G\u00fcnes","year":"2012","unstructured":"G\u00fcnes Alu\u00e7, David DeHaan, and Ivan T. Bowman. 2012. Parametric Plan Caching Using Density-Based Clustering. In ICDE. IEEE Computer Society, 402--413."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3639309"},{"key":"e_1_2_1_14_1","volume-title":"BTW (LNI","author":"Behr Henriette","unstructured":"Henriette Behr, Volker Markl, and Zoi Kaoudi. 2023. Learn What Really Matters: A Learning-to-Rank Approach for ML-based Query Optimization. In BTW (LNI, Vol. P-331). Gesellschaft f\u00fcr Informatik e.V., 535--554."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2008.160"},{"key":"e_1_2_1_16_1","volume-title":"Narasayya","author":"Chaudhuri Surajit","year":"2010","unstructured":"Surajit Chaudhuri, Hongrae Lee, and Vivek R. Narasayya. 2010. Variance aware optimization of parameterized queries. In SIGMOD. ACM, 531--542."},{"key":"e_1_2_1_17_1","volume-title":"Query Rewriting via LLMs. CoRR abs\/2502.12918","author":"Dharwada Sriram","year":"2025","unstructured":"Sriram Dharwada, Himanshu Devrani, Jayant R. Haritsa, and Harish Doraiswamy. 2025. Query Rewriting via LLMs. CoRR abs\/2502.12918 (2025)."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588963"},{"key":"e_1_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Anshuman Dutt Vivek R. Narasayya and Surajit Chaudhuri. 2017. Leveraging Re-costing for Online Optimization of Parameterized Queries with Guarantees. In SIGMOD. 1539--1554.","DOI":"10.1145\/3035918.3064040"},{"key":"e_1_2_1_20_1","unstructured":"Sumit Ganguly. 1998. Design and Analysis of Parametric Query Optimization Algorithms. In VLDB Ashish Gupta Oded Shmueli and Jennifer Widom (Eds.). 228--238."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/3503585.3503586"},{"key":"e_1_2_1_22_1","volume-title":"Join Query Optimization with Deep Reinforcement Learning Algorithms. CoRR abs\/1911.11689","author":"Heitz Jonas","year":"2019","unstructured":"Jonas Heitz and Kurt Stockinger. 2019. Join Query Optimization with Deep Reinforcement Learning Algorithms. CoRR abs\/1911.11689 (2019)."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/3384345.3384349"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3572751.3572767"},{"key":"e_1_2_1_25_1","volume-title":"Seo, Wook-Shin Han, Kangwoo Choi, and Jaehyok Chong.","author":"Kim Kyoungmin","year":"2022","unstructured":"Kyoungmin Kim, Jisung Jung, In Seo, Wook-Shin Han, Kangwoo Choi, and Jaehyok Chong. 2022. Learned Cardinality Estimation: An In-depth Study. In SIGMOD. ACM, 1214--1227."},{"key":"e_1_2_1_26_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."},{"key":"e_1_2_1_27_1","volume-title":"Learning to Optimize Join Queries With Deep Reinforcement Learning. CoRR abs\/1808.03196","author":"Krishnan Sanjay","year":"2018","unstructured":"Sanjay Krishnan, Zongheng Yang, Ken Goldberg, Joseph M. Hellerstein, and Ion Stoica. 2018. Learning to Optimize Join Queries With Deep Reinforcement Learning. CoRR abs\/1808.03196 (2018)."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3709670"},{"key":"e_1_2_1_29_1","first-page":"86","article-title":"A Survey on Advancing the DBMS Query Optimizer: Cardinality Estimation, Cost Model, and Plan Enumeration. Data Sci","volume":"6","author":"Lan Hai","year":"2021","unstructured":"Hai Lan, Zhifeng Bao, and Yuwei Peng. 2021. A Survey on Advancing the DBMS Query Optimizer: Cardinality Estimation, Cost Model, and Plan Enumeration. Data Sci. Eng. 6, 1 (2021), 86--101.","journal-title":"Eng."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/3712221.3712224"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850583.2850594"},{"key":"e_1_2_1_32_1","volume-title":"Warper: Efficiently Adapting Learned Cardinality Estimators to Data and Workload Drifts. In SIGMOD","author":"Li Beibin","year":"2022","unstructured":"Beibin Li, Yao Lu, and Srikanth Kandula. 2022. Warper: Efficiently Adapting Learned Cardinality Estimators to Data and Workload Drifts. In SIGMOD, 2022. ACM, 1920--1933."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/3696435.3696440"},{"key":"e_1_2_1_34_1","volume-title":"Query Rewriting via Large Language Models. CoRR abs\/2403.09060","author":"Liu Jie","year":"2024","unstructured":"Jie Liu and Barzan Mozafari. 2024. Query Rewriting via Large Language Models. CoRR abs\/2403.09060 (2024)."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000016"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/3494124.3494127"},{"key":"e_1_2_1_37_1","volume-title":"Bao: Making Learned Query Optimization Practical. In SIGMOD. ACM, 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. ACM, 1275--1288."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342644"},{"key":"e_1_2_1_39_1","first-page":"1","article-title":"Deep Reinforcement Learning for Join Order Enumeration. In aiDM@SIGMOD 2018","volume":"3","author":"Marcus Ryan","year":"2018","unstructured":"Ryan Marcus and Olga Papaemmanouil. 2018. Deep Reinforcement Learning for Join Order Enumeration. In aiDM@SIGMOD 2018. ACM, 3:1--3:4.","journal-title":"ACM"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342646"},{"key":"e_1_2_1_41_1","volume-title":"Large Language Models: A Survey. CoRR abs\/2402.06196","author":"Minaee Shervin","year":"2024","unstructured":"Shervin Minaee, Tom\u00e1s Mikolov, Narjes Nikzad, Meysam Chenaghlu, Richard Socher, Xavier Amatriain, and Jianfeng Gao. 2024. Large Language Models: A Survey. CoRR abs\/2402.06196 (2024)."},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10139"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476259"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.14778\/3583140.3583164"},{"key":"e_1_2_1_45_1","volume-title":"Proceedings of the 31st International Conference on Very Large Data Bases","author":"Reddy Naveen","year":"2005","unstructured":"Naveen Reddy and Jayant R. Haritsa. 2005. Analyzing Plan Diagrams of Database Query Optimizers. In Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, August 30 - September 2, 2005. ACM, 1228--1240."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.14778\/3436905.3436907"},{"key":"e_1_2_1_47_1","doi-asserted-by":"crossref","unstructured":"Tarique Siddiqui Alekh Jindal Shi Qiao Hiren Patel and Wangchao Le. 2020. Cost Models for Big Data Query Processing: Learning Retrofitting and Our Findings. In SIGMOD. ACM 99--113.","DOI":"10.1145\/3318464.3380584"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.14778\/3368289.3368296"},{"key":"e_1_2_1_49_1","doi-asserted-by":"crossref","unstructured":"Ji Sun Guoliang Li and Nan Tang. 2021. Learned Cardinality Estimation for Similarity Queries. In SIGMOD. ACM 1745--1757.","DOI":"10.1145\/3448016.3452790"},{"key":"e_1_2_1_50_1","doi-asserted-by":"crossref","unstructured":"Immanuel Trummer Junxiong Wang Deepak Maram Samuel Moseley Saehan Jo and Joseph Antonakakis. 2019. SkinnerDB: Regret-Bounded Query Evaluation via Reinforcement Learning. In SIGMOD. ACM 1153--1170.","DOI":"10.1145\/3299869.3300088"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.14778\/3494124.3494126"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.14778\/3681954.3682031"},{"key":"e_1_2_1_53_1","first-page":"1","article-title":"Get Real: How Benchmarks Fail to Represent the Real World. In DBTest@SIGMOD 2018","volume":"1","author":"Vogelsgesang Adrian","year":"2018","unstructured":"Adrian Vogelsgesang, Michael Haubenschild, Jan Finis, Alfons Kemper, Viktor Leis, Tobias M\u00fchlbauer, Thomas Neumann, and Manuel Then. 2018. Get Real: How Benchmarks Fail to Represent the Real World. In DBTest@SIGMOD 2018. ACM, 1:1--1:6.","journal-title":"ACM"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.14778\/3485450.3485458"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.14778\/3461535.3461552"},{"key":"e_1_2_1_56_1","doi-asserted-by":"crossref","unstructured":"Yaoshu Wang Chuan Xiao Jianbin Qin Xin Cao Yifang Sun Wei Wang and Makoto Onizuka. 2020. Monotonic Cardinality Estimation of Similarity Selection: A Deep Learning Approach. In SIGMOD. ACM 1197--1212.","DOI":"10.1145\/3318464.3380570"},{"key":"e_1_2_1_57_1","doi-asserted-by":"crossref","unstructured":"Yaoshu Wang Chuan Xiao Jianbin Qin Rui Mao Makoto Onizuka Wei Wang Rui Zhang and Yoshiharu Ishikawa. 2021. Consistent and Flexible Selectivity Estimation for High-Dimensional Data. In SIGMOD. ACM 2319--2327.","DOI":"10.1145\/3448016.3452772"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.14778\/3611479.3611528"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3452830"},{"key":"e_1_2_1_60_1","volume-title":"BayesCard: A Unified Bayesian Framework for Cardinality Estimation. CoRR abs\/2012.14743","author":"Wu Ziniu","year":"2020","unstructured":"Ziniu Wu and Amir Shaikhha. 2020. BayesCard: A Unified Bayesian Framework for Cardinality Estimation. CoRR abs\/2012.14743 (2020)."},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3517885"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.14778\/3421424.3421432"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.14778\/3368289.3368294"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00116"},{"key":"e_1_2_1_65_1","volume-title":"SSCard: Substring Cardinality Estimation using Suffix Tree-Guided Learned FM-Index. arXiv preprint arXiv:2505.24312","author":"Zhan Yirui","year":"2025","unstructured":"Yirui Zhan, Wen Nie, and Jun Gao. 2025. SSCard: Substring Cardinality Estimation using Suffix Tree-Guided Learned FM-Index. arXiv preprint arXiv:2505.24312 (2025)."},{"key":"e_1_2_1_66_1","volume-title":"AutoCE: An Accurate and Efficient Model Advisor for Learned Cardinality Estimation. In 39th IEEE International Conference on Data Engineering, ICDE 2023","author":"Zhang Jintao","year":"2023","unstructured":"Jintao Zhang, Chao Zhang, Guoliang Li, and Chengliang Chai. 2023. AutoCE: An Accurate and Efficient Model Advisor for Learned Cardinality Estimation. In 39th IEEE International Conference on Data Engineering, ICDE 2023, Anaheim, CA, USA, April 3--7, 2023. IEEE, 2621--2633."},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3526052"},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.14778\/3636218.3636235"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.14778\/3485450.3485456"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.14778\/3583140.3583160"},{"key":"e_1_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.14778\/3461535.3461539"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/dl.acm.org\/doi\/pdf\/10.1145\/3788254","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T19:57:58Z","timestamp":1775591878000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/3788254"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,2]]},"references-count":71,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,4,2]]}},"alternative-id":["10.1145\/3788254"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1145\/3788254","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,2]]}}}