{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,9]],"date-time":"2025-11-09T18:52:45Z","timestamp":1762714365965,"version":"build-2065373602"},"publisher-location":"Singapore","reference-count":10,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819525652","type":"print"},{"value":"9789819525669","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T00:00:00Z","timestamp":1762732800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T00:00:00Z","timestamp":1762732800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-2566-9_19","type":"book-chapter","created":{"date-parts":[[2025,11,9]],"date-time":"2025-11-09T18:47:55Z","timestamp":1762714075000},"page":"271-281","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Reinforcement Learning for Time-Series Query Optimization"],"prefix":"10.1007","author":[{"given":"Songling","family":"Zou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DongHua","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mengmeng","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haifeng","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongqiang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongzhi","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,10]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"eHaan, D., Tompa, F.: Optimal top-down join enumeration. In: SIGMOD, pp. 785\u2013796 (2007)","DOI":"10.1145\/1247480.1247567"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Fender, P., Moerkotte, G.: A new, highly efficient, and easy to implement top-down join enumeration algorithm. In: ICDE, pp. 864\u2013875 (2011)","DOI":"10.1109\/ICDE.2011.5767901"},{"key":"19_CR3","unstructured":"Heitz, J., Stockinger, K.: Join query optimization with deep reinforcement learning algorithms. CoRR arXiv:1911.11689 (2019)"},{"key":"19_CR4","unstructured":"Krishnan, S., Yang, Z., Goldberg, K., Hellerstein, J., Stoica, I.: Learning to optimize join queries with deep reinforcement learning. CoRR arXiv:1808.03196 (2018)"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Marcus, R., Papaemmanouil, O.: Deep reinforcement learning for join order enumeration. In: aiDM@SIGMOD, pp. 3:1\u20133:4 (2018)","DOI":"10.1145\/3211954.3211957"},{"key":"19_CR6","unstructured":"Moerkotte, G., Neumann, T.: Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy join trees without cross products. In: VLDB, pp. 930\u2013941 (2006)"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Selinger, P., Astrahan, M., Chamberlin, D., Lorie, R., Price, T.: Access path selection in a relational database management system. In: SIGMOD, pp. 23\u201334 (1979)","DOI":"10.1145\/582095.582099"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Trummer, I., Wang, J., Maram, D., Moseley, S., Jo, S., Antonakakis, J.: Skinnerdb: regret bounded query evaluation via reinforcement learning. In: SIGMOD, pp. 1153\u20131170 (2019)","DOI":"10.1145\/3299869.3300088"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Vance, B., Maier, D.: Rapid bushy join-order optimization with Cartesian products. In: SIGMOD, pp. 35\u201346 (1996)","DOI":"10.1145\/235968.233317"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Yu, X., Li, G., Chai, C., Tang, N.: Reinforcement learning with tree-LSTM for join order selection. In: ICDE, pp. 1297\u20131308 (2020)","DOI":"10.1109\/ICDE48307.2020.00116"}],"container-title":["Communications in Computer and Information Science","Data Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-2566-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,9]],"date-time":"2025-11-09T18:47:56Z","timestamp":1762714076000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-2566-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,10]]},"ISBN":["9789819525652","9789819525669"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-2566-9_19","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,10]]},"assertion":[{"value":"10 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICPCSEE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference of Pioneering Computer Scientists, Engineers and Educators","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hiroshima","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icpcsee2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2025.icpcsee.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}