{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T20:34:49Z","timestamp":1780346089676,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":48,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T00:00:00Z","timestamp":1561420800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,25]]},"DOI":"10.1145\/3299869.3300088","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T17:41:43Z","timestamp":1560879703000},"page":"1153-1170","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":59,"title":["SkinnerDB"],"prefix":"10.1145","author":[{"given":"Immanuel","family":"Trummer","sequence":"first","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Junxiong","family":"Wang","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Deepak","family":"Maram","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Samuel","family":"Moseley","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Saehan","family":"Jo","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joseph","family":"Antonakakis","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,6,25]]},"reference":[{"key":"e_1_3_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.   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":"10.1016\/B978-012088469-8.50100-5"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.64"},{"key":"e_1_3_2_1_4_1","unstructured":"Khaled H Alyoubi Sven Helmer and Peter T Wood. 2015. Ordering selection operators under partial ignorance.. In CIKM . 1521--1530. arxiv: 1507.08257  Khaled H Alyoubi Sven Helmer and Peter T Wood. 2015. Ordering selection operators under partial ignorance.. In CIKM . 1521--1530. arxiv: 1507.08257"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335420"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066172"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066171"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1409360.1409380"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564722"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Surajit Chaudhuri and Vivek Narasayya. 2001. Automating statistics management for query optimizers. In ICDE. 7--20.  Surajit Chaudhuri and Vivek Narasayya. 2001. Automating statistics management for query optimizers. In ICDE. 7--20.","DOI":"10.1109\/69.908978"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1497290.1497300"},{"key":"e_1_3_2_1_12_1","unstructured":"Pierre-Arnaud Coquelin and R\u00e9 mi Munos. 2007. Bandit algorithms for tree search. In Uncertainty in Artificial Intelligence . 67--74. arxiv: arXiv:cs\/0703062v1  Pierre-Arnaud Coquelin and R\u00e9 mi Munos. 2007. Bandit algorithms for tree search. In Uncertainty in Artificial Intelligence . 67--74. arxiv: arXiv:cs\/0703062v1"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453976"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/974121.974129"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1331939.1331940"},{"key":"e_1_3_2_1_16_1","volume-title":"International Symposium on Combinatorial Search (SoCS). 1--8. http:\/\/www.aaai.org\/ocs\/index.php\/SOCS\/SOCS13\/paper\/view\/7268","author":"Domshlak Carmel","year":"2013","unstructured":"Carmel Domshlak and Zohar Feldman . 2013 . To UCT, or not to UCT? . In International Symposium on Combinatorial Search (SoCS). 1--8. 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 International Symposium on Combinatorial Search (SoCS). 1--8. http:\/\/www.aaai.org\/ocs\/index.php\/SOCS\/SOCS13\/paper\/view\/7268"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989359"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733004.2733036"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Anshuman Dutt and Jayant Haritsa. 2014. Plan bouquets: query processing without selectivity estimation. In SIGMOD . 1039--1050.  Anshuman Dutt and Jayant Haritsa. 2014. Plan bouquets: query processing without selectivity estimation. In SIGMOD . 1039--1050.","DOI":"10.1145\/2588555.2588566"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687556"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00450-005-0206-8"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/2750423.2750427"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.130"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2093548.2093574"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850583.2850594"},{"key":"e_1_3_2_1_26_1","unstructured":"P.J. Haas and A.N. Swami. 2011. Sampling-based selectivity estimation for joins using augmented frequent value statistics. In ICDE. 522--531.   P.J. Haas and A.N. Swami. 2011. Sampling-based selectivity estimation for joins using augmented frequent value statistics. In ICDE. 522--531."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/141484.130335"},{"key":"e_1_3_2_1_28_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.  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":"10.1145\/2588555.2610531"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/11871842_29"},{"key":"e_1_3_2_1_30_1","unstructured":"Ravi Krishnamurthy Haran Boral and Carlo Zaniolo. 1986. Optimization of Nonrecursive Queries. In VLDB. 128--137. http:\/\/citeseerx.ist.psu.edu\/viewdoc\/download?doi=10.1.1.76.1079&rep=rep1&type=pdf http:\/\/dl.acm.org\/citation.cfm?id=645913.671481   Ravi Krishnamurthy Haran Boral and Carlo Zaniolo. 1986. Optimization of Nonrecursive Queries. In VLDB. 128--137. http:\/\/citeseerx.ist.psu.edu\/viewdoc\/download?doi=10.1.1.76.1079&rep=rep1&type=pdf http:\/\/dl.acm.org\/citation.cfm?id=645913.671481"},{"key":"e_1_3_2_1_31_1","volume-title":"Learning to optimize join queries with deep reinforcement learning . arXiv:1808.03196","author":"Krishnan Sanjay","year":"2018","unstructured":"Sanjay Krishnan , Zongheng Yang , Ken Goldberg , Joseph Hellerstein , and Ion Stoica . 2018. Learning to optimize join queries with deep reinforcement learning . arXiv:1808.03196 ( 2018 ). arxiv: 1808.03196 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 . arXiv:1808.03196 (2018). arxiv: 1808.03196 http:\/\/arxiv.org\/abs\/1808.03196"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350269"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/93605.93611"},{"key":"e_1_3_2_1_34_1","volume-title":"Is Query Optimization a \"Solved\" Problem? SIGMOD Blog","author":"Lohman Guy","year":"2014","unstructured":"Guy Lohman . 2014. Is Query Optimization a \"Solved\" Problem? SIGMOD Blog ( 2014 ). Guy Lohman. 2014. Is Query Optimization a \"Solved\" Problem? SIGMOD Blog (2014)."},{"key":"e_1_3_2_1_35_1","unstructured":"Tanu Malik and Randal Burns. 2007. A black-box approach to query cardinality estimation. In CIDR. 56--67.  Tanu Malik and Randal Burns. 2007. A black-box approach to query cardinality estimation. In CIDR. 56--67."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1188455.1188562"},{"key":"e_1_3_2_1_37_1","volume-title":"Deep Reinforcement Learning for Join Order Enumeration . arXiv","author":"Marcus Ryan","year":"1803","unstructured":"Ryan Marcus and Olga Papaemmanouil . 2018. Deep Reinforcement Learning for Join Order Enumeration . arXiv : 1803 .00055v2 (2018). arxiv: arXiv:1803.00055v2 Ryan Marcus and Olga Papaemmanouil. 2018. Deep Reinforcement Learning for Join Order Enumeration . arXiv : 1803.00055v2 (2018). arxiv: arXiv:1803.00055v2"},{"key":"e_1_3_2_1_38_1","unstructured":"Thomas Neumann and Cesar Galindo-Legaria. 2013. Taking the edge off cardinality estimation errors using incremental execution. In BTW . 73--92.  Thomas Neumann and Cesar Galindo-Legaria. 2013. Taking the edge off cardinality estimation errors using incremental execution. In BTW . 73--92."},{"key":"e_1_3_2_1_39_1","unstructured":"Thomas Neumann and Alfons Kemper. 2015. Unnesting Arbitrary Queries. In BTW. 383--402. 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--402. http:\/\/www.btw-2015.de\/res\/proceedings\/Hauptband\/Wiss\/Neumann-Unnesting_Arbitrary_Querie.pdf"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213565"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556553"},{"key":"e_1_3_2_1_42_1","unstructured":"PostgreSQL Global Development Group. 2017. PostgreSQL . https:\/\/www.postgresql.org\/. https:\/\/www.postgresql.org\/  PostgreSQL Global Development Group. 2017. PostgreSQL . https:\/\/www.postgresql.org\/. https:\/\/www.postgresql.org\/"},{"key":"e_1_3_2_1_43_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.  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":"10.1109\/ICDE.2007.367848"},{"key":"e_1_3_2_1_44_1","unstructured":"Vijayshankar Raman Vijayshankar Raman A. Deshpande and J.M. Hellerstein. 2003. Using state modules for adaptive query processing. In ICDE. 353--364.  Vijayshankar Raman Vijayshankar Raman A. Deshpande and J.M. Hellerstein. 2003. Using state modules for adaptive query processing. In ICDE. 353--364."},{"key":"e_1_3_2_1_45_1","unstructured":"Michael Stillger Guy M Lohman Volker Markl and Mokhtar Kandil. 2001. LEO - DB2's LEarning Optimizer. In PVLDB. 19--28.   Michael Stillger Guy M Lohman Volker Markl and Mokhtar Kandil. 2001. LEO - DB2's LEarning Optimizer. In PVLDB. 19--28."},{"key":"e_1_3_2_1_46_1","unstructured":"TPC. 2013. TPC-H Benchmark . http:\/\/www.tpc.org\/tpch\/  TPC. 2013. TPC-H Benchmark . http:\/\/www.tpc.org\/tpch\/"},{"key":"e_1_3_2_1_48_1","unstructured":"Todd L. Veldhuizen. 2012. Leapfrog Triejoin: a worst-case optimal join algorithm . (2012) 96--106. arxiv: 1210.0481  Todd L. Veldhuizen. 2012. Leapfrog Triejoin: a worst-case optimal join algorithm . (2012) 96--106. arxiv: 1210.0481"},{"key":"e_1_3_2_1_49_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--296. 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--296. http:\/\/dl.acm.org\/citation.cfm?id=1315451.1315477","DOI":"10.1016\/B978-012722442-8\/50033-1"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882914"}],"event":{"name":"SIGMOD\/PODS '19: International Conference on Management of Data","location":"Amsterdam Netherlands","acronym":"SIGMOD\/PODS '19","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2019 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3299869.3300088","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3299869.3300088","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:16Z","timestamp":1750208536000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3299869.3300088"}},"subtitle":["Regret-Bounded Query Evaluation via Reinforcement Learning"],"short-title":[],"issued":{"date-parts":[[2019,6,25]]},"references-count":48,"alternative-id":["10.1145\/3299869.3300088","10.1145\/3299869"],"URL":"https:\/\/doi.org\/10.1145\/3299869.3300088","relation":{},"subject":[],"published":{"date-parts":[[2019,6,25]]},"assertion":[{"value":"2019-06-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}