• Journal of Korea Multimedia Society
• /
• v.7 no.1
• /
• pp.1-11
• /
• 2004

In this paper. we propose a storage system for XML documents using relational databases. Additional processing is required to store XML documents in the relational databases due to the discrepancy between XML structures and relational schema. This study aims to store XML documents with DTD in the relational databases. We propose the association inlining that exploits shred inlining and hybrid inlining and avoids relation fragments and excessive joins. Experiments show some improvements in the performance with the proposed method. The information of the storage structures is extracted from the simplified DTD. Existing map classes are extended in order to map various structures of XML to relational schema. Map classes are defined for various structures such as elements with multiple values, elements with multiple super elements, and elements with recursive structures through analyzing XML documents. Map files that are XML structures and used in generating SQL statements are created by using the extracted information of storage structures and map classes.

• Journal of Korea Multimedia Society
• /
• v.5 no.3
• /
• pp.281-289
• /
• 2002

Few studies have been systematically pursued on a multimedia data mining in despite of the over-whelming amounts of multimedia data by the development of computer capacity, storage technology and Internet. Based on the preliminary image processing and content-based image retrieval technology, this paper presents the methods for discovering association rules from recurrent items with spatial relationships in huge data repositories. Furthermore, multimedia mining algorithm is proposed to find implicit association rules among objects of which content-based descriptors such as color, texture, shape and etc. are recurrent and of which descriptors have spatial relationships. The algorithm with recurrent items in images shows high efficiency to find set of frequent items as compared to the Apriori algorithm. The multimedia association-rules algorithm is specially effective when the collection of images is homogeneous and it can be applied to many multimedia-related application fields.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.1
• /
• pp.101-108
• /
• 2004

As the dependency to network system and demands of efficient storage systems rapidly grows in every networking filed, the current trends initiated by explosive networked data grow due to the wide-spread of internet multimedia data and internet requires a paradigm shift from computing-centric to data-centric in storagesystems. Furthermore, the new environment of file systems such as NAS(Network Attached Storage) and SAN(Storage Area Network) is adopted to the existing storage paradigm for Providing high availability and efficient data access. We describe the design issues and system components of SANiqueTM, which is the cluster file system based on SAN environment. SANiqueTM has the capability of transferring the user data from the network-attached SAN disk to client applications directly We, especially, present the protocol and functionality of the global buffer manager in our cluster file system.

• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.6
• /
• pp.674-685
• /
• 1999

MIDAS-II는 한국전자통신연구원에서 개발한 바다 DBMS의 저장 시스템이다. MIDAS-II 볼륨은 데이터의 논리적 저장 단위인 파일을 저장하는 영역을 가리킨다. 본 논문에서는, MIDAS-II가 대용량 멀티미디어 데이터 서버의 저장 시스템으로 기능하도록 광 디스크 쥬크박스 또는 테이프 라이브러리와 같이 복수 개의 저장 매체 (platter , 예를 들어 디스크 또는 카트리지 테이프)로 구성된 Tera 바이트 급의 3창 저장 장치를 장착할 경우 이를 위한 볼륨 구조의 설계 및 구현에 대해 기술한다. 본 논문에서 제안하는 볼륨 구조는 3차 저장 장치 접근 시 성능 제고를 위하여 디스크 캐쉬 영역을 두고 있으며, 3차 저장 장치의 저장 매체별 관리 기능을 제공한다. Abstract MIDAS-II is the storage systemfor BADA DBMS developed at ETRI. A volume of MIDAS-II is the area where the files, the logical unit for storing data, are stored. This paaper describes the design and implementation of a new MIDAS-II volume structure for the tertiary storage device such as an optical disk juke box or a tape library equipped with multiple platters(disks or cartridge tapes, for example ). Incorporating thetertirary storage device of the order of tera bytes into MIDAS-II enables it to function as a storage system for a massive amount fo multimedia eata server. The volume structure for the tertiary storage device proposed in this paper features disk caching for performing improvement and direct control of theindividual platter.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.855-858
• /
• 1998

Nowadays it is possible to make realization of Multimedia service by virtue of developing computer hardware technique and high-bandwidth network. But Multimedia service has some problems. Its file need large storage. Above all, Analog CCTV used in recent has been utilized for various purpose in ban, company and public institution, but this has many defects such as management, low resolution, and etc. To overcome this problems, multimedia component-file-have to be reduced in size. This paper proposes adaptive MPEG-1 video to reduce file size. The method in this paper is realized that according to movement variation, file size is reduced by adaptively making use of MQuant.

• The Journal of Society for e-Business Studies
• /
• v.1 no.1
• /
• pp.159-171
• /
• 1996

Nowadays, multimedia and Hypermedia become hot topics in information industry. Due to high capacity of media storage and fast communication network, it is possible to exchange text data as well as image, moving picture and voice. Especially to apply hypermedia under CALS standard environment, the relation between international standard and CALS standard needs to be considered. This study introduces conceptual background and processing model of HyTime (Hypermedia Time-based Structuring Language) which is a specification of hypermedia exchange, Hyper ODA (Hyper Open Document Architecture) which is a major multimedia communication basis, MMCF (Multimedia Communication Forum), AHM(Amsterdam Hypermedia Model), and DSRM(DAVIC System Reference Model) reference model which helps determination of hypermedia communication specification Although they are international standard, provisional standard or non-standard, it discusses the Possibility of adopting them as CALS standard. Hence, this paper chooses the best recommend for CALS among these models.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.8
• /
• pp.1176-1189
• /
• 1993

This paper presents the Multiple Keyword Retrieval Method under the Object-Oriented Multimedia Database Model. The multiple keyword registration and retrieval algorithms are developed to reduce the partial matching problem in multimedia data retrieval. For this, proper storage structures of the lookup tables are designed. And also, in order to maintain the constant retrieval time, media data files are organized with B+ tree structure.

• Journal of Information Processing Systems
• /
• v.6 no.3
• /
• pp.359-374
• /
• 2010

The Future Internet that includes Real World Objects and the Internet of Things together with the more classic web pages will move communications from a nodecentric organization to an information-centric network allowing new a paradigm to take place. The 4WARD project initiated some works on the Future Internet. One of them is the creation of a Network of Information designed to enable more powerful semantic searches. In this paper, we propose a security solution for a model of information based on a semantic description and search of objects. The proposed solution takes into account both the access and the management of both objects and their descriptions.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.04a
• /
• pp.118-120
• /
• 2015

현재, 급격한 IT 기술 발전의 산물인 스마트 디바이스에서 발생되는 데이터의 양이 기하급수적으로 증가함에 따라 효율적으로 저장하기 위한 다양한 연구 및 기술 개발이 진행되고 있다. 이 중에 Desktop Storage Virtualization(DSV)은 비가용 데스크톱 스토리지 자원을 하나의 통합된 스토리지로 만들고 이를 스토리지 사용자 니즈에 따라 스토리지를 제공한다. DSV는 분산된 데스크탑의 비가용 자원을 통합함에 따라 신뢰성이 매우 중요시된다. 그러나 DSV 환경에서 산발적 서버다운 및 기타 장애시 대응체계가 미흡하다. 본 논문에서는 이러한 상황을 고려한 Server Selection Algorithm(SSA)를 제시한다. SSA는 서버 장애 발생시 대체 서버를 분산된 데스크탑이 적응적 인지 및 서버를 변경함으로써 고가용성을 제공한다.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.6 no.6
• /
• pp.345-359
• /
• 2011

In high performance embedded systems, the use of multiple on-chip memories is an essential architectural feature for exploiting inherent parallelism in multimedia applications. This feature allows multiple data accesses to be executed in parallel. However, it remains difficult to effectively exploit of multiple on-chip memories. The successful use of this architecture strongly depends on how to efficiently detect and exploit memory parallelism in target applications. In this paper, we propose a technique based on a linear array access descriptor [1], which is generated from profiled data, to detect and exploit memory parallelism. The proposed technique tackles an array reorganization problem to maximize memory parallelism in multimedia applications. We present preliminary experiments applying the proposed technique onto a representative coarse grained reconfigurable array processor (CGRA) with multimedia kernel codes. Our experimental results demonstrate that our technique optimizes data placement by putting independent data on separate storage. The results exhibit 9.8% higher performance on average compared to the existing method.