Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.11851/10708
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Acikalin, Utku Umur | - |
dc.contributor.author | Caskurlu, Bugra | - |
dc.contributor.author | Subramani, K. | - |
dc.date.accessioned | 2023-10-24T07:01:46Z | - |
dc.date.available | 2023-10-24T07:01:46Z | - |
dc.date.issued | 2023 | - |
dc.identifier.issn | 1383-7133 | - |
dc.identifier.issn | 1572-9354 | - |
dc.identifier.uri | https://doi.org/10.1007/s10601-023-09351-6 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.11851/10708 | - |
dc.description | Article; Early Access | en_US |
dc.description.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. | en_US |
dc.description.sponsorship | Defense Advanced Research Projects Agency [HR001123S0001-FP-004] | en_US |
dc.description.sponsorship | AcknowledgementsThis research was supported in part by the Defense Advanced Research Projects Agency through grant HR001123S0001-FP-004. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Springer | en_US |
dc.relation.ispartof | Constraints | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Bin-Packing | en_US |
dc.subject | Approximation Scheme | en_US |
dc.subject | Algorithms | en_US |
dc.title | Security-Aware Database Migration Planning | en_US |
dc.type | Article | en_US |
dc.department | TOBB ETÜ | en_US |
dc.identifier.wos | WOS:001045554800001 | en_US |
dc.identifier.scopus | 2-s2.0-85167514245 | en_US |
dc.institutionauthor | … | - |
dc.identifier.doi | 10.1007/s10601-023-09351-6 | - |
dc.authorscopusid | 35309348400 | - |
dc.authorscopusid | 35104543000 | - |
dc.authorscopusid | 8921210200 | - |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.identifier.scopusquality | Q3 | - |
item.openairetype | Article | - |
item.languageiso639-1 | en | - |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
crisitem.author.dept | 02.1. Department of Artificial Intelligence Engineering | - |
Appears in Collections: | Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
CORE Recommender
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.