{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:48:35Z","timestamp":1774986515788,"version":"3.50.1"},"reference-count":94,"publisher":"Association for Computing Machinery (ACM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2025,6,17]]},"abstract":"<jats:p>Join order optimization is critical in achieving good query performance. Despite decades of research and practice, modern query optimizers could still generate inferior join plans that are orders of magnitude slower than optimal. Existing research on robust query processing often lacks theoretical guarantees on join-order robustness while sacrificing query performance. In this paper, we rediscover the recent Predicate Transfer technique from a robustness point of view. We introduce two new algorithms, LargestRoot and SafeSubjoin, and then propose Robust Predicate Transfer (RPT) that is provably robust against arbitrary join orders of an acyclic query. We integrated Robust Predicate Transfer with DuckDB, a state-of-the-art analytical database, and evaluated against all the queries in TPC-H, JOB, TPC-DS, and DSB benchmarks. Our experimental results show that RPT improves join-order robustness by orders of magnitude compared to the baseline. With RPT, the largest ratio between the maximum and minimum execution time out of random join orders for a single acyclic query is only 1.6x (the ratio is close to 1 for most evaluated queries). Meanwhile, applying RPT also improves the end-to-end query performance by \u22481.5x (per-query geometric mean). We hope that this work sheds light on solving the practical join ordering problem.<\/jats:p>","DOI":"10.1145\/3725283","type":"journal-article","created":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:23:29Z","timestamp":1750281809000},"page":"1-28","source":"Crossref","is-referenced-by-count":5,"title":["Debunking the Myth of Join Ordering: Toward Robust SQL Analytics"],"prefix":"10.1145","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-1799-1985","authenticated-orcid":false,"given":"Junyi","family":"Zhao","sequence":"first","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-7622-7201","authenticated-orcid":false,"given":"Kai","family":"Su","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7481-1979","authenticated-orcid":false,"given":"Yifei","family":"Yang","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, Madison, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-0785-2519","authenticated-orcid":false,"given":"Xiangyao","family":"Yu","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, Madison, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6309-1702","authenticated-orcid":false,"given":"Paraschos","family":"Koutris","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, Madison, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-4821-1558","authenticated-orcid":false,"given":"Huanchen","family":"Zhang","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2025,6,18]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"http:\/\/www.tpc.org\/tpcds\/","author":"Benchmark TPC-DS","year":"1999","unstructured":"TPC-DS Benchmark. http:\/\/www.tpc.org\/tpcds\/, 1999."},{"key":"e_1_2_1_2_1","volume-title":"http:\/\/www.tpc.org\/tpch\/","author":"Benchmark TPC-H","year":"1999","unstructured":"TPC-H Benchmark. http:\/\/www.tpc.org\/tpch\/, 1999."},{"key":"e_1_2_1_3_1","volume-title":"http:\/\/github.com\/gregrahn\/join-order-benchmark\/","author":"Benchmark Join Order","year":"2015","unstructured":"Join Order Benchmark. http:\/\/github.com\/gregrahn\/join-order-benchmark\/, 2015."},{"key":"e_1_2_1_4_1","volume-title":"http:\/\/arrow.apache.org\/","author":"Arrow Apache","year":"2016","unstructured":"Apache Arrow. http:\/\/arrow.apache.org\/, 2016."},{"key":"e_1_2_1_5_1","volume-title":"http:\/\/www.postgresql.org\/","year":"2024","unstructured":"Postgresql. http:\/\/www.postgresql.org\/, 2024."},{"key":"e_1_2_1_6_1","volume-title":"https:\/\/duckdb.org","author":"DB.","year":"2024","unstructured":"DuckDB. https:\/\/duckdb.org, 2024."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00048"},{"key":"e_1_2_1_8_1","volume-title":"Emptyheaded: A relational engine for graph processing. ACM Transactions on Database Systems (TODS), 42(4):1--44","author":"Aberger Christopher R","year":"2017","unstructured":"Christopher R Aberger, Andrew Lamb, Susan Tu, Andres N\u00f6tzli, Kunle Olukotun, and Christopher R\u00e9. Emptyheaded: A relational engine for graph processing. ACM Transactions on Database Systems (TODS), 42(4):1--44, 2017."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920983"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3034786.3056105"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3651597"},{"key":"e_1_2_1_12_1","volume-title":"Safe subjoins in acyclic joins","author":"Afrati Foto N.","year":"2022","unstructured":"Foto N. Afrati. Safe subjoins in acyclic joins, 2022. URL https:\/\/arxiv.org\/abs\/2208.09671."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806446"},{"issue":"6","key":"e_1_2_1_14_1","doi-asserted-by":"crossref","first-page":"691","DOI":"10.14778\/3184470.3184473","article-title":"Distributed evaluation of subgraph queries using worst-case optimal lowmemory dataflows","volume":"11","author":"Ammar Khaled","year":"2018","unstructured":"Khaled Ammar, Frank McSherry, Semih Salihoglu, and Manas Joglekar. Distributed evaluation of subgraph queries using worst-case optimal lowmemory dataflows. Proceedings of the VLDB Endowment, 11(6):691--704, 2018.","journal-title":"Proceedings of the VLDB Endowment"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2742796"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/110859440"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335420"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066172"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066171"},{"key":"e_1_2_1_20_1","volume-title":"Using semi-joins to solve relational queries. Journal of the ACM (JACM), 28(1):25--40","author":"Bernstein Philip A","year":"1981","unstructured":"Philip A Bernstein and Dah-Ming W Chiu. Using semi-joins to solve relational queries. Journal of the ACM (JACM), 28(1):25--40, 1981."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/3681954.3681995"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48309-8_8"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/645912.671296"},{"key":"e_1_2_1_24_1","volume-title":"Database Theory-ICDT'97: 6th International Conference Delphi, Greece, January 8--10, 1997","author":"Chekuri Chandra","year":"1997","unstructured":"Chandra Chekuri and Anand Rajaraman. Conjunctive query containment revisited. In Database Theory-ICDT'97: 6th International Conference Delphi, Greece, January 8--10, 1997 Proceedings 6, pages 56--70. Springer, 1997."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/543613.543651"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2750545"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/3484224"},{"key":"e_1_2_1_28_1","volume-title":"Plan bouquets: A fragrant approach to robust query processing. ACM Transactions on Database Systems (TODS), 41(2):1--37","author":"Dutt Anshuman","year":"2016","unstructured":"Anshuman Dutt and Jayant R Haritsa. Plan bouquets: A fragrant approach to robust query processing. ACM Transactions on Database Systems (TODS), 41(2):1--37, 2016."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/3329772.3329780"},{"key":"e_1_2_1_30_1","volume-title":"Degrees of acyclicity for hypergraphs and relational database schemes. Journal of the ACM (JACM), 30 :514--550","author":"Fagin Ronald","year":"1983","unstructured":"Ronald Fagin. Degrees of acyclicity for hypergraphs and relational database schemes. Journal of the ACM (JACM), 30 :514--550, 1983."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407797"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/303976.303979"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-18579-4_1"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247569"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00242"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389741"},{"key":"e_1_2_1_37_1","volume-title":"Deepdb: learn from data, not from queries! Proceedings of the VLDB Endowment, 13(7):992--1005","author":"Hilprecht Benjamin","year":"2020","unstructured":"Benjamin Hilprecht, Andreas Schmidt, Moritz Kulessa, Alejandro Molina, Kristian Kersting, and Carsten Binnig. Deepdb: learn from data, not from queries! Proceedings of the VLDB Endowment, 13(7):992--1005, 2020."},{"key":"e_1_2_1_38_1","first-page":"258","volume-title":"Proceedings, Part I 18","author":"Hogan Aidan","year":"2019","unstructured":"Aidan Hogan, Cristian Riveros, Carlos Rojas, and Adri\u00e1n Soto. A worst-case optimal join algorithm for sparql. In The Semantic Web--ISWC 2019: 18th International Semantic Web Conference, Auckland, New Zealand, October 26--30, 2019, Proceedings, Part I 18, pages 258--275, 2019."},{"key":"e_1_2_1_39_1","volume-title":"Yisu Remy Wang, and Daniel P. Miranker. Treetracker join: Turning the tide when a tuple fails to join","author":"Hu Zeyuan","year":"2024","unstructured":"Zeyuan Hu, Yisu Remy Wang, and Daniel P. Miranker. Treetracker join: Turning the tide when a tuple fails to join, 2024. URL https:\/\/arxiv.org\/abs\/2403.01631."},{"key":"e_1_2_1_40_1","volume-title":"On the optimal nesting order for computing n-relational joins. ACM Transactions on Database Systems (TODS), 9(3):482--502","author":"Ibaraki Toshihide","year":"1984","unstructured":"Toshihide Ibaraki and Tiko Kameda. On the optimal nesting order for computing n-relational joins. ACM Transactions on Database Systems (TODS), 9(3):482--502, 1984."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/115790.115835"},{"key":"e_1_2_1_42_1","first-page":"1081","volume-title":"Proceedings of the 33rd International Conference on Very Large Data Bases","author":"Darera Jayant Harish D","year":"2007","unstructured":"Harish D Pooja N Darera Jayant and R Haritsa. On the production of anorexic plan diagrams. In Proceedings of the 33rd International Conference on Very Large Data Bases, pages 1081--1092, 2007."},{"key":"e_1_2_1_43_1","first-page":"1124","volume-title":"Proceedings of the 34th International Conference on Very Large Data Bases","author":"Darera Jayant Harish D","year":"2008","unstructured":"Harish D Pooja N Darera Jayant and R Haritsa. Identifying robust plans through plan diagram reduction. In Proceedings of the 34th International Conference on Very Large Data Bases, pages 1124--1140, 2008."},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.14778\/3648160.3648175"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276315"},{"key":"e_1_2_1_46_1","volume-title":"Panda: Query evaluation in submodular width","author":"Khamis Mahmoud Abo","year":"2024","unstructured":"Mahmoud Abo Khamis, Hung Q. Ngo, and Dan Suciu. Panda: Query evaluation in submodular width, 2024. URL https:\/\/arxiv.org\/abs\/2402.02001."},{"key":"e_1_2_1_47_1","volume-title":"9th Biennial Conference on Innovative Data Systems Research, CIDR 2019, Asilomar, CA, USA, January 13--16, 2019, Online Proceedings. www.cidrdb.org, 2019","author":"Kipf Andreas","year":"2019","unstructured":"Andreas Kipf, Thomas Kipf, Bernhard Radke, Viktor Leis, Peter A. Boncz, and Alfons Kemper. Learned cardinalities: Estimating correlated joins with deep learning. In 9th Biennial Conference on Innovative Data Systems Research, CIDR 2019, Asilomar, CA, USA, January 13--16, 2019, Online Proceedings. www.cidrdb.org, 2019. URL http:\/\/cidrdb.org\/cidr2019\/papers\/p101-kipf-cidr19.pdf."},{"key":"e_1_2_1_48_1","volume-title":"Bloom filters in distributed query execution","author":"Koutris Paraschos","year":"2011","unstructured":"Paraschos Koutris. Bloom filters in distributed query execution. University of Washington, CSE, 544, 2011."},{"key":"e_1_2_1_49_1","volume-title":"19th International Conference on Database Theory (ICDT 2016)","author":"Koutris Paraschos","year":"2016","unstructured":"Paraschos Koutris, Paul Beame, and Dan Suciu. Worst-case optimal algorithms for parallel query processing. In 19th International Conference on Database Theory (ICDT 2016), 2016."},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-020-00149-7"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.14778\/3654621.3654625"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850583.2850594"},{"key":"e_1_2_1_53_1","volume-title":"Really fast bitset decoding for ''average'' densities. https:\/\/lemire.me\/blog\/2019\/05\/03\/really-fast-bitsetdecoding-for-average-densities\/","author":"Lemire Daniel","year":"2019","unstructured":"Daniel Lemire. Really fast bitset decoding for ''average'' densities. https:\/\/lemire.me\/blog\/2019\/05\/03\/really-fast-bitsetdecoding-for-average-densities\/, 2019."},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476254"},{"key":"e_1_2_1_55_1","first-page":"10","volume-title":"Proc. Workshop on Database Query Optimization","volume":"13","author":"Lohman Guy","year":"2014","unstructured":"Guy Lohman. Is query optimization a ''solved'' problem. In Proc. Workshop on Database Query Optimization, volume 13, page 10, 2014."},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.5555\/1097039"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007642"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806790"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342643"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.5555\/1182635.1164207"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376672"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213565"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/2590989.2590991"},{"key":"e_1_2_1_64_1","volume-title":"Worst-case optimal join algorithms. Journal of the ACM (JACM), 65(3):1--40","author":"Ngo Hung Q","year":"2018","unstructured":"Hung Q Ngo, Ely Porat, Christopher R\u00e9, and Atri Rudra. Worst-case optimal join algorithms. Journal of the ACM (JACM), 65(3):1--40, 2018."},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389727"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00191"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72845-0_9"},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/3709676"},{"key":"e_1_2_1_69_1","volume-title":"Duckdb: In-process analytical database system. https:\/\/15721.courses.cs.cmu.edu\/spring2023\/slides\/22-duckdb.pdf","author":"Raasveldt Mark","year":"2023","unstructured":"Mark Raasveldt. Duckdb: In-process analytical database system. https:\/\/15721.courses.cs.cmu.edu\/spring2023\/slides\/22-duckdb.pdf, 2023."},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3320212"},{"key":"e_1_2_1_71_1","first-page":"145","volume-title":"Distributed Computing and Internet Technology: 5th International Conference, ICDCIT 2008 New Delhi, India, December 10--12, 2008. Proceedings 5","author":"Ramesh Sukriti","year":"2009","unstructured":"Sukriti Ramesh, Odysseas Papapetrou, andWolf Siberski. Optimizing distributed joins with bloom filters. In Distributed Computing and Internet Technology: 5th International Conference, ICDCIT 2008 New Delhi, India, December 10--12, 2008. Proceedings 5, pages 145--156, 2009."},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(86)90023-4"},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/582095.582099"},{"key":"e_1_2_1_74_1","volume-title":"Proceedings of the VLDB Endowment, 14(4)","author":"Shetiya Suraj","year":"2020","unstructured":"Suraj Shetiya, Saravanan Thirumuruganathan, Nick Koudas, and Gautam Das. Astrid: accurate selectivity estimation for string predicates using deep learning. Proceedings of the VLDB Endowment, 14(4), 2020."},{"key":"e_1_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS56636.2023.10175769"},{"key":"e_1_2_1_76_1","volume-title":"17th International Conference on Database Theory (ICDT 2014)","author":"Veldhuizen Todd L","year":"2014","unstructured":"Todd L Veldhuizen. Leapfrog triejoin: A simple, worst-case optimal join algorithm. In 17th International Conference on Database Theory (ICDT 2014), 2014."},{"key":"e_1_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1145\/3725423"},{"key":"e_1_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.14778\/3461535.3461552"},{"key":"e_1_2_1_79_1","volume-title":"Proceedings of the ACM on Management of Data, 1(2)","author":"RemyWang Yisu","year":"2023","unstructured":"Yisu RemyWang, Max Willsey, and Dan Suciu. Free join: Unifying worst-case optimal and traditional joins. Proceedings of the ACM on Management of Data, 1(2), 2023."},{"key":"e_1_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.14778\/3236187.3236191"},{"key":"e_1_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3452830"},{"key":"e_1_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.14778\/3704965.3704971"},{"key":"e_1_2_1_83_1","volume-title":"14th Conference on Innovative Data Systems Research, CIDR 2024","author":"Yang Yifei","year":"2024","unstructured":"Yifei Yang, Hangdong Zhao, Xiangyao Yu, and Paraschos Koutris. Predicate transfer: Efficient pre-filtering on multi-join queries. In 14th Conference on Innovative Data Systems Research, CIDR 2024, Chaminade, HI, USA, January 14--17, 2024. www.cidrdb.org, 2024. URL https:\/\/www.cidrdb.org\/cidr2024\/papers\/p22-yang.pdf."},{"key":"e_1_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.14778\/3368289.3368294"},{"key":"e_1_2_1_85_1","volume-title":"Proceedings of the VLDB Endowment, 14(1)","author":"Yang Zongheng","year":"2021","unstructured":"Zongheng Yang, Amog Kamsetty, Sifei Luan, Eric Liang, Yan Duan, Xi Chen, and Ion Stoica. Neurocard: one cardinality estimator for all tables. Proceedings of the VLDB Endowment, 14(1), 2021."},{"key":"e_1_2_1_86_1","first-page":"82","volume-title":"Proceedings of the 7th International Conference on Very Large Data Bases","volume":"81","author":"Yannakakis Mihalis","year":"1981","unstructured":"Mihalis Yannakakis. Algorithms for acyclic database schemes. In Proceedings of the 7th International Conference on Very Large Data Bases, volume 81, pages 82--94, 1981."},{"key":"e_1_2_1_87_1","doi-asserted-by":"publisher","DOI":"10.1145\/2854006.2854012"},{"key":"e_1_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.1109\/CMPSAC.1979.762509"},{"key":"e_1_2_1_89_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816695"},{"key":"e_1_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589330"},{"key":"e_1_2_1_91_1","volume-title":"Debunking the myth of join ordering: Toward robust sql analytics","author":"Zhao Junyi","year":"2025","unstructured":"Junyi Zhao, Kai Su, Yifei Yang, Xiangyao Yu, Paraschos Koutris, and Huanchen Zhang. Debunking the myth of join ordering: Toward robust sql analytics, 2025. URL https:\/\/arxiv.org\/abs\/2502.15181."},{"key":"e_1_2_1_92_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00183"},{"key":"e_1_2_1_93_1","doi-asserted-by":"publisher","DOI":"10.14778\/3090163.3090167"},{"key":"e_1_2_1_94_1","volume-title":"Proceedings of the VLDB Endowment, 14(9)","author":"Zhu Rong","year":"2021","unstructured":"Rong Zhu, Ziniu Wu, Yuxing Han, Kai Zeng, Andreas Pfadler, Zhengping Qian, Jingren Zhou, and Bin Cui. Flat: fast, lightweight and accurate method for cardinality estimation. Proceedings of the VLDB Endowment, 14(9), 2021."}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3725283","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T18:52:43Z","timestamp":1774983163000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3725283"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,17]]},"references-count":94,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,6,17]]}},"alternative-id":["10.1145\/3725283"],"URL":"https:\/\/doi.org\/10.1145\/3725283","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,17]]}}}