{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T18:54:06Z","timestamp":1791226446195,"version":"4.1.0"},"reference-count":19,"publisher":"Association for Computing Machinery (ACM)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2011,3]]},"abstract":"<jats:p>Index tuning, i.e., selecting the indexes appropriate for a workload, is a crucial problem in database system tuning. In this paper, we solve index tuning for large problem instances that are common in practice, e.g., thousands of queries in the workload, thousands of candidate indexes and several hard and soft constraints. Our work is the first to reveal that the index tuning problem has a well structured space of solutions, and this space can be explored efficiently with well known techniques from linear optimization. Experimental results demonstrate that our approach outperforms state-of-the-art commercial and research techniques by a significant margin (up to an order of magnitude).<\/jats:p>","DOI":"10.14778\/1978665.1978668","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T08:17:57Z","timestamp":1403597877000},"page":"362-372","source":"Crossref","is-referenced-by-count":73,"title":["CoPhy"],"prefix":"10.14778","volume":"4","author":[{"given":"Debabrata","family":"Dash","sequence":"first","affiliation":[{"name":"ArcSight, an HP Company"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Neoklis","family":"Polyzotis","sequence":"additional","affiliation":[{"name":"University of California at Santa Cruz"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anastasia","family":"Ailamaki","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique Federale de Lausanne"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2011,3]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066292"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/993483"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066184"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453863"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376710"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02568608"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.75"},{"key":"e_1_2_1_8_1","unstructured":"S. Chaudhuri and V. Narayasa. Program for tpc-d data generation with skew. ftp:\/\/ftp.research.microsoft.com\/users\/viveknar\/tpcdskew.  S. Chaudhuri and V. Narayasa. Program for tpc-d data generation with skew. ftp:\/\/ftp.research.microsoft.com\/users\/viveknar\/tpcdskew."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873680"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/42201.42205"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.1040.0263"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/800184.810505"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDEW.2007.4401027"},{"key":"e_1_2_1_15_1","first-page":"1093","volume-title":"VLDB","author":"Papadomanolakis S.","year":"2007","unstructured":"S. Papadomanolakis , D. Dash , and A. Ailamaki . Efficient use of the query optimizer for automated physical design . In VLDB , pages 1093 -- 1104 , 2007 . S. Papadomanolakis, D. Dash, and A. Ailamaki. Efficient use of the query optimizer for automated physical design. In VLDB, pages 1093--1104, 2007."},{"key":"e_1_2_1_16_1","first-page":"1228","volume-title":"VLDB","author":"Reddy N.","year":"2007","unstructured":"N. Reddy and J. R. Haritsa . Analyzing plan diagrams of database query optimizers . In VLDB , pages 1228 -- 1240 , 2007 . N. Reddy and J. R. Haritsa. Analyzing plan diagrams of database query optimizers. In VLDB, pages 1228--1240, 2007."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.166"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/582095.582099"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1353343.1353383"},{"key":"e_1_2_1_20_1","first-page":"1087","volume-title":"VLDB","author":"Zilio D. C.","year":"2004","unstructured":"D. C. Zilio , J. Rao , S. Lightstone , G. M. Lohman , A. Storm , C. Garcia-Arellano , and S. Fadden . Db2 design advisor: Integrated automatic physical database design . In VLDB , pages 1087 -- 1097 , 2004 . D. C. Zilio, J. Rao, S. Lightstone, G. M. Lohman, A. Storm, C. Garcia-Arellano, and S. Fadden. Db2 design advisor: Integrated automatic physical database design. In VLDB, pages 1087--1097, 2004."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/1978665.1978668","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T05:19:05Z","timestamp":1672204745000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/1978665.1978668"}},"subtitle":["a scalable, portable, and interactive index advisor for large workloads"],"short-title":[],"issued":{"date-parts":[[2011,3]]},"references-count":19,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["10.14778\/1978665.1978668"],"URL":"https:\/\/doi.org\/10.14778\/1978665.1978668","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2011,3]]}}}