Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.11851/2672
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSubramani, Kiruba Sankaran-
dc.contributor.authorÇaşkurlu, Buğra-
dc.contributor.authorVelasquez, A.-
dc.date.accessioned2019-12-25T14:02:00Z
dc.date.available2019-12-25T14:02:00Z
dc.date.issued2019
dc.identifier.citationSubramani, K., Caskurlu, B., and Velasquez, A. (2018, August). Minimization of Testing Costs in Capacity-Constrained Database Migration. In International Symposium on Algorithmic Aspects of Cloud Computing (pp. 1-12). Springer, Cham.en_US
dc.identifier.isbn9.78303E+12
dc.identifier.issn3029743
dc.identifier.urihttps://link.springer.com/chapter/10.1007%2F978-3-030-19759-9_1-
dc.identifier.urihttps://hdl.handle.net/20.500.11851/2672-
dc.description4th International Symposium on Algorithmic Aspects of Cloud Computing (2018: Helsinki; Finland )
dc.description.abstractDatabase migration is an ubiquitous need faced by enterprises that generate and use vast amount of data. This is due to database software updates, or from changes to hardware, project standards, and other business factors [1]. Migrating a large collection of databases is a way more challenging task than migrating a single database, due to the presence of additional constraints. These constraints include capacities of shifts, sizes of databases, and timing relationships. In this paper, we present a comprehensive framework that can be used to model database migration problems of different enterprises with customized constraints, by appropriately instantiating the parameters of the framework. We establish the computational complexities of a number of instantiations of this framework. We present fixed-parameter intractability results for various relevant parameters of the database migration problem. Finally, we discuss a randomized approximation algorithm for an interesting instantiation. © 2019, Springer Nature Switzerland AG.en_US
dc.description.sponsorshipK. Subramani—This research was supported in part by the Air Force Research Laboratory Information Directorate, through the Air Force Office of Scientific Research Summer Faculty Fellowship Program and the Information Institute , contract numbers FA8750-16-3-6003 and FA9550-15-F-0001.
dc.language.isoenen_US
dc.publisherSpringer Verlagen_US
dc.relation.ispartofLecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics)en_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectTestingen_US
dc.subjectsoftware testingen_US
dc.subjectsuite reductionen_US
dc.titleMinimization of Testing Costs in Capacity-Constrained Database Migrationen_US
dc.typeConference Objecten_US
dc.departmentFaculties, Faculty of Engineering, Department of Computer Engineeringen_US
dc.departmentFakülteler, Mühendislik Fakültesi, Bilgisayar Mühendisliği Bölümütr_TR
dc.identifier.volume11409
dc.identifier.startpage1
dc.identifier.endpage12
dc.authorid0000-0002-4647-205X-
dc.identifier.wosWOS:000769657600001en_US
dc.identifier.scopus2-s2.0-85065781538en_US
dc.institutionauthorÇaşkurlu, Buğra-
dc.identifier.doi10.1007/978-3-030-19759-9_1-
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.identifier.scopusqualityQ2-
item.openairetypeConference Object-
item.languageiso639-1en-
item.grantfulltextnone-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
crisitem.author.dept02.1. Department of Artificial Intelligence Engineering-
Appears in Collections:Bilgisayar Mühendisliği Bölümü / Department of Computer Engineering
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection
Show simple item record



CORE Recommender

WEB OF SCIENCETM
Citations

4
checked on Dec 21, 2024

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.