Skip to main content
Springer Nature Link
Log in

New Results on Test-Cost Minimization in Database Migration

  • Conference paper
  • First Online:
Algorithmic Aspects of Cloud Computing (ALGOCLOUD 2021)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 13084))

Included in the following conference series:

Abstract

An important ubiquitous task in modern cloud systems is the migration of databases from one location to another. In practical settings, the databases are migrated in several shifts in order to meet the quality of service requirements of the end-users [18]. Once a batch of databases is migrated in a shift, the applications that depend on the databases on that shift are to be immediately tested [8]. Testing an application is a costly procedure [25] and the number of times an application is to be tested throughout the migration process varies greatly depending on the migration schedule. An interesting algorithmic challenge is to find a schedule that minimizes the total testing cost of all the applications. This problem, referred to as the capacity constrained database migration (CCDM) problem, is known to be NP-hard and fixed-parameter intractable for various relevant parameters [24]. In this paper, we provide new approximability and inapproximability results as well as new conditional lower bounds for the running time of any exact algorithm for the CCDM problem. Also, we adapt heuristic algorithms devised for the Hypergraph Partitioning problem to the CCDM problem and give extensive experimental results.

This research was supported in part by the Air-Force Office of Scientific Research through Grant FA9550-19-1-0177 and in part by the Air-Force Research Laboratory, Rome through Contract FA8750-17-S-7007.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. 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–42 (2017)

    Google Scholar 

  2. Andre, R., Schlag, S., Schulz, C.: Memetic multilevel hypergraph partitioning. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 347–354 (2018)

    Google Scholar 

  3. Catalyurek, U.V., Aykanat, C.: Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication. IEEE Trans. Parallel Distrib. Syst. 10(7), 673–693 (1999)

    Article  Google Scholar 

  4. Cohan, P.: How much of Amazon’s \$7.3 billion AWS profit will rivals win? (2020)

    Google Scholar 

  5. Fiduccia, C.M., Mattheyses, R.M.: A linear-time heuristic for improving network partitions. In: 19th Design Automation Conference, pp. 175–181. IEEE (1982)

    Google Scholar 

  6. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)

    MATH  Google Scholar 

  7. Gottesbüren, 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ür Informatik (2020)

    Google Scholar 

  8. Harrold, M.J., et al.: Regression test selection for Java software. ACM Sigplan Not. 36(11), 312–326 (2001)

    Article  Google Scholar 

  9. Heuer, T., Sanders, P., Schlag, S.: Network flow-based refinement for multilevel hypergraph partitioning. J. Exp. Algorithmics (JEA) 24, 1–36 (2019)

    Article  MathSciNet  Google Scholar 

  10. 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)

    Google Scholar 

  11. Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63(4), 512–530 (2001)

    Article  MathSciNet  Google Scholar 

  12. Karpinski, M.: Approximability of the minimum bisection problem: an algorithmic challenge. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol. 2420, pp. 59–67. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45687-2_4

    Chapter  Google Scholar 

  13. 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–79 (1999)

    Article  Google Scholar 

  14. Karypis, G., Kumar, V.: Multilevel k-way hypergraph partitioning. VLSI Des. 11(3), 285–300 (2000)

    Article  Google Scholar 

  15. Krauthgamer, R., Feige, U.: A polylogarithmic approximation of the minimum bisection. SIAM Rev. 48(1), 99–130 (2006)

    Article  MathSciNet  Google Scholar 

  16. 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–20. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-25313-8_1

    Chapter  Google Scholar 

  17. Orponen, P., Mannila, H.: On approximation preserving reductions: complete problems and robust measures. Technical report, Department of Computer Science, University of Helsinki (1987)

    Google Scholar 

  18. Patil, S., et al.: Minimizing testing overheads in database migration lifecycle. In: COMAD, p. 191 (2010)

    Google Scholar 

  19. Rao, S.K., Prasad, R.: Impact of 5G technologies on smart city implementation. Wirel. Pers. Communi. 100(1), 161–176 (2018). https://doi.org/10.1007/s11277-018-5618-4

    Article  Google Scholar 

  20. Ravikumar, Y.V., Krishnakumar, K.M., Basha, N.: Oracle database migration. In: Oracle Database Upgrade and Migration Methods, pp. 213–277. Springer, Berkeley (2017). https://doi.org/10.1007/978-1-4842-2328-4_5

    Chapter  Google Scholar 

  21. 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–226. ACM Press, New York (1978)

    Google Scholar 

  22. 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–67 (2016)

    Google Scholar 

  23. 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–121. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-58628-7_7

    Chapter  Google Scholar 

  24. 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–12. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-19759-9_1

    Chapter  Google Scholar 

  25. Vergilio, S.R., Maldonado, J.C., Jino, M., Soares, I.W.: Constraint based structural testing criteria. J. Syst. Soft. 79(6), 756–771 (2006)

    Article  Google Scholar 

  26. 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–372. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-67899-9_29

    Chapter  Google Scholar 

  27. 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–1169 (2013)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, TOBB University of Economics and Technology, Ankara, Turkey

    Utku Umur Acikalin & Bugra Caskurlu

  2. LDCSEE, West Virginia University, Morgantown, WV, USA

    Piotr Wojciechowski & K. Subramani

Authors
  1. Utku Umur Acikalin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bugra Caskurlu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Piotr Wojciechowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. K. Subramani
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Piotr Wojciechowski .

Editor information

Editors and Affiliations

  1. Gran Sasso Science Institute (GSSI), L’Aquila, Italy

    Gianlorenzo D’Angelo

  2. University of Liverpool, Liverpool, UK

    Othon Michail

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Acikalin, U.U., Caskurlu, B., Wojciechowski, P., Subramani, K. (2021). New Results on Test-Cost Minimization in Database Migration. In: D’Angelo, G., Michail, O. (eds) Algorithmic Aspects of Cloud Computing. ALGOCLOUD 2021. Lecture Notes in Computer Science(), vol 13084. Springer, Cham. https://doi.org/10.1007/978-3-030-93043-1_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-93043-1_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-93042-4

  • Online ISBN: 978-3-030-93043-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics