{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T09:06:13Z","timestamp":1743757573384,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030930424"},{"type":"electronic","value":"9783030930431"}],"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-93043-1_3","type":"book-chapter","created":{"date-parts":[[2021,12,9]],"date-time":"2021-12-09T03:03:52Z","timestamp":1639019032000},"page":"38-55","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["New Results on Test-Cost Minimization in Database Migration"],"prefix":"10.1007","author":[{"given":"Utku Umur","family":"Acikalin","sequence":"first","affiliation":[]},{"given":"Bugra","family":"Caskurlu","sequence":"additional","affiliation":[]},{"given":"Piotr","family":"Wojciechowski","sequence":"additional","affiliation":[]},{"given":"K.","family":"Subramani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,10]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Akhremtsev, Y., Heuer, T., Sanders, P., Schlag, S.: Engineering a direct $$k$$-way hypergraph partitioning algorithm. In: 19th Workshop on Algorithm Engineering and Experiments (ALENEX 2017), pp. 28\u201342 (2017)","DOI":"10.1137\/1.9781611974768.3"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Andre, R., Schlag, S., Schulz, C.: Memetic multilevel hypergraph partitioning. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 347\u2013354 (2018)","DOI":"10.1145\/3205455.3205475"},{"issue":"7","key":"3_CR3","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1109\/71.780863","volume":"10","author":"UV Catalyurek","year":"1999","unstructured":"Catalyurek, U.V., Aykanat, C.: Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication. IEEE Trans. Parallel Distrib. Syst. 10(7), 673\u2013693 (1999)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"3_CR4","unstructured":"Cohan, P.: How much of Amazon\u2019s \\$7.3 billion AWS profit will rivals win? (2020)"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Fiduccia, C.M., Mattheyses, R.M.: A linear-time heuristic for improving network partitions. In: 19th Design Automation Conference, pp. 175\u2013181. IEEE (1982)","DOI":"10.1109\/DAC.1982.1585498"},{"key":"3_CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"key":"3_CR7","unstructured":"Gottesb\u00fcren, L., Hamann, M., Schlag, S., Wagner, D.: Advanced flow-based multilevel hypergraph partitioning. In: 18th International Symposium on Experimental Algorithms (SEA 2020). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"issue":"11","key":"3_CR8","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1145\/504311.504305","volume":"36","author":"MJ Harrold","year":"2001","unstructured":"Harrold, M.J., et al.: Regression test selection for Java software. ACM Sigplan Not. 36(11), 312\u2013326 (2001)","journal-title":"ACM Sigplan Not."},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3329872","volume":"24","author":"T Heuer","year":"2019","unstructured":"Heuer, T., Sanders, P., Schlag, S.: Network flow-based refinement for multilevel hypergraph partitioning. J. Exp. Algorithmics (JEA) 24, 1\u201336 (2019)","journal-title":"J. Exp. Algorithmics (JEA)"},{"key":"3_CR10","unstructured":"Heuer, T., Schlag, S.: Improving coarsening schemes for hypergraph partitioning by exploiting community structure. In: 16th International Symposium on Experimental Algorithms (SEA 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)"},{"issue":"4","key":"3_CR11","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63(4), 512\u2013530 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/3-540-45687-2_4","volume-title":"Mathematical Foundations of Computer Science 2002","author":"M Karpinski","year":"2002","unstructured":"Karpinski, M.: Approximability of the minimum bisection problem: an algorithmic challenge. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol. 2420, pp. 59\u201367. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45687-2_4"},{"issue":"1","key":"3_CR13","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1109\/92.748202","volume":"7","author":"G Karypis","year":"1999","unstructured":"Karypis, G., Aggarwal, R., Kumar, V., Shekhar, S.: Multilevel hypergraph partitioning: applications in VLSI domain. IEEE Trans. Very Large Scale Integr. Syst. (VLSI) 7(1), 69\u201379 (1999)","journal-title":"IEEE Trans. Very Large Scale Integr. Syst. (VLSI)"},{"issue":"3","key":"3_CR14","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1155\/2000\/19436","volume":"11","author":"G Karypis","year":"2000","unstructured":"Karypis, G., Kumar, V.: Multilevel k-way hypergraph partitioning. VLSI Des. 11(3), 285\u2013300 (2000)","journal-title":"VLSI Des."},{"issue":"1","key":"3_CR15","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/050640904","volume":"48","author":"R Krauthgamer","year":"2006","unstructured":"Krauthgamer, R., Feige, U.: A polylogarithmic approximation of the minimum bisection. SIAM Rev. 48(1), 99\u2013130 (2006)","journal-title":"SIAM Rev."},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-25313-8_1","volume-title":"Big-Data Analytics and Cloud Computing","author":"DC Nascimento","year":"2015","unstructured":"Nascimento, D.C., Pires, C.E., Mestre, D.: Data quality monitoring of cloud databases based on data quality SLAs. In: Trovati, M., Hill, R., Anjum, A., Zhu, S.Y., Liu, L. (eds.) Big-Data Analytics and Cloud Computing, pp. 3\u201320. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-25313-8_1"},{"key":"3_CR17","unstructured":"Orponen, P., Mannila, H.: On approximation preserving reductions: complete problems and robust measures. Technical report, Department of Computer Science, University of Helsinki (1987)"},{"key":"3_CR18","unstructured":"Patil, S., et al.: Minimizing testing overheads in database migration lifecycle. In: COMAD, p. 191 (2010)"},{"issue":"1","key":"3_CR19","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s11277-018-5618-4","volume":"100","author":"SK Rao","year":"2018","unstructured":"Rao, S.K., Prasad, R.: Impact of 5G technologies on smart city implementation. Wirel. Pers. Communi. 100(1), 161\u2013176 (2018). https:\/\/doi.org\/10.1007\/s11277-018-5618-4","journal-title":"Wirel. Pers. Communi."},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-1-4842-2328-4_5","volume-title":"Oracle Database Upgrade and Migration Methods","author":"YV Ravikumar","year":"2017","unstructured":"Ravikumar, Y.V., Krishnakumar, K.M., Basha, N.: Oracle database migration. In: Oracle Database Upgrade and Migration Methods, pp. 213\u2013277. Springer, Berkeley (2017). https:\/\/doi.org\/10.1007\/978-1-4842-2328-4_5"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Aho, A. (ed.) Proceedings of the 10th Annual ACM Symposium on Theory of Computing, pp. 216\u2013226. ACM Press, New York (1978)","DOI":"10.1145\/800133.804350"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Schlag, S., Henne, V., Heuer, T., Meyerhenke, H., Sanders, P., Schulz, C.: $$k$$-way hypergraph partitioning via $$n$$-level recursive bisection. In: 18th Workshop on Algorithm Engineering and Experiments (ALENEX 2016), pp. 53\u201367 (2016)","DOI":"10.1137\/1.9781611974317.5"},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-030-58628-7_7","volume-title":"Algorithmic Aspects of Cloud Computing","author":"K Subramani","year":"2020","unstructured":"Subramani, K., Caskurlu, B., Acikalin, U.U.: Security-aware database migration planning. In: Brandic, I., Genez, T.A.L., Pietri, I., Sakellariou, R. (eds.) ALGOCLOUD 2019. LNCS, vol. 12041, pp. 103\u2013121. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58628-7_7"},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-19759-9_1","volume-title":"Algorithmic Aspects of Cloud Computing","author":"K Subramani","year":"2019","unstructured":"Subramani, K., Caskurlu, B., Velasquez, A.: Minimization of testing costs in capacity-constrained database migration. In: Disser, Y., Verykios, V.S. (eds.) ALGOCLOUD 2018. LNCS, vol. 11409, pp. 1\u201312. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19759-9_1"},{"issue":"6","key":"3_CR25","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1016\/j.jss.2005.06.012","volume":"79","author":"SR Vergilio","year":"2006","unstructured":"Vergilio, S.R., Maldonado, J.C., Jino, M., Soares, I.W.: Constraint based structural testing criteria. J. Syst. Soft. 79(6), 756\u2013771 (2006)","journal-title":"J. Syst. Soft."},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-3-030-67899-9_29","volume-title":"Algorithms and Discrete Applied Mathematics","author":"P Wojciechowski","year":"2021","unstructured":"Wojciechowski, P., Subramani, K., Velasquez, A., Caskurlu, B.: Algorithmic analysis of priority-based bin packing. In: Mudgal, A., Subramanian, C.R. (eds.) CALDAM 2021. LNCS, vol. 12601, pp. 359\u2013372. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-67899-9_29"},{"key":"3_CR27","doi-asserted-by":"publisher","first-page":"1162","DOI":"10.1016\/j.procs.2013.05.148","volume":"17","author":"W Xiaonian","year":"2013","unstructured":"Xiaonian, W., Deng, M., Zhang, R., Zeng, B., Zhou, S.: A task scheduling algorithm based on QoS-driven in cloud computing. Procedia Comput. Sci. 17, 1162\u20131169 (2013)","journal-title":"Procedia Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects of Cloud Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93043-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,14]],"date-time":"2021-12-14T19:12:06Z","timestamp":1639509126000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93043-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030930424","9783030930431"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93043-1_3","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":"10 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ALGOCLOUD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Aspects of Cloud Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"6 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"algocloud2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo2021.tecnico.ulisboa.pt\/ALGOCLOUD2021\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","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":"4","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":"1","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":"36% - 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","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":"2.06","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the COVID-19 pandemic the conference was held online.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}