{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:46:00Z","timestamp":1740181560277,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T00:00:00Z","timestamp":1668643200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T00:00:00Z","timestamp":1668643200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004238","name":"Universit\u00e4t Potsdam","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004238","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Fast query processing is a primary goal of modern database systems. The use of indexes is crucial to reduce the execution times of database queries. Hence, it is of great interest to determine an efficient selection of indexes for a database management system (DBMS). However, index selection problems are highly challenging as indexes cause additional memory consumption and the individual benefit of an index is influenced by the selection of others. In this paper, we consider index selection problems accounting for non-standard features, such as (i) multiple potential workloads, (ii) different risk-averse objectives, (iii) multi-index configurations, (iv) reconfiguration costs, and (v) anticipation of dynamic workload scenarios. For the different problem extensions, we propose specific model formulations, which can be solved efficiently using solver-based solution techniques. The applicability and performance of our concepts are demonstrated using reproducible synthetic workloads as well as standard TPC-H and TPC-DS-based benchmark workloads.<\/jats:p>","DOI":"10.1007\/s42979-022-01473-7","type":"journal-article","created":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T18:13:01Z","timestamp":1668708781000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Robust Index Selection for Stochastic Dynamic Workloads"],"prefix":"10.1007","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6627-4026","authenticated-orcid":false,"given":"Rainer","family":"Schlosser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcel","family":"Weisgut","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonardo","family":"H\u00fcbscher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oliver","family":"Nordemann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,17]]},"reference":[{"key":"1473_CR1","unstructured":"2022. https:\/\/www.postgresql.org. Accessed 16 June 2022"},{"key":"1473_CR2","unstructured":"2022. https:\/\/github.com\/HypoPG\/hypopg. Accessed 16 June 2022"},{"key":"1473_CR3","unstructured":"Casey RG. Allocation of copies of a file in an information network. In: AFIPS, 1972; p. 617\u201325."},{"key":"1473_CR4","unstructured":"Chaudhuri S, Narasayya V. Anytime algorithm of database tuning advisor for Microsoft SQL Server. 2020 https:\/\/www.microsoft.com\/en-us\/research\/publication\/anytime-algorithm-of-database-tuning-advisor-for-microsoft-sql-server. Accessed 6 April 2020"},{"key":"1473_CR5","unstructured":"Chaudhuri S, Narasayya VR. An efficient cost-driven index selection tool for Microsoft SQL Server. In: Proc. VLDB\u201997, 1997; p. 146\u2013155."},{"issue":"6","key":"1473_CR6","first-page":"362","volume":"4","author":"D Dash","year":"2011","unstructured":"Dash D, Polyzotis N, Ailamaki A. CoPhy: a scalable, portable, and interactive index advisor for large workloads. PVLDB. 2011;4(6):362\u201372.","journal-title":"PVLDB"},{"issue":"1","key":"1473_CR7","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1145\/42201.42205","volume":"13","author":"SJ Finkelstein","year":"1988","unstructured":"Finkelstein SJ, Schkolnick M, Tiberio P. Physical database design for relational databases. ACM Trans Database Syst. 1988;13(1):91\u2013128.","journal-title":"ACM Trans Database Syst"},{"key":"1473_CR8","unstructured":"Fourer R, Gay D, Kernighan B. AMPL: a modeling language for mathematical programming. Thomson\/Brooks\/Cole; 2003."},{"key":"1473_CR9","unstructured":"Fourer R, Gay D, Kernighan B. Ampl reference manual. 2003. Online Accessed 7 June 2022."},{"key":"1473_CR10","doi-asserted-by":"crossref","unstructured":"Kormilitsin M, Chirkova R, Fathi Y, Stallmann M. View and index selection for query-performance improvement: Algorithms, heuristics and complexity. In: Proc. CIKM\u201908, 2008;2:1329\u201330.","DOI":"10.1145\/1458082.1458261"},{"key":"1473_CR11","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. In: PVLDB, 2020;13:2382\u201395.","DOI":"10.14778\/3407790.3407832"},{"key":"1473_CR12","unstructured":"Kossmann J, Kastius A, Schlosser R. SWIRL: Selection of workload-aware indexes using reinforcement learning. In: EDBT, 2022; p. 155\u2013168."},{"issue":"4","key":"1473_CR13","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/s10619-020-07288-w","volume":"38","author":"J Kossmann","year":"2020","unstructured":"Kossmann J, Schlosser R. Self-driving database systems: a conceptual approach. Distrib Parallel Databases. 2020;38(4):795\u2013817.","journal-title":"Distrib Parallel Databases"},{"key":"1473_CR14","unstructured":"Papadomanolakis S, Dash D, Ailamaki A. Efficient use of the query optimizer for automated database design. In: Proc VLDB 2007, 2007; p. 1093\u20134."},{"key":"1473_CR15","unstructured":"Pavlo A, et al. Self-driving database management systems. In CIDR, 2017."},{"key":"1473_CR16","doi-asserted-by":"crossref","unstructured":"Richly K, Schlosser R, Boissier M. Joint index, sorting, and compression optimization for memory-efficient spatio-temporal data management. In: ICDE, 2021; p. 1901\u20136.","DOI":"10.1109\/ICDE51399.2021.00174"},{"key":"1473_CR17","doi-asserted-by":"crossref","unstructured":"Schlosser R, Halfpap S. A decomposition approach for risk-averse index selection. In: SSDBM, 2020;16:1\u201316:4.","DOI":"10.1145\/3400903.3400909"},{"key":"1473_CR18","doi-asserted-by":"crossref","unstructured":"Schlosser R, Kossmann J, Boissier M. Efficient scalable multi-attribute index selection using recursive strategies. In: ICDE, 2019; p. 1238\u2013249.","DOI":"10.1109\/ICDE.2019.00113"},{"key":"1473_CR19","doi-asserted-by":"crossref","unstructured":"Schnaitter K, Polyzotis N, Getoor L. Index interactions in physical design tuning: Modeling, analysis, and applications. In: Proc. VLDB\u201909, 2009;2:1234\u2013245.","DOI":"10.14778\/1687627.1687766"},{"key":"1473_CR20","unstructured":"Sharma A, Schuhknecht F.M, Dittrich J. The case for automatic database administration using deep reinforcement learning. 2018. arXiv:abs\/1801.05643[CoRR]"},{"key":"1473_CR21","unstructured":"Valentin G, Zuliani M, Zilio DC, Lohman GM, Skelley A. DB2 Advisor: an optimizer smart enough to recommend its own indexes. In: Proc. ICDE, 2000; p. 101\u201310."},{"key":"1473_CR22","unstructured":"Wang R, Tran QT, Jimenez I, Polyzotis N. INUM+: a leaner, more accurate and more efficient fast what-if optimizer. In: ICDE 2013 Workshops, 2013; p. 50\u20135."},{"key":"1473_CR23","doi-asserted-by":"crossref","unstructured":"Weisgut M, H\u00fcbscher L, Nordemann O, Schlosser R. Solver-based approaches for robust multi-index selection problems with reconfiguration costs under stochastic dynamic workloads. In: ICORES, 2022, 2022; p. 28\u201339.","DOI":"10.5220\/0010800600003117"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01473-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-022-01473-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01473-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T22:26:06Z","timestamp":1673130366000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-022-01473-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,17]]},"references-count":23,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,1]]}},"alternative-id":["1473"],"URL":"https:\/\/doi.org\/10.1007\/s42979-022-01473-7","relation":{},"ISSN":["2661-8907"],"issn-type":[{"type":"electronic","value":"2661-8907"}],"subject":[],"published":{"date-parts":[[2022,11,17]]},"assertion":[{"value":"16 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest\/Competing Interests"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics Approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to Participate"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}}],"article-number":"59"}}