{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T14:33:31Z","timestamp":1784903611771,"version":"3.55.0"},"reference-count":37,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T00:00:00Z","timestamp":1710201600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"crossref","award":["CH 2464\/1-1"],"award-info":[{"award-number":["CH 2464\/1-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100006374","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["GR 4497\/5"],"award-info":[{"award-number":["GR 4497\/5"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2024,3,12]]},"abstract":"<jats:p>Cardinality estimation is an important step in cost-based database query optimization. The accuracy of the estimates directly affects the ability of an optimizer to identify the most efficient query execution plan correctly. In this paper, we study cardinality estimation of LIKE-queries, i.e., queries that use the LIKE-operator to match a pattern with wildcards against string-valued attributes. While both traditional and machine-learning-based approaches have been proposed to tackle this problem, we argue that they all suffer from drawbacks. Most importantly, many state-of-the-art approaches are not designed for patterns that contain wildcards in-between characters. Based on past research on neural language models, we introduce the LIKE-Pattern Language Model (LPLM) that uses a new language and a novel probability distribution function to capture the semantics of general LIKE-patterns. We also propose a method to generate training data for our model. We demonstrate that our method outperforms state-of-the-art approaches in terms of precision (Q-error), while offering comparable runtime performance and memory requirements.<\/jats:p>","DOI":"10.1145\/3639309","type":"journal-article","created":{"date-parts":[[2024,3,26]],"date-time":"2024-03-26T18:51:32Z","timestamp":1711479092000},"page":"1-25","source":"Crossref","is-referenced-by-count":12,"title":["LPLM: A Neural Language Model for Cardinality Estimation of LIKE-Queries"],"prefix":"10.1145","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1029-0473","authenticated-orcid":false,"given":"Mehmet","family":"Aytimur","sequence":"first","affiliation":[{"name":"University of Konstanz, Konstanz, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-4845-4743","authenticated-orcid":false,"given":"Silvan","family":"Reiner","sequence":"additional","affiliation":[{"name":"University of Konstanz, Konstanz, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-0532-0505","authenticated-orcid":false,"given":"Leonard","family":"W\u00f6rteler","sequence":"additional","affiliation":[{"name":"University of Konstanz, Konstanz, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9623-9133","authenticated-orcid":false,"given":"Theodoros","family":"Chondrogiannis","sequence":"additional","affiliation":[{"name":"University of Konstanz, Konstanz, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1609-2221","authenticated-orcid":false,"given":"Michael","family":"Grossniklaus","sequence":"additional","affiliation":[{"name":"University of Konstanz, Konstanz, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,3,26]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.3906\/elk-1806--96"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113762"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/944919.944966"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1162\/tacl_a_00051"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2004.1319999"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/d14--1179"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/n19--1423"},{"key":"e_1_2_2_8_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_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389741"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/3384345.3384349"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012722442-8\/50011-2"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/115790.115835"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/303976.304001"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10362"},{"key":"e_1_2_2_16_1","volume-title":"Proceedings of the International Workshop on Applied AI for Database Systems and Applications.","author":"Kipf Andreas","year":"2019","unstructured":"Andreas Kipf, Michael Freitag, Dimitri Vorona, Peter Boncz, Thomas Neumann, and Alfons Kemper. 2019a. Estimating filtered group-by queries is hard: Deep learning to the rescue. In Proceedings of the International Workshop on Applied AI for Database Systems and Applications."},{"key":"e_1_2_2_17_1","volume-title":"Proceedings of the Biennial Conference on Innovative Data Systems Research (CIDR'19)","author":"Kipf Andreas","year":"2019","unstructured":"Andreas Kipf, Thomas Kipf, Bernhard Radke, Viktor Leis, Peter A. Boncz, and Alfons Kemper. 2019b. Learned Cardinalities: Estimating Correlated Joins with Deep Learning. In Proceedings of the Biennial Conference on Innovative Data Systems Research (CIDR'19)."},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/233269.233341"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551859"},{"key":"e_1_2_2_20_1","volume-title":"Proceedings of the International Conference on Machine Learning, (ICML'14)","author":"Quoc","unstructured":"Quoc V. Le and Tom\u00e1 s Mikolov. 2014. Distributed Representations of Sentences and Documents. In Proceedings of the International Conference on Machine Learning, (ICML'14). 1188--1196."},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1325851.1325877"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516455"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850583.2850594"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850583.2850594"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","unstructured":"Dong Li Qixu Zhang Xiaochong Liang Jida Guan and Yang Xu. 2015. Selectivity estimation for string predicates based on modified pruned count-suffix tree. (2015) 76--82. https:\/\/doi.org\/10.1049\/cje.2015.01.013","DOI":"10.1049\/cje.2015.01.013"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2899413"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342644"},{"key":"e_1_2_2_28_1","volume-title":"Proceedings of the International Conference on Learning Representations, Yoshua Bengio and Yann LeCun (Eds.).","author":"Mikolov Tom\u00e1","year":"2013","unstructured":"Tom\u00e1 s Mikolov, Kai Chen, Greg Corrado, and Jeffrey Dean. 2013. Efficient Estimation of Word Representations in Vector Space. In Proceedings of the International Conference on Learning Representations, Yoshua Bengio and Yann LeCun (Eds.)."},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687738"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/3213880.3213882"},{"key":"e_1_2_2_31_1","volume-title":"Proceedings og the VLDB Conf. 486--495","author":"Poosala Viswanath","unstructured":"Viswanath Poosala and Yannis E. Ioannidis. 1997. Selectivity Estimation Without the Attribute Value Independence Assumption. In Proceedings og the VLDB Conf. 486--495."},{"key":"e_1_2_2_32_1","unstructured":"PostgreSQL 14 Documentation. 2022. Chapter 72: How the Planner Uses Statistics. https:\/\/www.postgresql.org\/docs\/current\/planner-stats-details.html"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/b978-0--934613--53--8.50038--8"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/3436905.3436907"},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824051"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380570"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3183739"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3639309","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3639309","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T15:13:41Z","timestamp":1755789221000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3639309"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,12]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,3,12]]}},"alternative-id":["10.1145\/3639309"],"URL":"https:\/\/doi.org\/10.1145\/3639309","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,12]]}}}