{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T19:39:25Z","timestamp":1771616365467,"version":"3.50.1"},"reference-count":70,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2021,9,28]],"date-time":"2021-09-28T00:00:00Z","timestamp":1632787200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Database Syst."],"published-print":{"date-parts":[[2021,9,30]]},"abstract":"<jats:p>SkinnerDB uses reinforcement learning for reliable join ordering, exploiting an adaptive processing engine with specialized join algorithms and data structures. It maintains no data statistics and uses no cost or cardinality models. Also, it uses no training workloads nor does it try to link the current query to seemingly similar queries in the past. Instead, it uses reinforcement learning to learn optimal join orders from scratch during the execution of the current query. To that purpose, it divides the execution of a query into many small time slices. Different join orders are tried in different time slices. SkinnerDB merges result tuples generated according to different join orders until a complete query result is obtained. By measuring execution progress per time slice, it identifies promising join orders as execution proceeds.<\/jats:p>\n          <jats:p>Along with SkinnerDB, we introduce a new quality criterion for query execution strategies. We upper-bound expected execution cost regret, i.e., the expected amount of execution cost wasted due to sub-optimal join order choices. SkinnerDB features multiple execution strategies that are optimized for that criterion. Some of them can be executed on top of existing database systems. For maximal performance, we introduce a customized execution engine, facilitating fast join order switching via specialized multi-way join algorithms and tuple representations.<\/jats:p>\n          <jats:p>We experimentally compare SkinnerDB\u2019s performance against various baselines, including MonetDB, Postgres, and adaptive processing methods. We consider various benchmarks, including the join order benchmark, TPC-H, and JCC-H, as well as benchmark variants with user-defined functions. Overall, the overheads of reliable join ordering are negligible compared to the performance impact of the occasional, catastrophic join order choice.<\/jats:p>","DOI":"10.1145\/3464389","type":"journal-article","created":{"date-parts":[[2021,9,28]],"date-time":"2021-09-28T20:52:15Z","timestamp":1632862335000},"page":"1-45","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":31,"title":["SkinnerDB: Regret-bounded Query Evaluation via Reinforcement Learning"],"prefix":"10.1145","volume":"46","author":[{"given":"Immanuel","family":"Trummer","sequence":"first","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}]},{"given":"Junxiong","family":"Wang","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}]},{"given":"Ziyun","family":"Wei","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}]},{"given":"Deepak","family":"Maram","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}]},{"given":"Samuel","family":"Moseley","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}]},{"given":"Saehan","family":"Jo","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}]},{"given":"Joseph","family":"Antonakakis","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}]},{"given":"Ankush","family":"Rayabhari","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,9,28]]},"reference":[{"key":"#cr-split#-e_1_2_2_1_1.1","doi-asserted-by":"crossref","unstructured":"A. Aboulnaga P. Haas M. Kandil S. Lightstone G. Lohman V. Markl I. Popivanov and V. Raman. 2004. Automated statistics collection in DB2 UDB. In PVLDB. 1169-1180. DOI:https:\/\/doi.org\/10.1145\/1066157.1066293 10.1145\/1066157.1066293","DOI":"10.1016\/B978-012088469-8.50100-5"},{"key":"#cr-split#-e_1_2_2_1_1.2","doi-asserted-by":"crossref","unstructured":"A. Aboulnaga P. Haas M. Kandil S. Lightstone G. Lohman V. Markl I. Popivanov and V. Raman. 2004. Automated statistics collection in DB2 UDB. In PVLDB. 1169-1180. DOI:https:\/\/doi.org\/10.1145\/1066157.1066293","DOI":"10.1016\/B978-012088469-8.50100-5"},{"key":"e_1_2_2_2_1","unstructured":"Mert Akdere and Ugur Cetintemel. 2011. Learning-based query performance modeling and predection. In ICDE. 390\u2013401. DOI:ftp:\/\/ftp.cs.brown.edu\/pub\/techreports\/11\/cs11-01.pdf  Mert Akdere and Ugur Cetintemel. 2011. Learning-based query performance modeling and predection. In ICDE. 390\u2013401. DOI:ftp:\/\/ftp.cs.brown.edu\/pub\/techreports\/11\/cs11-01.pdf"},{"key":"e_1_2_2_4_1","volume-title":"Wood","author":"Alyoubi Khaled H.","year":"2015","unstructured":"Khaled H. Alyoubi , Sven Helmer , and Peter T . Wood . 2015 . Ordering selection operators under partial ignorance. In CIKM. 1521\u20131530. DOI:https:\/\/doi.org\/10.1145\/2806416.2806446 10.1145\/2806416.2806446 Khaled H. Alyoubi, Sven Helmer, and Peter T. Wood. 2015. Ordering selection operators under partial ignorance. In CIKM. 1521\u20131530. DOI:https:\/\/doi.org\/10.1145\/2806416.2806446"},{"key":"e_1_2_2_5_1","volume-title":"Eddies: Continuously adaptive query processing. In SIGMOD. 261\u2013272. DOI:https:\/\/doi.org\/10.1145\/342009.335420","author":"Avnur Ron","year":"2000","unstructured":"Ron Avnur and J. M. Hellerstein . 2000 . Eddies: Continuously adaptive query processing. In SIGMOD. 261\u2013272. DOI:https:\/\/doi.org\/10.1145\/342009.335420 10.1145\/342009.335420 Ron Avnur and J. M. Hellerstein. 2000. Eddies: Continuously adaptive query processing. In SIGMOD. 261\u2013272. DOI:https:\/\/doi.org\/10.1145\/342009.335420"},{"key":"e_1_2_2_6_1","doi-asserted-by":"crossref","unstructured":"Brian Babcock and S. Chaudhuri. 2005. Towards a robust query optimizer: A principled and practical approach. In SIGMOD. 119\u2013130. Retrieved from http:\/\/dl.acm.org\/citation.cfm?id=1066172.  Brian Babcock and S. Chaudhuri. 2005. Towards a robust query optimizer: A principled and practical approach. In SIGMOD. 119\u2013130. Retrieved from http:\/\/dl.acm.org\/citation.cfm?id=1066172.","DOI":"10.1145\/1066157.1066172"},{"key":"#cr-split#-e_1_2_2_7_1.1","doi-asserted-by":"crossref","unstructured":"Shivnath Babu Pedro Bizarro and David DeWitt. 2005. Proactive re-optimization. In SIGMOD. 107-118. DOI:https:\/\/doi.org\/10.1145\/1066157.1066171 10.1145\/1066157.1066171","DOI":"10.1145\/1066157.1066171"},{"key":"#cr-split#-e_1_2_2_7_1.2","doi-asserted-by":"crossref","unstructured":"Shivnath Babu Pedro Bizarro and David DeWitt. 2005. Proactive re-optimization. In SIGMOD. 107-118. DOI:https:\/\/doi.org\/10.1145\/1066157.1066171","DOI":"10.1145\/1066157.1066171"},{"key":"e_1_2_2_8_1","first-page":"103","article-title":"JCC-H: Adding join crossing correlations with skew to TPC-H","volume":"10661","author":"Boncz Peter","year":"2018","unstructured":"Peter Boncz , Angelos Christos Anatiotis , and Steffen Kl\u00e4be . 2018 . JCC-H: Adding join crossing correlations with skew to TPC-H . LNCS 10661 (2018), 103 \u2013 119 . DOI:https:\/\/doi.org\/10.1007\/978-3-319-72401-0_8 10.1007\/978-3-319-72401-0_8 Peter Boncz, Angelos Christos Anatiotis, and Steffen Kl\u00e4be. 2018. JCC-H: Adding join crossing correlations with skew to TPC-H. LNCS 10661 (2018), 103\u2013119. DOI:https:\/\/doi.org\/10.1007\/978-3-319-72401-0_8","journal-title":"LNCS"},{"key":"#cr-split#-e_1_2_2_9_1.1","doi-asserted-by":"crossref","unstructured":"Nicolas Bruno and Surajit Chaudhuri. 2002. Exploiting statistics on query expressions for optimization. In SIGMOD. 263-274. DOI:https:\/\/doi.org\/10.1145\/564720.564722 10.1145\/564720.564722","DOI":"10.1145\/564720.564722"},{"key":"#cr-split#-e_1_2_2_9_1.2","doi-asserted-by":"crossref","unstructured":"Nicolas Bruno and Surajit Chaudhuri. 2002. Exploiting statistics on query expressions for optimization. In SIGMOD. 263-274. DOI:https:\/\/doi.org\/10.1145\/564720.564722","DOI":"10.1145\/564691.564722"},{"key":"#cr-split#-e_1_2_2_10_1.1","doi-asserted-by":"crossref","unstructured":"Surajit Chaudhuri and Vivek Narasayya. 2001. Automating statistics management for query optimizers. In ICDE. 7-20. DOI:https:\/\/doi.org\/10.1109\/69.908978 10.1109\/69.908978","DOI":"10.1109\/69.908978"},{"key":"#cr-split#-e_1_2_2_10_1.2","doi-asserted-by":"crossref","unstructured":"Surajit Chaudhuri and Vivek Narasayya. 2001. Automating statistics management for query optimizers. In ICDE. 7-20. DOI:https:\/\/doi.org\/10.1109\/69.908978","DOI":"10.1109\/69.908978"},{"key":"e_1_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Sophie Cluet and Guido Moerkotte. 1995. On the complexity of generating optimal left-deep processing trees with cross products. In ICDT. 54\u201367. DOI:http:\/\/link.springer.com\/chapter\/10.1007\/3-540-58907-4_6.  Sophie Cluet and Guido Moerkotte. 1995. On the complexity of generating optimal left-deep processing trees with cross products. In ICDT. 54\u201367. DOI:http:\/\/link.springer.com\/chapter\/10.1007\/3-540-58907-4_6.","DOI":"10.1007\/3-540-58907-4_6"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1497290.1497300"},{"key":"e_1_2_2_13_1","volume-title":"Uncertainty in Artificial Intelligence","author":"Coquelin Pierre-Arnaud","unstructured":"Pierre-Arnaud Coquelin and R\u00e9mi Munos . 2007. Bandit algorithms for tree search . In Uncertainty in Artificial Intelligence . AUAI Press , 67\u201374. arxiv:arXiv:cs\/0703062v1. Pierre-Arnaud Coquelin and R\u00e9mi Munos. 2007. Bandit algorithms for tree search. In Uncertainty in Artificial Intelligence. AUAI Press, 67\u201374. arxiv:arXiv:cs\/0703062v1."},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453976"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/974121.974129"},{"key":"e_1_2_2_16_1","first-page":"1","article-title":"Adaptive query processing","volume":"1","author":"Deshpande Amol","year":"2006","unstructured":"Amol Deshpande , Zachary Ives , and Vijayshankar Raman . 2006 . Adaptive query processing . Found. Trends Datab. 1 , 1 (2006), 1 \u2013 140 . DOI:https:\/\/doi.org\/10.1561\/1900000001 10.1561\/1900000001 Amol Deshpande, Zachary Ives, and Vijayshankar Raman. 2006. Adaptive query processing. Found. Trends Datab. 1, 1 (2006), 1\u2013140. DOI:https:\/\/doi.org\/10.1561\/1900000001","journal-title":"Found. Trends Datab."},{"key":"e_1_2_2_17_1","unstructured":"Carmel Domshlak and Zohar Feldman. 2013. To UCT or not to UCT? In SoCS. 1\u20138. DOI:http:\/\/www.aaai.org\/ocs\/index.php\/SOCS\/SOCS13\/paper\/view\/7268  Carmel Domshlak and Zohar Feldman. 2013. To UCT or not to UCT? In SoCS. 1\u20138. DOI:http:\/\/www.aaai.org\/ocs\/index.php\/SOCS\/SOCS13\/paper\/view\/7268"},{"key":"#cr-split#-e_1_2_2_18_1.1","doi-asserted-by":"crossref","unstructured":"Jennie Duggan Ugur Cetintemel Olga Papaemmanouil and Eli Upfal. 2011. Performance prediction for concurrent database workloads. In SIGMOD. 337-348. DOI:https:\/\/doi.org\/10.1145\/1989323.1989359 10.1145\/1989323.1989359","DOI":"10.1145\/1989323.1989359"},{"key":"#cr-split#-e_1_2_2_18_1.2","doi-asserted-by":"crossref","unstructured":"Jennie Duggan Ugur Cetintemel Olga Papaemmanouil and Eli Upfal. 2011. Performance prediction for concurrent database workloads. In SIGMOD. 337-348. DOI:https:\/\/doi.org\/10.1145\/1989323.1989359","DOI":"10.1145\/1989323.1989359"},{"key":"e_1_2_2_19_1","first-page":"5","article-title":"QUEST: An exploratory approach to robust query processing","volume":"7","author":"Dutt Anshuman","year":"2014","unstructured":"Anshuman Dutt . 2014 . QUEST: An exploratory approach to robust query processing . PVLDB 7 , 13 (2014), 5 \u2013 8 . Anshuman Dutt. 2014. QUEST: An exploratory approach to robust query processing. PVLDB 7, 13 (2014), 5\u20138.","journal-title":"PVLDB"},{"key":"#cr-split#-e_1_2_2_20_1.1","doi-asserted-by":"crossref","unstructured":"Anshuman Dutt and Jayant Haritsa. 2014. Plan bouquets: Query processing without selectivity estimation. In SIGMOD. 1039-1050. DOI:https:\/\/doi.org\/10.1145\/2588555.2588566 10.1145\/2588555.2588566","DOI":"10.1145\/2588555.2588566"},{"key":"#cr-split#-e_1_2_2_20_1.2","doi-asserted-by":"crossref","unstructured":"Anshuman Dutt and Jayant Haritsa. 2014. Plan bouquets: Query processing without selectivity estimation. In SIGMOD. 1039-1050. DOI:https:\/\/doi.org\/10.1145\/2588555.2588566","DOI":"10.1145\/2588555.2588566"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687556"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/2750423.2750427"},{"key":"e_1_2_2_23_1","doi-asserted-by":"crossref","unstructured":"Archana Ganapathi Harumi Kuno Umeshwar Dayal Janet L. Wiener Armando Fox Michael Jordan and David Patterson. 2009. Predicting multiple metrics for queries\u2014Better decisions enabled by machine learning. In ICDE. 592\u2013603.  Archana Ganapathi Harumi Kuno Umeshwar Dayal Janet L. Wiener Armando Fox Michael Jordan and David Patterson. 2009. Predicting multiple metrics for queries\u2014Better decisions enabled by machine learning. In ICDE. 592\u2013603.","DOI":"10.1109\/ICDE.2009.130"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2093548.2093574"},{"key":"e_1_2_2_25_1","volume-title":"How good are query optimizers, really?PVLDB 9, 3","author":"Gubichev Andrey","year":"2015","unstructured":"Andrey Gubichev , Peter Boncz , Alfons Kemper , and Thomas Neumann . 2015. How good are query optimizers, really?PVLDB 9, 3 ( 2015 ), 204\u2013215. Andrey Gubichev, Peter Boncz, Alfons Kemper, and Thomas Neumann. 2015. How good are query optimizers, really?PVLDB 9, 3 (2015), 204\u2013215."},{"key":"#cr-split#-e_1_2_2_26_1.1","doi-asserted-by":"crossref","unstructured":"P. J. Haas and A. N. Swami. 2011. Sampling-based selectivity estimation for joins using augmented frequent value statistics. In ICDE. 522-531. DOI:https:\/\/doi.org\/10.1109\/ICDE.1995.380361 10.1109\/ICDE.1995.380361","DOI":"10.1109\/ICDE.1995.380361"},{"key":"#cr-split#-e_1_2_2_26_1.2","doi-asserted-by":"crossref","unstructured":"P. J. Haas and A. N. Swami. 2011. Sampling-based selectivity estimation for joins using augmented frequent value statistics. In ICDE. 522-531. DOI:https:\/\/doi.org\/10.1109\/ICDE.1995.380361","DOI":"10.1109\/ICDE.1995.380361"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/141484.130335"},{"key":"e_1_2_2_28_1","volume-title":"DeepDB: Learn from data, not from queries!PVLDB 13, 7","author":"Hilprecht Benjamin","year":"2019","unstructured":"Benjamin Hilprecht , Andreas Schmidt , Moritz Kulessa , Alejandro Molina , Kristian Kersting , and Carsten Binnig . 2019. DeepDB: Learn from data, not from queries!PVLDB 13, 7 ( 2019 ), 992\u20131005. DOI:https:\/\/doi.org\/10.14778\/3384345.3384349 10.14778\/3384345.3384349 Benjamin Hilprecht, Andreas Schmidt, Moritz Kulessa, Alejandro Molina, Kristian Kersting, and Carsten Binnig. 2019. DeepDB: Learn from data, not from queries!PVLDB 13, 7 (2019), 992\u20131005. DOI:https:\/\/doi.org\/10.14778\/3384345.3384349"},{"key":"#cr-split#-e_1_2_2_29_1.1","doi-asserted-by":"crossref","unstructured":"Konstantinos Karanasos Andrey Balmin Marcel Kutsch Fatma Ozcan Vuk Ercegovac Chunyang Xia and Jesse Jackson. 2014. Dynamically optimizing queries over large scale data platforms. In SIGMOD. 943-954. DOI:https:\/\/doi.org\/10.1145\/2588555.2610531 10.1145\/2588555.2610531","DOI":"10.1145\/2588555.2610531"},{"key":"#cr-split#-e_1_2_2_29_1.2","doi-asserted-by":"crossref","unstructured":"Konstantinos Karanasos Andrey Balmin Marcel Kutsch Fatma Ozcan Vuk Ercegovac Chunyang Xia and Jesse Jackson. 2014. Dynamically optimizing queries over large scale data platforms. In SIGMOD. 943-954. DOI:https:\/\/doi.org\/10.1145\/2588555.2610531","DOI":"10.1145\/2588555.2610531"},{"key":"e_1_2_2_30_1","unstructured":"Andreas Kipf Thomas Kipf Bernhard Radke Viktor Leis Peter Boncz and Alfons Kemper. 2018. Learned cardinalities: Estimating correlated joins with deep learning. In CIDR. Retrieved from http:\/\/arxiv.org\/abs\/1809.00677.  Andreas Kipf Thomas Kipf Bernhard Radke Viktor Leis Peter Boncz and Alfons Kemper. 2018. Learned cardinalities: Estimating correlated joins with deep learning. In CIDR. Retrieved from http:\/\/arxiv.org\/abs\/1809.00677."},{"key":"e_1_2_2_31_1","doi-asserted-by":"crossref","unstructured":"Levente Kocsis and C. Szepesv\u00e1ri. 2006. Bandit based monte-carlo planning. In ECML. 282\u2013293. DOI:http:\/\/www.springerlink.com\/index\/D232253353517276.pdf  Levente Kocsis and C. Szepesv\u00e1ri. 2006. Bandit based monte-carlo planning. In ECML. 282\u2013293. DOI:http:\/\/www.springerlink.com\/index\/D232253353517276.pdf","DOI":"10.1007\/11871842_29"},{"key":"e_1_2_2_32_1","unstructured":"Sanjay Krishnan Zongheng Yang Ken Goldberg Joseph Hellerstein and Ion Stoica. 2018. Learning to optimize join queries with deep reinforcement learning. Retrieved from http:\/\/arxiv.org\/abs\/1808.03196.  Sanjay Krishnan Zongheng Yang Ken Goldberg Joseph Hellerstein and Ion Stoica. 2018. Learning to optimize join queries with deep reinforcement learning. Retrieved from http:\/\/arxiv.org\/abs\/1808.03196."},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/3352063.3352129"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350269"},{"key":"e_1_2_2_35_1","volume-title":"Schneider","author":"Lipton Richard J.","year":"1990","unstructured":"Richard J. Lipton , Jeffrey F. Naughton , and Donovan A . Schneider . 1990 . Practical selectivity estimation through adaptive sampling. In SIGMOD. 1\u201311. DOI:https:\/\/doi.org\/10.1145\/93605.93611 10.1145\/93605.93611 Richard J. Lipton, Jeffrey F. Naughton, and Donovan A. Schneider. 1990. Practical selectivity estimation through adaptive sampling. In SIGMOD. 1\u201311. DOI:https:\/\/doi.org\/10.1145\/93605.93611"},{"key":"e_1_2_2_36_1","volume-title":"\u201csolved","author":"Lohman Guy","year":"2014","unstructured":"Guy Lohman . 2014. Is query optimization a \u201csolved \u201d problem?SIGMOD Blog ( 2014 ). https:\/\/wp.sigmod.org\/?p=1075 Guy Lohman. 2014. Is query optimization a \u201csolved\u201d problem?SIGMOD Blog (2014). https:\/\/wp.sigmod.org\/?p=1075"},{"key":"e_1_2_2_37_1","first-page":"1705","article-title":"Neo: A learned query optimizer","volume":"12","author":"Marcus Ryan","year":"2018","unstructured":"Ryan Marcus , Parimarjan Negi , Hongzi Mao , Chi Zhang , Mohammad Alizadeh , Tim Kraska , Olga Papaemmanouil , and Nesime Tatbul . 2018 . Neo: A learned query optimizer . PVLDB 12 , 11 (2018), 1705 \u2013 1718 . DOI:https:\/\/doi.org\/10.14778\/3342263.3342644 10.14778\/3342263.3342644 Ryan Marcus, Parimarjan Negi, Hongzi Mao, Chi Zhang, Mohammad Alizadeh, Tim Kraska, Olga Papaemmanouil, and Nesime Tatbul. 2018. Neo: A learned query optimizer. PVLDB 12, 11 (2018), 1705\u20131718. DOI:https:\/\/doi.org\/10.14778\/3342263.3342644","journal-title":"PVLDB"},{"key":"e_1_2_2_38_1","doi-asserted-by":"crossref","unstructured":"Ryan Marcus and Olga Papaemmanouil. 2018. Deep reinforcement learning for join order enumeration. In aiDM. 3. Retrieved from arxiv:arXiv:1803.00055v2.  Ryan Marcus and Olga Papaemmanouil. 2018. Deep reinforcement learning for join order enumeration. In aiDM. 3. Retrieved from arxiv:arXiv:1803.00055v2.","DOI":"10.1145\/3211954.3211957"},{"key":"e_1_2_2_39_1","unstructured":"Thomas Neumann and Cesar Galindo-Legaria. 2013. Taking the edge off cardinality estimation errors using incremental execution. In BTW. 73\u201392.   Thomas Neumann and Cesar Galindo-Legaria. 2013. Taking the edge off cardinality estimation errors using incremental execution. In BTW. 73\u201392."},{"key":"e_1_2_2_40_1","unstructured":"Thomas Neumann and Alfons Kemper. 2015. Unnesting arbitrary queries. In BTW. 383\u2013402. DOI:http:\/\/www.btw-2015.de\/res\/proceedings\/Hauptband\/Wiss\/Neumann-Unnesting_Arbitrary_Querie.pdf.  Thomas Neumann and Alfons Kemper. 2015. Unnesting arbitrary queries. In BTW. 383\u2013402. DOI:http:\/\/www.btw-2015.de\/res\/proceedings\/Hauptband\/Wiss\/Neumann-Unnesting_Arbitrary_Querie.pdf."},{"key":"e_1_2_2_41_1","unstructured":"Hung Q. Ngo Ely Porat and Christopher R\u00e9. 2012. Worst-case optimal join algorithms. In PODS. 37\u201348.   Hung Q. Ngo Ely Porat and Christopher R\u00e9. 2012. Worst-case optimal join algorithms. In PODS. 37\u201348."},{"key":"e_1_2_2_42_1","unstructured":"Jennifer Ortiz Magdalena Balazinska Johannes Gehrke and S. Sathiya Keerthi. 2019. An empirical analysis of deep learning for cardinality estimation. Retrieved from http:\/\/arxiv.org\/abs\/1905.06425.  Jennifer Ortiz Magdalena Balazinska Johannes Gehrke and S. Sathiya Keerthi. 2019. An empirical analysis of deep learning for cardinality estimation. Retrieved from http:\/\/arxiv.org\/abs\/1905.06425."},{"key":"#cr-split#-e_1_2_2_43_1.1","doi-asserted-by":"crossref","unstructured":"Yongjoo Park Shucheng Zhong and Barzan Mozafari. 2020. QuickSel: Quick selectivity learning with mixture models. In SIGMOD. 1017-1033. DOI:https:\/\/doi.org\/10.1145\/3318464.3389727 10.1145\/3318464.3389727","DOI":"10.1145\/3318464.3389727"},{"key":"#cr-split#-e_1_2_2_43_1.2","doi-asserted-by":"crossref","unstructured":"Yongjoo Park Shucheng Zhong and Barzan Mozafari. 2020. QuickSel: Quick selectivity learning with mixture models. In SIGMOD. 1017-1033. DOI:https:\/\/doi.org\/10.1145\/3318464.3389727","DOI":"10.1145\/3318464.3389727"},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556553"},{"key":"#cr-split#-e_1_2_2_45_1.1","doi-asserted-by":"crossref","unstructured":"Li Quanzhong Shao Minglong Volker Markl Kevin Beyer Latha Colby and Guy Lohman. 2007. Adaptively reordering joins during query execution. In ICDE. 26-35. DOI:https:\/\/doi.org\/10.1109\/ICDE.2007.367848 10.1109\/ICDE.2007.367848","DOI":"10.1109\/ICDE.2007.367848"},{"key":"#cr-split#-e_1_2_2_45_1.2","doi-asserted-by":"crossref","unstructured":"Li Quanzhong Shao Minglong Volker Markl Kevin Beyer Latha Colby and Guy Lohman. 2007. Adaptively reordering joins during query execution. In ICDE. 26-35. DOI:https:\/\/doi.org\/10.1109\/ICDE.2007.367848","DOI":"10.1109\/ICDE.2007.367848"},{"key":"#cr-split#-e_1_2_2_46_1.1","doi-asserted-by":"crossref","unstructured":"Vijayshankar Raman A. Deshpande and J. M. Hellerstein. 2003. Using state modules for adaptive query processing. In ICDE. 353-364. DOI:https:\/\/doi.org\/10.1109\/ICDE.2003.1260805 10.1109\/ICDE.2003.1260805","DOI":"10.1109\/ICDE.2003.1260805"},{"key":"#cr-split#-e_1_2_2_46_1.2","doi-asserted-by":"crossref","unstructured":"Vijayshankar Raman A. Deshpande and J. M. Hellerstein. 2003. Using state modules for adaptive query processing. In ICDE. 353-364. DOI:https:\/\/doi.org\/10.1109\/ICDE.2003.1260805","DOI":"10.1109\/ICDE.2003.1260805"},{"key":"e_1_2_2_47_1","doi-asserted-by":"crossref","unstructured":"P. G. G. Selinger M. M. M. Astrahan D. D. Chamberlin R. A. Lorie and T. G. Price. 1979. Access path selection in a relational database management system. In SIGMOD. 23\u201334. DOI:http:\/\/dl.acm.org\/citation.cfm?id=582095.582099  P. G. G. Selinger M. M. M. Astrahan D. D. Chamberlin R. A. Lorie and T. G. Price. 1979. Access path selection in a relational database management system. In SIGMOD. 23\u201334. DOI:http:\/\/dl.acm.org\/citation.cfm?id=582095.582099","DOI":"10.1145\/582095.582099"},{"key":"e_1_2_2_49_1","unstructured":"Michael Stillger Guy M. Lohman Volker Markl and Mokhtar Kandil. 2001. LEO - DB2\u2019s LEarning optimizer. In PVLDB. VLDB 19\u201328. http:\/\/www.vldb.org\/conf\/2001\/P019.pdf.   Michael Stillger Guy M. Lohman Volker Markl and Mokhtar Kandil. 2001. LEO - DB2\u2019s LEarning optimizer. In PVLDB. VLDB 19\u201328. http:\/\/www.vldb.org\/conf\/2001\/P019.pdf."},{"key":"e_1_2_2_50_1","first-page":"307","article-title":"An end-to-end learning-based cost estimator","volume":"13","author":"Sun Ji","year":"2020","unstructured":"Ji Sun and Guoliang Li . 2020 . An end-to-end learning-based cost estimator . In VLDBJ , Vol. 13. 307 \u2013 319 . DOI:https:\/\/doi.org\/10.14778\/3368289.3368296 10.14778\/3368289.3368296 Ji Sun and Guoliang Li. 2020. An end-to-end learning-based cost estimator. In VLDBJ, Vol. 13. 307\u2013319. DOI:https:\/\/doi.org\/10.14778\/3368289.3368296","journal-title":"VLDBJ"},{"key":"e_1_2_2_51_1","unstructured":"TPC. 2013. TPC-H Benchmark. Retrieved from http:\/\/www.tpc.org\/tpch\/.  TPC. 2013. TPC-H Benchmark. Retrieved from http:\/\/www.tpc.org\/tpch\/."},{"key":"e_1_2_2_52_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. 1039\u20131050.  Immanuel Trummer Junxiong Wang Deepak Maram Samuel Moseley Saehan Jo and Joseph Antonakakis. 2019. SkinnerDB: Regret-bounded query evaluation via reinforcement learning. In SIGMOD. 1039\u20131050.","DOI":"10.1145\/3299869.3300088"},{"key":"e_1_2_2_53_1","volume-title":"Jensen","author":"Tzoumas Kostas","year":"2008","unstructured":"Kostas Tzoumas , Timos Sellis , and Christian S . Jensen . 2008 . A Reinforcement Learning Approach for Adaptive Query Processing. Technical Report. Aalborg University . Kostas Tzoumas, Timos Sellis, and Christian S. Jensen. 2008. A Reinforcement Learning Approach for Adaptive Query Processing. Technical Report. Aalborg University."},{"key":"e_1_2_2_54_1","volume-title":"Leapfrog Triejoin: A worst-case optimal join algorithm.","author":"Veldhuizen Todd L.","year":"2012","unstructured":"Todd L. Veldhuizen . 2012 . Leapfrog Triejoin: A worst-case optimal join algorithm. Todd L. Veldhuizen. 2012. Leapfrog Triejoin: A worst-case optimal join algorithm."},{"key":"e_1_2_2_55_1","doi-asserted-by":"crossref","unstructured":"Stratis D. Viglas Jeffrey F. Naughton and Josef Burger. 2003. Maximizing the output rate of multi-way join queries over streaming information sources. In PVLDB. 285\u2013296. Retrieved from http:\/\/dl.acm.org\/citation.cfm?id=1315451.1315477  Stratis D. Viglas Jeffrey F. Naughton and Josef Burger. 2003. Maximizing the output rate of multi-way join queries over streaming information sources. In PVLDB. 285\u2013296. Retrieved from http:\/\/dl.acm.org\/citation.cfm?id=1315451.1315477","DOI":"10.1016\/B978-012722442-8\/50033-1"},{"key":"e_1_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/3329859.3329875"},{"key":"e_1_2_2_57_1","unstructured":"Wentao Wu Jeffrey F. Naughton and Harneet Singh. 2016. Sampling-based query re-optimization. In SIGMOD. 1721\u20131736. DOI:http:\/\/arxiv.org\/abs\/1601.05748  Wentao Wu Jeffrey F. Naughton and Harneet Singh. 2016. Sampling-based query re-optimization. In SIGMOD. 1721\u20131736. DOI:http:\/\/arxiv.org\/abs\/1601.05748"},{"key":"#cr-split#-e_1_2_2_58_1.1","doi-asserted-by":"crossref","unstructured":"Xiang Yu Guoliang Li Chengliang Chai and Nan Tang. 2020. Reinforcement learning with tree-LSTM for join order selection. In ICDE. 1297-1308. DOI:https:\/\/doi.org\/10.1109\/ICDE48307.2020.00116 10.1109\/ICDE48307.2020.00116","DOI":"10.1109\/ICDE48307.2020.00116"},{"key":"#cr-split#-e_1_2_2_58_1.2","doi-asserted-by":"crossref","unstructured":"Xiang Yu Guoliang Li Chengliang Chai and Nan Tang. 2020. Reinforcement learning with tree-LSTM for join order selection. In ICDE. 1297-1308. DOI:https:\/\/doi.org\/10.1109\/ICDE48307.2020.00116","DOI":"10.1109\/ICDE48307.2020.00116"},{"key":"#cr-split#-e_1_2_2_59_1.1","doi-asserted-by":"crossref","unstructured":"Ji Zhang Yu Liu Ke Zhou Guoliang Li Zhili Xiao Bin Cheng Jiashu Xing Yangtao Wang Tianheng Cheng Li Liu Minwei Ran and Zekang Li. 2019. An end-to-end automatic cloud database tuning system using deep reinforcement learning. In SIGMOD. 415-432. DOI:https:\/\/doi.org\/10.1145\/3299869.3300085 10.1145\/3299869.3300085","DOI":"10.1145\/3299869.3300085"},{"key":"#cr-split#-e_1_2_2_59_1.2","doi-asserted-by":"crossref","unstructured":"Ji Zhang Yu Liu Ke Zhou Guoliang Li Zhili Xiao Bin Cheng Jiashu Xing Yangtao Wang Tianheng Cheng Li Liu Minwei Ran and Zekang Li. 2019. An end-to-end automatic cloud database tuning system using deep reinforcement learning. In SIGMOD. 415-432. DOI:https:\/\/doi.org\/10.1145\/3299869.3300085","DOI":"10.1145\/3299869.3300085"}],"container-title":["ACM Transactions on Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3464389","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3464389","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:10Z","timestamp":1750191430000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3464389"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,28]]},"references-count":70,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,9,30]]}},"alternative-id":["10.1145\/3464389"],"URL":"https:\/\/doi.org\/10.1145\/3464389","relation":{},"ISSN":["0362-5915","1557-4644"],"issn-type":[{"value":"0362-5915","type":"print"},{"value":"1557-4644","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,28]]},"assertion":[{"value":"2020-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-05-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-09-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}