• The Transactions of the Korea Information Processing Society
• /
• v.7 no.4
• /
• pp.1033-1043
• /
• 2000

Recently as the user request on NoD (News-on-Demand) is largely increasing, there are a lot of researches to fulfill it. However, because of short life-cycle of new video data and periodical change of video data depending on anchor, it is difficult to apply the conventional video storage techniques to NOD applications directly. For this, we design and implement low-level storage manager for efficient storage and retrieval of multimedia data in NOD Services. Our low-level storage manager not only efficiently sotres video stream dat of new video itself, but also handles its index information. It provides an inverted file method for efficient text-based retrieval and an X-tree index structure for high-dimensional feature vectors. In addition, our low-level storage manager provides some application program interfaces (APIs) for storing video objects itself and index information extracted from hierarchial new video and some APIs for retrieving video objects easily by using cursors. Finally, we implement our low-level storage manager based on SHORE (Scalable Heterogeneous Object REpository) storage system by sunig a standard C++ language under UNIX operating system.

• The KIPS Transactions:PartD
• /
• v.14D no.6
• /
• pp.623-632
• /
• 2007

GML is a markup language presented as exchange standard for geographic information by the OGC(Open GIS Consortium). In spatial network databases, researches for supporting GML(Geographic Markup Language) can be divided into the parsing, the storing and the retrieval of GML documents. Among them, the study on the storage of GML documents is essential for their efficient retrieval. However there is little research on the storing of GML documents whereas there have been a lot of researches on the storing of n documents. Because the storage schema designed for XML documents are not appropriate for geographic information, we, in this paper, propose three storage schema for efficiently storing GML documents including geographic information in order to solve the problem that the XML storage schema store duplicate data and need to search many tables for obtaining elements. In addition, we design and implement a low-level storage manager which can store GML documents using the proposed GML storage schema.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.4
• /
• pp.376-388
• /
• 2002

Recently, although there are strong requirements to manage multimedia data, there are a few researches on efficient storage and retrieval of multimedia data. In this paper, we design an object storage engine which can store and retrieve various multimedia objects efficiently. For this, we design an object manager for storing a variety of multimedia data and an inverted file manager for indexing unformatted text objects. In addition, we implement the objects storage engine which can support concurrency control and recovery schemes of DBMS by integrating the object manager and the inverted file manager with the SHORE low-level storage system. Finally, we develope a TIROS(Thesis Information Retrieval using Object Storage engine) system in order to verify the usefulness of our object storage engine.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.3
• /
• pp.171-180
• /
• 2009

Slowly, but surely, we are seeing the emergence of a variety of embedded systems that are employing Storage Class RAM (SCRAM) such as FeRAM, MRAM and PRAM, SCRAM not only has DRAM-characteristic, that is, random byte-unit access capability, but also Disk-characteristic, that is, non-volatility. In this paper, we propose a new software architecture that allows SCRAM to be used both for main memory and for secondary storage simultaneously- The proposed software architecture has two core modules, one is a SCRAM driver and the other is a SCRAM manager. The SCRAM driver takes care of SCRAM directly and exports low level interfaces required for upper layer software modules including traditional file systems, buddy systems and our SCRAM manager. The SCRAM manager treats file objects and memory objects as a single object and deals with them in a unified way so that they can be interchanged without copy overheads. Experiments conducted on real embedded board with FeRAM have shown that the SCRAM driver indeed supports both the traditional F AT file system and buddy system seamlessly. The results also have revealed that the SCRAM manager makes effective use of both characteristics of SCRAM and performs an order of magnitude better than the traditional file system and buddy system.

• Journal of Korea Multimedia Society
• /
• v.12 no.12
• /
• pp.1710-1717
• /
• 2009

Flash memory has become the most important storage media in mobile devices along with its attractive features such as low power consumption, small size, light weight, and shock resistance. However, a flash memory can not be written before erased because of its erase-before-write characteristic, which lead to some garbage collection when there is not enough space to use. In this paper, we propose a novel garbage collection scheme, called block-level buffer garbage collection. When it is need to do merge operation during garbage collection, the proposed scheme does not merge the data block and corresponding log block but also search the block-level buffer to find the corresponding block which will be written to flash memory in the next future, and then decide whether merge it in advance or not. Our experimental results show that the proposed technique improves the flash performance up to 4.6% by reducing the unnecessary block erase numbers and page copy numbers.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.10
• /
• pp.91-97
• /
• 2015

In this paper, we propose a MCFQ I/O scheduler that is implemented by modifying the existing Linux CFQ I/O scheduler. MCFQ observes whether the user requested I/O bandwidth weight is well distributed. Based on the I/O bandwidth observation, we improved I/O performance of the existing bandwidth distribution ability by dynamically controlling the I/O time-slice of the virtual machine. The use of SSDs as storage has been increasing dramatically in recent computer systems due to their fast performance and low power usage. As the usage of SSD increases and prices fall, virtualized system administrators can take advantage of SSDs. However, studies on guaranteeing SLA(Service Level Agreement) services when multiple virtual machines share the SSD is still incomplete. In this paper was conducted to improve performance of the bandwidth distribution when multiple virtual machine are sharing a single SSD storage in a virtualized environment. In particular, it was observed that the performance of the bandwidth distribution varied widely when garbage collection occurs in the SSD. In order to reduce performance variance, we add a MoTS(Manager of Time Slice) on existing CFQ I/O scheduler.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.38 no.1
• /
• pp.26-45
• /
• 2001

The Flash memory market: is an exciting market that has quickly over the last 10 years. Recently Flash memory provides a high-density. truly non-volatile, high performance read write memory solutions, also is characterized by low power consumption, extreme ruggedness and high reliability. Flash memory is an optimum solution for large nonvolitilc storage operations such as solid file storage, digital video recorder, digital still camera, The MP3 player and other portable multimedia communication applications requiring non-volatility. Regardless of the type of Flash memory, Flash media management software is always required to manage the larger Flash memory block partitions. This is true, since Flash memory cannot be erased on the byte level common to memory, but must be erased on a block granularity. The management of a Flash memory manager requires a keen understanding of a Flash technology and data management methods. Though Flash memory's write performance is relatively slow, the suggested algorithm offers a higher maximum write performance. Algorithms so far developed is not suitable for applications which is requiring more fast and frequent accesses. But, the proposed algorithm is focused on the justifiable operation even in the circumstance of fast and frequent accesses.