{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:17:51Z","timestamp":1750306671489,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":52,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,18]],"date-time":"2014-06-18T00:00:00Z","timestamp":1403049600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF 1114930","CCF 1217708","CCF 1114809","CCF 1218188","CCF 0937822"],"award-info":[{"award-number":["CCF 1114930","CCF 1217708","CCF 1114809","CCF 1218188","CCF 0937822"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001352","name":"National University of Singapore","doi-asserted-by":"publisher","award":["R-252-000-443-133"],"award-info":[{"award-number":["R-252-000-443-133"]}],"id":[{"id":"10.13039\/501100001352","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["IIS 1247750","IIS 1247726"],"award-info":[{"award-number":["IIS 1247750","IIS 1247726"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["FE407\/17-1"],"award-info":[{"award-number":["FE407\/17-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,6,18]]},"DOI":"10.1145\/2594538.2594548","type":"proceedings-article","created":{"date-parts":[[2014,6,20]],"date-time":"2014-06-20T13:06:05Z","timestamp":1403269565000},"page":"278-288","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Cost-oblivious storage reallocation"],"prefix":"10.1145","author":[{"given":"Michael A.","family":"Bender","sequence":"first","affiliation":[{"name":"Stony Brook University, Stony Brook, NY, USA"}]},{"given":"Martin","family":"Farach-Colton","sequence":"additional","affiliation":[{"name":"Rutgers University, New Brunswick, NJ, USA"}]},{"given":"Sandor P.","family":"Fekete","sequence":"additional","affiliation":[{"name":"TU Braunschweig, Braunschweig, Germany"}]},{"given":"Jeremy T.","family":"Fineman","sequence":"additional","affiliation":[{"name":"Georgetown University, Washington, DC, USA"}]},{"given":"Seth","family":"Gilbert","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]}],"member":"320","published-online":{"date-parts":[[2014,6,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28428"},{"issue":"3","key":"e_1_3_2_1_2_1","first-page":"154","volume":"42","author":"Archetti C.","year":"2003","unstructured":"C. Archetti , L. Bertazzi , and M. G. Speranza . Reoptimizing the Traveling Salesman Problem. Networks , 42 ( 3 ): 154 -- 159 , 2003 . C. Archetti, L. Bertazzi, and M. G. Speranza. Reoptimizing the Traveling Salesman Problem. Networks, 42(3):154--159, 2003.","journal-title":"Reoptimizing the Traveling Salesman Problem. Networks"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2010.08.003"},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. CiE","author":"Ausiello G.","year":"2007","unstructured":"G. Ausiello , V. Bonifaci , and B. Escoffier . Complexity and approximation in reoptimization . In Proc. CiE , 2007 . G. Ausiello, V. Bonifaci, and B. Escoffier. Complexity and approximation in reoptimization. In Proc. CiE, 2007."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2008.12.001"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/647912.740801"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701389956"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634145"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486181"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1789494.1789499"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142355"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1292609.1292616"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2362389.2362392"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(85)90046-0"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-34735-6_21"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214083"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212014"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/241938.241940"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167203"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199701\/03)10:1\/2%3C69::AID-RSA4%3E3.0.CO;2-V"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2491973"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/11830924_12"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2209285.2209287"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796479"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01415672"},{"issue":"287","key":"e_1_3_2_1_26_1","first-page":"326","article-title":"Optimization and approximation in deterministic sequencing and scheduling: a survey","volume":"5","author":"Graham R.","year":"1979","unstructured":"R. Graham , E. Lawler , J. Lenstra , and A. Kan . Optimization and approximation in deterministic sequencing and scheduling: a survey . Ann. Disc. Math. , 5 : 287 -- 326 , 1979 . R. Graham, E. Lawler, J. Lenstra, and A. Kan. Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Disc. Math., 5:287 -- 326, 1979.","journal-title":"Ann. Disc. Math."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1030.0101"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.07.001"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/646235.682700"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39206-1_50"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/2025255"},{"key":"e_1_3_2_1_32_1","volume-title":"Haifa","author":"Katriel I.","year":"2002","unstructured":"I. Katriel . Implicit data structures based on local reorganizations. Master's thesis, Technion -- Isreal Inst. of Tech ., Haifa , May 2002 . I. Katriel. Implicit data structures based on local reorganizations. Master's thesis, Technion -- Isreal Inst. of Tech., Haifa, May 2002."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/365628.365655"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/260999"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/S089548019325647X"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00175-4"},{"key":"e_1_3_2_1_37_1","volume-title":"Department of Electrical Engineering and Computer Science","author":"Prokop H.","year":"1999","unstructured":"H. Prokop . Cache-oblivious algorithms. Master's thesis , Department of Electrical Engineering and Computer Science , Massachusetts Institute of Technology , June 1999 . H. Prokop. Cache-oblivious algorithms. Master's thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, June 1999."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/321650.321658"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/321832.321846"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/20.3.242"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1090.0381"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29344-3_52"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786.2793"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/800200.806206"},{"key":"e_1_3_2_1_45_1","unstructured":"Tokutek Inc. TokuDB: MySQL Performance MariaDB Performance. http:\/\/www.tokutek.com\/products\/tokudb-for-mysql\/.  Tokutek Inc. TokuDB: MySQL Performance MariaDB Performance. http:\/\/www.tokutek.com\/products\/tokudb-for-mysql\/."},{"key":"e_1_3_2_1_46_1","unstructured":"Tokutek Inc. TokuMX--MongoDB Performance Engine. http:\/\/www.tokutek.com\/products\/tokumx-for-mongodb\/.  Tokutek Inc. TokuMX--MongoDB Performance Engine. http:\/\/www.tokutek.com\/products\/tokumx-for-mongodb\/."},{"key":"e_1_3_2_1_47_1","first-page":"70","article-title":"Rescheduling on a single machine with part-type dependent setup times and deadlines","author":"Unal A. T.","year":"1997","unstructured":"A. T. Unal , R. Uzsoy , and A. S. Kiran . Rescheduling on a single machine with part-type dependent setup times and deadlines . Ann. Op. Res. , 70 , 1997 . A. T. Unal, R. Uzsoy, and A. S. Kiran. Rescheduling on a single machine with part-type dependent setup times and deadlines. Ann. Op. Res., 70, 1997.","journal-title":"Ann. Op. Res."},{"key":"e_1_3_2_1_48_1","unstructured":"J. C. Verschae. The Power of Recourse in Online Optimization Robust Solutions for Scheduling Matroid and MST Problems The Power of Recourse in Online Optimization: Robust Solutions for Scheduling Matroid and MST Problems. PhD thesis Technischen Universitat Berlin June 2012.  J. C. Verschae. The Power of Recourse in Online Optimization Robust Solutions for Scheduling Matroid and MST Problems The Power of Recourse in Online Optimization: Robust Solutions for Scheduling Matroid and MST Problems. PhD thesis Technischen Universitat Berlin June 2012."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802183"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/16894.16879"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90034-D"},{"issue":"3","key":"e_1_3_2_1_52_1","first-page":"240","article-title":"The bay restaurant--a linear storage problem","volume":"81","author":"Woodall D.","year":"1974","unstructured":"D. Woodall . The bay restaurant--a linear storage problem . The American Mathematical Monthly , 81 ( 3 ): 240 -- 246 , 1974 . D. Woodall. The bay restaurant--a linear storage problem. The American Mathematical Monthly, 81(3):240--246, 1974.","journal-title":"The American Mathematical Monthly"}],"event":{"name":"SIGMOD\/PODS'14: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Snowbird Utah USA","acronym":"SIGMOD\/PODS'14"},"container-title":["Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2594538.2594548","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2594538.2594548","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:00:52Z","timestamp":1750230052000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2594538.2594548"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,18]]},"references-count":52,"alternative-id":["10.1145\/2594538.2594548","10.1145\/2594538"],"URL":"https:\/\/doi.org\/10.1145\/2594538.2594548","relation":{},"subject":[],"published":{"date-parts":[[2014,6,18]]},"assertion":[{"value":"2014-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}