{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:26:02Z","timestamp":1750220762777,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,14]],"date-time":"2020-06-14T00:00:00Z","timestamp":1592092800000},"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":[[2020,6,14]]},"DOI":"10.1145\/3401071.3401655","type":"proceedings-article","created":{"date-parts":[[2020,6,3]],"date-time":"2020-06-03T16:04:23Z","timestamp":1591200263000},"page":"1-4","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Bandit join"],"prefix":"10.1145","author":[{"given":"Vahid","family":"Ghadakchi","sequence":"first","affiliation":[{"name":"Oregon State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mian","family":"Xie","sequence":"additional","affiliation":[{"name":"Oregon State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arash","family":"Termehchy","sequence":"additional","affiliation":[{"name":"Oregon State University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1069362389"},{"key":"e_1_3_2_1_2_1","unstructured":"Thomas Bonald and Alexandre Prouti\u00e8re. 2013. Two-target Algorithms for Infinite-armed Bandits with Bernoulli Rewards. In NIPS.  Thomas Bonald and Alexandre Prouti\u00e8re. 2013. Two-target Algorithms for Infinite-armed Bandits with Bernoulli Rewards. In NIPS."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"S\u00e9bastien Bubeck and Nicol\u00f2 Cesa-Bianchi. 2012. Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems. In Foundations and Trends\u00ae in Machine Learning (foundations and trends\u00ae in machine learning ed.). 1--122.  S\u00e9bastien Bubeck and Nicol\u00f2 Cesa-Bianchi. 2012. Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems. In Foundations and Trends \u00ae in Machine Learning (foundations and trends\u00ae in machine learning ed.). 1--122.","DOI":"10.1561\/2200000024"},{"volume-title":"Carey and Donald Kossmann","year":"1998","author":"Michael","key":"e_1_3_2_1_4_1"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Surajit Chaudhuri Rajeev Motwani and Vivek Narasayya. 1999. On Random Sampling over Joins. In SIGMOD.  Surajit Chaudhuri Rajeev Motwani and Vivek Narasayya. 1999. On Random Sampling over Joins. In SIGMOD.","DOI":"10.1145\/304182.304206"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Mohammed Elseidy Abdallah Elguindy Aleksandar Vitorovic and Christoph Koch. 2014. Scalable and adaptive online joins. VLDB.  Mohammed Elseidy Abdallah Elguindy Aleksandar Vitorovic and Christoph Koch. 2014. Scalable and adaptive online joins. VLDB.","DOI":"10.14778\/2732279.2732281"},{"volume-title":"Database Systems: The Complete Book.","year":"2008","author":"GarciaMolina Hector","key":"e_1_3_2_1_7_1"},{"volume-title":"Hellerstein","year":"1999","author":"Haas Peter J.","key":"e_1_3_2_1_8_1"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066222"},{"volume-title":"Cuttlefish: A lightweight primitive for adaptive query processing. arXiv.","year":"2018","author":"Kaftan Tomer","key":"e_1_3_2_1_10_1"},{"volume-title":"Optimally leveraging density and locality to support limit queries. arXiv preprint arXiv:1611.04705","year":"2016","author":"Kim Albert","key":"e_1_3_2_1_11_1"},{"volume-title":"Jeffrey Dean, and Neoklis Polyzotis.","year":"2018","author":"Kraska Tim","key":"e_1_3_2_1_12_1"},{"key":"e_1_3_2_1_13_1","unstructured":"Feifei Li Bin Wu Ke Yi and Zhuoyue Zhao. 2016. Wander join: Online aggregation via random walks. In SIGMOD.  Feifei Li Bin Wu Ke Yi and Zhuoyue Zhao. 2016. Wander join: Online aggregation via random walks. In SIGMOD."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Ryan Marcus and Olga Papaemmanouil. 2018. Deep reinforcement learning for join order enumeration. In aiDM.  Ryan Marcus and Olga Papaemmanouil. 2018. Deep reinforcement learning for join order enumeration. In aiDM.","DOI":"10.1145\/3211954.3211957"},{"key":"e_1_3_2_1_15_1","unstructured":"Jennifer et. al. Ortiz. 2019. Learning state representations for query optimization with deep reinforcement learning. arXiv.  Jennifer et. al. Ortiz. 2019. Learning state representations for query optimization with deep reinforcement learning. arXiv."},{"key":"e_1_3_2_1_16_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.  Immanuel Trummer Junxiong Wang Deepak Maram Samuel Moseley Saehan Jo and Joseph Antonakakis. 2019. SkinnerDB: regret-bounded query evaluation via reinforcement learning. In SIGMOD.","DOI":"10.1145\/3299869.3300088"},{"key":"e_1_3_2_1_17_1","unstructured":"Yizao Wang Jean-Yves Audibert and R\u00e9mi Munos. 2018. Algorithms for Infinitely Many-armed Bandits. In NIPS.  Yizao Wang Jean-Yves Audibert and R\u00e9mi Munos. 2018. Algorithms for Infinitely Many-armed Bandits. In NIPS."}],"event":{"name":"SIGMOD\/PODS '20: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Portland Oregon","acronym":"SIGMOD\/PODS '20"},"container-title":["Proceedings of the Third International Workshop on Exploiting Artificial Intelligence Techniques for Data Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3401071.3401655","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3401071.3401655","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:05Z","timestamp":1750200065000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3401071.3401655"}},"subtitle":["preliminary results"],"short-title":[],"issued":{"date-parts":[[2020,6,14]]},"references-count":17,"alternative-id":["10.1145\/3401071.3401655","10.1145\/3401071"],"URL":"https:\/\/doi.org\/10.1145\/3401071.3401655","relation":{},"subject":[],"published":{"date-parts":[[2020,6,14]]},"assertion":[{"value":"2020-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}