{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T00:06:56Z","timestamp":1755907616169,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,9]],"date-time":"2024-06-09T00:00:00Z","timestamp":1717891200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"iSF - the Israel Science foundation","award":["2707\/22"],"award-info":[{"award-number":["2707\/22"]}]},{"name":"BSF - the US-Israel Binational Science foundation","award":["2018194"],"award-info":[{"award-number":["2018194"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,9]]},"DOI":"10.1145\/3626246.3654741","type":"proceedings-article","created":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T10:26:39Z","timestamp":1716459999000},"page":"452-455","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["ASQP-RL Demo: Learning Approximation Sets for Exploratory Queries"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-9259-9662","authenticated-orcid":false,"given":"Susan B.","family":"Davidson","sequence":"first","affiliation":[{"name":"University of Pennsylvania, Philadelphia, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8566-8821","authenticated-orcid":false,"given":"Tova","family":"Milo","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9165-2025","authenticated-orcid":false,"given":"Kathy","family":"Razmadze","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-3306-501X","authenticated-orcid":false,"given":"Gal","family":"Zeevi","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Greg Brockman et al. 2016. Openai gym. arXiv preprint arXiv:1606.01540 (2016)."},{"key":"e_1_3_2_1_2_1","volume-title":"Learning Approximation Sets for Exploratory Queries. arXiv preprint http:\/\/arxiv.org\/abs\/2401.17059","author":"Davidson Susan B","year":"2024","unstructured":"Susan B Davidson, Tova Milo, Kathy Razmadze, and Gal Zeevi. 2024. Learning Approximation Sets for Exploratory Queries. arXiv preprint http:\/\/arxiv.org\/abs\/2401.17059 (2024)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196905"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Saravanan Thirumuruganathan et al. 2020. Approximate query processing for data exploration using deep generative models. In ICDE. IEEE 1309--1320.","DOI":"10.1109\/ICDE48307.2020.00117"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/64.621228"},{"key":"e_1_3_2_1_6_1","first-page":"204","article-title":"How good are query optimizers, really","volume":"9","author":"Viktor Leis","year":"2015","unstructured":"Viktor Leis et al. 2015. How good are query optimizers, really? VLDB 9, 3 (2015), 204--215.","journal-title":"VLDB"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-018-0074-4"},{"key":"e_1_3_2_1_8_1","unstructured":"Microsoft. 2016. Microsoft academic search. http:\/\/academic.research.microsoft.com"},{"key":"e_1_3_2_1_9_1","volume-title":"Ray: A distributed framework for emerging AI applications. In OSDI. 561--577.","author":"Philipp Moritz","year":"2018","unstructured":"Philipp Moritz et al. 2018. Ray: A distributed framework for emerging AI applications. In OSDI. 561--577."},{"key":"e_1_3_2_1_10_1","unstructured":"John Schulman et al. 2017. Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347 (2017)."}],"event":{"name":"SIGMOD\/PODS '24: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Santiago AA Chile","acronym":"SIGMOD\/PODS '24"},"container-title":["Companion of the 2024 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626246.3654741","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3626246.3654741","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T11:30:10Z","timestamp":1755862210000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626246.3654741"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,9]]},"references-count":10,"alternative-id":["10.1145\/3626246.3654741","10.1145\/3626246"],"URL":"https:\/\/doi.org\/10.1145\/3626246.3654741","relation":{},"subject":[],"published":{"date-parts":[[2024,6,9]]},"assertion":[{"value":"2024-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}