Abstract
Database migration is an important problem faced by companies dealing with big data. Not only is migration a costly procedure, it involves serious security risks as well. For some institutions, the primary focus is on reducing the cost of the migration operation, which manifests itself in application testing. For other institutions, minimizing security risks is the most important goal, especially if the data involved is of a sensitive nature. In the literature, the database migration problem has been studied from a test cost minimization perspective. In this paper, we focus on an orthogonal measure, i.e., security risk minimization. We associate security with the number of shifts needed to complete the migration task. Ideally, we want to complete the migration in as few shifts as possible, so that the risk of data exposure is minimized. In this paper, we provide a formal framework for studying the database migration problem from the perspective of security risk minimization (shift minimization) and establish the computational complexities of several models in the same. We present experimental results for various intractable models and show that our heuristic methods produce solutions that are within \(3.67\%\) of the optimal in more than \(85\%\) of the cases.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Behm, A., Geppert, A., Dittrich, K.R.: On the migration of relational schemas and data to object-oriented database systems. Technical report, University of Zurich (1997)
Brodal, G.S., Frigioni, D., Marchetti-Spaccamela, A. (eds.): WAE 2001. LNCS, vol. 2141. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-44688-5
Chatterjee, A., Segev, A.: Data manipulation in heterogeneous databases. SIGMOD Rec. 20(4), 64–68 (1991)
Chon, H.D., Agrawal, D., El Abbadi, A.: Data management for moving objects. IEEE Data Eng. Bull. 25(2), 41–47 (2002)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2009)
Delorme, M., Iori, M., Martello, S.: BPPLIB: a library for bin packing and cutting stock problems. Optim. Lett. 12(2), 235–250 (2017). https://doi.org/10.1007/s11590-017-1192-z
Dósa, G., Sgall, J.: First fit bin packing: a tight analysis. In: 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, Kiel, Germany, 27 February–2 March 2013, pp. 538–549 (2013)
Drumm, C., Schmitt, M., Do, H.H., Rahm, E.: Quickmig: automatic schema matching for data migration projects. In: Proceedings of the Sixteenth ACM Conference on Information and Knowledge Management, CIKM 2007, Lisbon, Portugal, 6–10 November 2007, pp. 107–116 (2007)
Falkenauer, E.: A hybrid grouping genetic algorithm for bin packing. J. Heuristics 2(1), 5–30 (1996)
Ferrandina, F., Meyer, T., Zicari, R., Ferran, G., Madec, J.: Schema and database evolution in the O2 object database system. In: VLDB 1995, Proceedings of 21th International Conference on Very Large Data Bases, Zurich, Switzerland, 11–15 September 1995, pp. 170–181 (1995)
Gandhi, R., Halldórsson, M.M., Kortsarz, G., Shachnai, H.: Improved results for data migration and open shop scheduling. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 658–669. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-27836-8_56
Gandhi, R., Mestre, J.: Combinatorial algorithms for data migration to minimize average completion time. Algorithmica 54(1), 54–71 (2009)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)
Goldman, R., McHugh, J., Widom, J.: From, semistructured data to XML: migrating the lore data model and query language. In: ACM SIGMOD Workshop on the Web and Databases, WebDB 1999, Philadelphia, Pennsylvania, USA, 3–4 June 1999. Informal Proceedings, pp. 25–30 (1999)
Golubchik, L., Khuller, S., Kim, Y.-A., Shargorodskaya, S., Wan, Y.-C.J.: Data migration on parallel disks. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 689–701. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-30140-0_61
Hall, J., Hartline, J.D., Karlin, A.R., Saia, J., Wilkes, J.: On algorithms for efficient data migration. In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, Washington, DC, USA, 7–9 January 2001, pp. 620–629 (2001)
Hirofuchi, T., Ogawa, H., Nakada, H., Itoh, S., Sekiguchi, S.: A live storage migration mechanism over WAN for relocatable virtual machine services on clouds. In: 9th IEEE/ACM International Symposium on Cluster Computing and the Grid, CCGrid 2009, Shanghai, China, 18–21 May 2009, pp. 460–465 (2009)
Jensen, M., Schwenk, J., Gruschka, N., Iacono, L.L.: On technical security issues in cloud computing. In: IEEE International Conference on Cloud Computing, CLOUD 2009, Bangalore, India, 21–25 September 2009, pp. 109–116 (2009)
Khuller, S., Kim, Y.A., Wan, Y.J.: Algorithms for data migration with cloning. In: Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, San Diego, CA, USA, 9–12 June 2003, pp. 27–36 (2003)
Martello, S., Toth, P.: Lower bounds and reduction procedures for the bin packing problem. Discret. Appl. Math. 28(1), 59–70 (1990)
McBrien, P., Poulovassilis, A.: Automatic migration and wrapping of database applications - a schema transformation approach. In: Proceedings of Conceptual Modeling - ER 1999, 18th International Conference on Conceptual Modeling, Paris, France, 15–18 November 1999, pp. 96–113 (1999)
Meier, A.: Providing database migration tools - a practicioner’s approach. In: VLDB 1995, Proceedings of 21th International Conference on Very Large Data Bases, Zurich, Switzerland, 11–15 September 1995, pp. 635–641 (1995)
Myllymaki, J.: Effective web data extraction with standard XML technologies. In: Proceedings of the Tenth International World Wide Web Conference, WWW 10, Hong Kong, China, 1–5 May 2001, pp. 689–696 (2001)
Narayanan, D., Thereska, E., Donnelly, A., Elnikety, S., Rowstron, A.I.T.: Migrating server storage to SSDs: analysis of tradeoffs. In: Proceedings of the 2009 EuroSys Conference, Nuremberg, Germany, 1–3 April 2009, pp. 145–158 (2009)
Otto, A., Otto, C., Scholl, A.: Systematic data generation and test design for solution algorithms on the example of salbpgen for assembly line balancing. Eur. J. Oper. Res. 228(1), 33–45 (2013)
Quiroz-Castellanos, M., Cruz Reyes, L., Torres-Jiménez, J., Santillán, C.G., Fraire Huacuja, H.J., Alvim, A.C.F.: A grouping genetic algorithm with controlled gene transmission for the bin packing problem. Comput. OR 55, 52–64 (2015)
Scholl, A., Klein, R., Jürgens, C.: Bison: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Comput. OR 24(7), 627–645 (1997)
Seo, B., Zimmermann, R.: Efficient disk replacement and data migration algorithms for large disk subsystems. TOS 1(3), 316–345 (2005)
Subramani, K., Caskurlu, B., Velasquez, A.: Minimization of testing costs in capacity-constrained database migration. In: Algorithmic Aspects of Cloud Computing - 4th International Symposium, ALGOCLOUD 2018, Helsinki, Finland, 20–21 August 2018. Revised Selected Papers, pp. 1–12 (2018)
Wang, J., Lochovsky, F.H.: Data extraction and label assignment for web databases. In: Proceedings of the Twelfth International World Wide Web Conference, WWW 2003, Budapest, Hungary, 20–24 May 2003, pp. 187–196 (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Subramani, K., Caskurlu, B., Acikalin, U.U. (2020). Security-Aware Database Migration Planning. In: Brandic, I., Genez, T., Pietri, I., Sakellariou, R. (eds) Algorithmic Aspects of Cloud Computing. ALGOCLOUD 2019. Lecture Notes in Computer Science(), vol 12041. Springer, Cham. https://doi.org/10.1007/978-3-030-58628-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-030-58628-7_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-58627-0
Online ISBN: 978-3-030-58628-7
eBook Packages: Computer ScienceComputer Science (R0)