{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:42:57Z","timestamp":1780994577290,"version":"3.54.1"},"reference-count":27,"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":[{"name":"Hasso Plattner Institute","award":["FA8750-16-2-0021"],"award-info":[{"award-number":["FA8750-16-2-0021"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2024,3,12]]},"abstract":"<jats:p>Predicate pushing down is a key optimization used to speed up query processing. Much of the existing practice is restricted to pushing predicates explicitly listed in the query. In this paper, we consider the challenge of learning predicates during query execution which are then exploited to accelerate execution. Prior related approaches with a similar goal are restricted (e.g., learn only from only join columns or from specific data statistics). We significantly expand the realm of predicates that can be learned from different query operators (aggregations, joins, grouping, etc.) and develop a system, entitled PLAQUE, that learns such predicates during query execution. Comprehensive evaluations on both synthetic and real datasets demonstrate that the learned predicate approach adopted by PLAQUE can significantly accelerate query execution by up to 33x, and this improvement increases to up to 100x when User-Defined Functions (UDFs) are utilized in queries.<\/jats:p>","DOI":"10.1145\/3639301","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":3,"title":["PLAQUE: Automated Predicate Learning at Query Time"],"prefix":"10.1145","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6792-2155","authenticated-orcid":false,"given":"Yiming","family":"Lin","sequence":"first","affiliation":[{"name":"University of California, Berkeley, Berkeley, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1667-5435","authenticated-orcid":false,"given":"Sharad","family":"Mehrotra","sequence":"additional","affiliation":[{"name":"University of California, Irvine, Irvine, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,3,26]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"2016. Skew TPC-H Benchmark.https:\/\/ bit.ly\/ 2wvdNVo."},{"key":"e_1_2_1_2_1","unstructured":"2022. IMDB Data Set.https:\/\/ developer.imdb.com\/ non-commercial-datasets\/ ."},{"key":"e_1_2_1_3_1","unstructured":"2023. Event Condition Action (ECA).https:\/\/ en.wikipedia.org\/ wiki\/ Event_condition_action."},{"key":"e_1_2_1_4_1","unstructured":"2023. Join Order Benchmark.https:\/\/ github.com\/ gregrahn\/ join-order-benchmark."},{"key":"e_1_2_1_5_1","unstructured":"2023. Technical Report of PLAQUE: Automated Predicate Learning at Query Time.https:\/\/ drive.google.com\/ file\/ d\/ 1QhJot-kEM9dA5TJ0rljMXFJlsh_jG03z\/ view?usp=drive_link."},{"key":"e_1_2_1_6_1","unstructured":"2023. TPC-DS Benchmark.http:\/\/ www.tpc.org\/ tpcds."},{"key":"e_1_2_1_7_1","unstructured":"2023. TPC-H Benchmark.http:\/\/ www.tpc.org\/ tpch."},{"key":"e_1_2_1_8_1","unstructured":"2023. VanillaDB.https:\/\/ www.vanilladb.org\/ ."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/6012.15399"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012722442-8\/50065-3"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113341"},{"key":"e_1_2_1_12_1","first-page":"19","article-title":"The cascades framework for query optimization","volume":"18","author":"Graefe Goetz","year":"1995","unstructured":"Goetz Graefe. 1995. The cascades framework for query optimization. IEEE Data Eng. Bull. 18, 3 (1995), 19--29.","journal-title":"IEEE Data Eng. Bull."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407791"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007641"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497486"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/3368289.3368292"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687765"},{"key":"e_1_2_1_18_1","first-page":"329","article-title":"Locater: cleaning wifi connectivity datasets for semantic localization","volume":"3","author":"Yiming Lin","year":"2021","unstructured":"Yiming Lin et al . 2021. Locater: cleaning wifi connectivity datasets for semantic localization. Proceedings of the VLDB Endowment 3 (2021), 329 -- 341.","journal-title":"Proceedings of the VLDB Endowment"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476311.3476344"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/191843.191860"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/3199517.3199518"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816727"},{"key":"e_1_2_1_23_1","volume-title":"Optimized Theta-Join Processing. BTW 2021","author":"Weise Julian","year":"2021","unstructured":"Julian Weise, Sebastian Schmidl, and Thorsten Papenbrock. 2021. Optimized Theta-Join Processing. BTW 2021 (2021)."},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the 2016 ACM SIGMOD International Conference on Management of Data (SIGMOD). ACM.","author":"Wu Shan-Hung","year":"2012","unstructured":"Shan-Hung Wu, Tsai-Yu Feng, Meng-Kai Liao, Shao-Kan Pi, and Yu-Shan Lin. 2012. T-Part: Partitioning of Transactions for Forward-Pushing in Deterministic Database Systems. In Proceedings of the 2016 ACM SIGMOD International Conference on Management of Data (SIGMOD). ACM."},{"key":"e_1_2_1_25_1","volume-title":"Efficient multi-way theta-join processing using mapreduce. arXiv preprint arXiv:1208.0081","author":"Zhang Xiaofei","year":"2012","unstructured":"Xiaofei Zhang, Lei Chen, and Min Wang. 2012. Efficient multi-way theta-join processing using mapreduce. arXiv preprint arXiv:1208.0081 (2012)."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457262"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/3090163.3090167"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3639301","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3639301","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T15:12:44Z","timestamp":1755789164000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3639301"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,12]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,3,12]]}},"alternative-id":["10.1145\/3639301"],"URL":"https:\/\/doi.org\/10.1145\/3639301","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,12]]}}}