Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.11851/10708
Title: Security-Aware Database Migration Planning
Authors: Acikalin, Utku Umur
Caskurlu, Bugra
Subramani, K.
Keywords: Bin-Packing
Approximation Scheme
Algorithms
Publisher: Springer
Abstract: Database migration is an important problem faced by companies dealing with big data. Not only is migration a costly procedure, but it also 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. For the NP-hard models, we develop memetic algorithms that produce solutions that are within 10% and 7% of the optimal in 95% of the instances under 8 and 82 seconds, respectively.
Description: Article; Early Access
URI: https://doi.org/10.1007/s10601-023-09351-6
https://hdl.handle.net/20.500.11851/10708
ISSN: 1383-7133
1572-9354
Appears in Collections:Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

Show full item record



CORE Recommender

Page view(s)

86
checked on Dec 16, 2024

Google ScholarTM

Check




Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.