• The Transactions of the Korea Information Processing Society
• /
• v.6 no.4
• /
• pp.851-867
• /
• 1999

Numerous proposals for extending the relational data model as well as conceptual and object-oriented data models have been suggested. However, there has been relatively less research in the area of defining segmented storage structure and data migration strategies for temporal data. This paper presents the segmented storage structure in order to increment search performance and the two data migration strategies for segmented storage structure. this paper presents the two data migration strategies : the migration strategy by Time granularity, the migration strategy by LST-GET. In the migration strategy by Time Granularity, the dividing time point to assign the entity versions to the past segment, the current segment, and future segment is defined and the searching and moving process for data validity at a granularity level are described. In the migration strategy by LST-GET, we describe the process how to compute the value of dividing criterion. searching and moving processes are described for migration on the future segment and the current segment and entity versions 새 assign on each segment are defined. We simulate the search performance of the segmented storage structure in order to compare it with conventional storage structure in relational database system. And extensive simulation studies are performed in order to compare the search performance of the migration strategies with the segmented storage structure.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.329-332
• /
• 2000

Research interests on temporal data have been almost focused on data models. There has been relatively less research in the area of temporal data management. In this paper, we propose two data migration strategies based on time-segmented storage structure: the migration strategy by Time Granularity, the migration strategy by LST-GET. We describe the criterion for data migration and moving process. We simulated the performance of the migration strategy by Time Granularity in order to compare it with non-segmentation method. We compared and analyzed two data migration strategies for temporal data.

• Journal of Korea Multimedia Society
• /
• v.2 no.1
• /
• pp.9-21
• /
• 1999

This paper presents the time-segmented storage structure in order to increment search performance and the two data migration strategies: migration by Time Granularity and migration by LST-GET. In the migration strategy by Time Granularity, we describe how to assign entity version to the past, current segment, and future segments. We also describe searching and moving processes for data validity at a granularity level. In the migration strategy by LST-GET, we describe how to computer the value of dividing criterion. We simulate the search performance of the proposed segmented storage structure in comparison with the conventional storage structure in comparison with the conventional storage structure in relational database system. Finally, extensive simulation studies are performed in order to compare the search performance of the migration strategies with the time-segmented storage structure.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.5
• /
• pp.1-7
• /
• 2012

In this paper, we design and implement the simulator for WAN storage replication model performance evaluation in cloud computing environment. Each cloud of simulator is composed of virtual machine emulator and storage emulator. The virtual machine emulator is composed of read/write ratio module, the read/write sequence combination module, and the read/write request module. The storage emulator is composed of storage management module, data transfer module, read/write operations module, and overhead processing module. Using the simulator, we evaluate performance of migration scheme, pre-copy and the post-copy, considering about read/write ratio, network delay, and network bandwidth. Through simulation, we have confirmed that the average migration time of pre-copy was decreased proportional to the read operation. However, average migration time of post-copy was on the increase. Also, the average migration time of post-copy was increased proportional to the network delay. However, average migration time of pre-copy was shown uniformly. Therefore, we show that pre-copy model more effective to reduce the average migration time than the post-copy model. The average migration time of pre-copy and post-copy were not affected by the change of network bandwidth. Therefore, these results show that selects the storage replication model to be, the network bandwidth know not being the important element.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2011.06a
• /
• pp.15-16
• /
• 2011

본 논문에서는 클라우드 컴퓨팅 환경에서 저장공간 이주(storage migration)시에 저장공간의 읽기/쓰기 비율을 고려한 저장공간 복제 모델 선정을 위한 실험 환경을 설계한다. 기존의 저장공간 이주 모델은 가상머신과 저장공간중에 저장공간이 먼저 이주하는 선복제(pre-copy)와 나중에 이주하는 후복제(post-copy)가 있다. 이러한 복제 기법은 VM과 저장공간 이주의 필요성과 그 방법만을 제안하였으며, 성능 향상을 위한 이주 기법 선정 방법은 제시하지 못하였다. 따라서 본 논문에서는 클라우드 컴퓨팅 환경에서 다양한 스토리지의 읽기/쓰기 비율에 따른 이주 모델 선정 기법을 실험할 수 있는 시뮬레이터 설계 방법을 제시한다.

• The KIPS Transactions:PartD
• /
• v.8D no.6
• /
• pp.813-822
• /
• 2001

In this paper we proposed four data migration methods based on time segmented storage structure including past segment, current segment, and future segment. The migration methods proposed in this paper are the Time Granularity migration method, the LST-GET (Least valid Start Time-Greatest valid End Time) migration method, the AST-AET (Average valid Start Time-Average valid End Time) migration method, and the Min-Overlap migration method. In the each data migration method we define the dividing criterion among segments and entity versions to store on each segment. We measured the response time of queries for the proposed migration methods. When there are no LLTs (Long Lived Tuples), the average response time of AST-AET migration method and LST-GET migration method are smaller than that of Time Granularity migration method. In case of existing LLT, the performance of the LST-GET migration method decreased. The AST-AET migration method resulted in better performance for queries than the Time Granularity migration method and the LST-GET migration method. The Min-Overlap migration method resulted in the almost equal performance for queries compared with the AST-AET migration method, in case of storage utilization more efficient than the AST-AET.

• KIISE Transactions on Computing Practices
• /
• v.22 no.6
• /
• pp.278-283
• /
• 2016

Due to explosive increase in the amount of data produced recently, cloud storage system is required to offer high and stable performance. However, VM (Virtual Machine) migration may result in lowered storage service performance. Especially, in an environment where the host-side flash cache is used in a cloud system, the existing warmed up cache is lost and the problematic cold start begins at a new cache due to a VM migration. In this paper, we first demonstrate and analyze the cold start problem and then propose Cachemior (Cache migrator) which enables efficient hot start of the flash cache.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.1
• /
• pp.436-453
• /
• 2018

Storage cloud scheme, pushing data to the storage cloud poses much attention regarding data confidentiality. With encryption concept, data accessibility is limited because of encrypted data. To secure storage system with high access power is complicated due to dispersed storage environment. In this paper, we propose a hardware-based security scheme such that a secure dispersed storage system using erasure code is articulated. We designed a hardware-based security scheme with data encoding operations and migration capabilities. Using TPM (Trusted Platform Module), the data integrity and security is evaluated and achieved.

• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.7
• /
• pp.508-519
• /
• 2007

Flash memory based storage has been used in various mobile systems and now is to be used in Laptop computers in the name of Solid State Disk. The Flash memory has not only merits in terms of weight, shock resistance, and power consumption but also limitations like erase-before-write property. To overcome these limitations, Flash memory based storage requires special address mapping software called FTL(Flash-memory Translation Layer), which often performs merge operation for block recycling. In order to reduce block recycling cost in NAND Flash memory based storage, we introduce another block recycling scheme which we call migration. As a result, the FTL can select either merge or migration depending on their costs for each block recycling. Experimental results with Postmark benchmark and embedded system workload show that this cost-based selection of migration/merge operation improves the performance of Flash memory based storage. Also, we present a solution of macroscopic optimal migration/merge sequence that minimizes a block recycling cost for each migration/merge combination period. Experimental results show that the performance of Flash memory based storage can be more improved by the macroscopic optimization than the simple cost-based selection.

• Food Science of Animal Resources
• /
• v.23 no.2
• /
• pp.103-108
• /
• 2003

The effect of fat content, thickness, and storage temperature and period of fresh meat samples on the migration of di-(2-ethylhexyl) adipate(DEHA) from plasticized PVC film was investigated. Pork samples were prepared to have different fat contents by mixing with pork loin and pork backfat and stored at 5$^{\circ}C$ for 2 d. The migration values of DEHA into the pork samples were increased with a high fat content. There was a gradual increase in the DEHA concentration as a function of prolonged exposure period and elevated storage temperature when the pork samples were stored at -2, 5 and l0$^{\circ}C$ for up to 7 d, respectively. The migration of DEHA into fresh pork and beef was limited only to a small depth under the meat surface($\leq$2 cm). The migration value was higher when the pork belly was wrapped double with plasticized PVC film compared to once after storage at 5$^{\circ}C$ for 3 d. However, when the samples was minced and repacked with new film after 2 d, and kept for a further 1 d, these showed lower migration value compared to the above two intact samples. Migration values exceeded in most cases the upper limit for DEHA migration proposed by the EU(18 mg/kg or 3 mg/d㎡), even though no limitation is currently set in Korea.