Algorithms for data migration with cloning

Our work is motivated by the problem of managing data on storage devices, typically a set of disks. Such high demand storage servers are used as web servers, or multimedia servers for handling high demand for data. As the system is running, it needs to dynamically respond to changes in demand for different data items. In this work we study the data migration problem, which arises when we need to quickly change one storage configuration into another. We show that this problem is NP-hard. In addition, we develop polynomial-time approximation algorithms for this problem and prove a worst case bound of 9.5 on the approximation factor achieved by our algorithm. We also compare the algorithm to several heuristics for this problem.

• Type: Conference
• Year: 2003
• Where: PODS
• Authors: Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan
• Keywords: Data Migration Problem, Database, Demand Storage Servers, PODS 2003, Polynomial-time Approximation Algorithms