{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:20:44Z","timestamp":1743042044733,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030858988"},{"type":"electronic","value":"9783030858995"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-85899-5_13","type":"book-chapter","created":{"date-parts":[[2021,8,18]],"date-time":"2021-08-18T10:06:38Z","timestamp":1629281198000},"page":"178-185","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning an Index Advisor with Deep Reinforcement Learning"],"prefix":"10.1007","author":[{"given":"Sichao","family":"Lai","sequence":"first","affiliation":[]},{"given":"Xiaoying","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Senyang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yuwei","family":"Peng","sequence":"additional","affiliation":[]},{"given":"Zhiyong","family":"Peng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,19]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1109\/TKDE.2004.75","volume":"16","author":"S Chaudhuri","year":"2004","unstructured":"Chaudhuri, S., Datar, M., Narasayya, V.: Index selection for databases: a hardness study and a principled heuristic solution. IEEE Trans. Knowl. Data Eng. 16, 1313\u20131323 (2004). https:\/\/doi.org\/10.1109\/TKDE.2004.75","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"1234","DOI":"10.14778\/1687627.1687766","volume":"2","author":"K Schnaitter","year":"2009","unstructured":"Schnaitter, K., Polyzotis, N., Getoor, L.: Index interactions in physical design tuning: modeling, analysis, and applications. Proc. VLDB Endow. 2, 1234\u2013124512 (2009)","journal-title":"Proc. VLDB Endow."},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/s41019-020-00149-7","volume":"6","author":"H Lan","year":"2021","unstructured":"Lan, H., Bao, Z., Peng, Y.: A survey on advancing the DBMS query optimizer: cardinality estimation, cost model, and plan enumeration. Data Sci. Eng. 6(1), 86\u2013101 (2021). https:\/\/doi.org\/10.1007\/s41019-020-00149-7","journal-title":"Data Sci. Eng."},{"doi-asserted-by":"crossref","unstructured":"Ding, B., Das, S., Marcus, R., Wu, W., Chaudhuri, S., Narasayya, V.R.: AI meets AI: leveraging query executions to improve index recommendations. In: Proceedings of the 2019 International Conference on Management of Data - SIGMOD 2019, pp. 1241\u20131258. ACM Press, Amsterdam (2019). https:\/\/doi.org\/10.1145\/3299869.3324957","key":"13_CR4","DOI":"10.1145\/3299869.3324957"},{"unstructured":"Chaudhuri, S., Narasayya, V.R.: An efficient cost-driven index selection tool for Microsoft SQL server. In: Proceedings of 23rd International Conference on Very Large Data Bases, VLDB 1997, August 25\u201329, 1997, Athens, Greece, pp. 146\u2013155 (1997)","key":"13_CR5"},{"doi-asserted-by":"crossref","unstructured":"Valentin, G., Zuliani, M., Zilio, D.C., Lohman, G., Skelley, A.: DB2 advisor: an optimizer smart enough to recommend its own indexes. In: Proceedings of 16th International Conference on Data Engineering (Cat. No. 00CB37073), pp. 101\u2013110. IEEE Computer Society, San Diego, CA, USA (2000). https:\/\/doi.org\/10.1109\/ICDE.2000.839397","key":"13_CR6","DOI":"10.1109\/ICDE.2000.839397"},{"doi-asserted-by":"crossref","unstructured":"Bruno, N., Chaudhuri, S.: Automatic physical database tuning: a relaxation-based approach. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Baltimore, Maryland, USA, June 14\u201316, 2005, pp. 227\u2013238 (2005). https:\/\/doi.org\/10.1145\/1066157.1066184","key":"13_CR7","DOI":"10.1145\/1066157.1066184"},{"unstructured":"Sharma, A., Schuhknecht, F.M., Dittrich, J.: The case for automatic database administration using deep reinforcement learning. arXiv:1801.05643 [cs] (2018)","key":"13_CR8"},{"issue":"8","key":"13_CR9","doi-asserted-by":"publisher","first-page":"2575","DOI":"10.1007\/s10489-020-01674-8","volume":"50","author":"G Paludo Licks","year":"2020","unstructured":"Paludo Licks, G., Colleoni Couto, J., de F\u00e1tima Miehe, P., de Paris, R., Dubugras Ruiz, D., Meneguzzi, F.: SmartIX: a database indexing agent based on reinforcement learning. Appl. Intell. 50(8), 2575\u20132588 (2020). https:\/\/doi.org\/10.1007\/s10489-020-01674-8","journal-title":"Appl. Intell."},{"doi-asserted-by":"crossref","unstructured":"Lan, H., Bao, Z., Peng, Y.: An index advisor using deep reinforcement learning. In: Proceedings of the 29th ACM International Conference on Information & Knowledge Management, pp. 2105\u20132108. Association for Computing Machinery, New York (2020). https:\/\/doi.org\/10.1145\/3340531.3412106","key":"13_CR10","DOI":"10.1145\/3340531.3412106"},{"key":"13_CR11","volume-title":"Reinforcement Learning: An Introduction","author":"RS Sutton","year":"2018","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction, 2nd edn. MIT Press, Cambridge (2018)","edition":"2"},{"unstructured":"Knuth, D.E.: Generating all combinations and partitions, vol. 4, fascicle 3 of the art of computer programming (2005)","key":"13_CR12"},{"unstructured":"Irpan, A.: Deep reinforcement learning doesn\u2019t work yet (2018). https:\/\/www.alexirpan.com\/2018\/02\/14\/rl-hard.html","key":"13_CR13"},{"unstructured":"Schulman, J., Wolski, F., Dhariwal, P., Radford, A., Klimov, O.: Proximal policy optimization algorithms. arXiv:1707.06347 [cs] (2017)","key":"13_CR14"},{"doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Narasayya, V.: AutoAdmin \u201cWhat-if\u201d index analysis utility. In: Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, pp. 367\u2013378. ACM, New York (1998). https:\/\/doi.org\/10.1145\/276304.276337","key":"13_CR15","DOI":"10.1145\/276305.276337"},{"doi-asserted-by":"crossref","unstructured":"Kossmann, J., Halfpap, S., Jankrift, M., Schlosser, R.: Magic mirror in my hand, which is the best in the land? An experimental evaluation of index selection algorithms, vol. 14 (2020)","key":"13_CR16","DOI":"10.14778\/3407790.3407832"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85899-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,19]],"date-time":"2021-08-19T23:38:18Z","timestamp":1629416298000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85899-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030858988","9783030858995"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85899-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"19 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"184","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.6","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6.38","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}