• Proceedings of the Korea Contents Association Conference
• /
• 2003.05a
• /
• pp.356-360
• /
• 2003

There have been many considerations to develop new content services that integrate a variety of contents databases being already constructed and then produce new content services which are more valuable than existing services in many applications such as Internet portal, EC, and CRM. By doing the above thing, the burden of searching databases to access interesting databases and service applications can be reduced and the database availability of users is also enhanced through a single view integrating multiple contents database. This paper presents implementation details of the query processing system that is a core component of the database integration system, which can construct a virtual database that integrates databases being managed by multiple heterogeneous database systems using XML data model and support a quay facility on the integrated database.

• Journal of Biosystems Engineering
• /
• v.28 no.1
• /
• pp.59-64
• /
• 2003

This study was carried out to develop database system using internet fur greenhouse. The database system consisted of group monitor, client monitor. server monitor and DBMS. The results of the study are summarized as follows. 1. The monitoring module, as data collection system for database. could monitor the state of the control device and the greenhouse environment. 2 The group monitor was connected to the house monitors by RS-485 communication method. Data received by the group monitor were sent to the server monitor and then stored in database server by TCP/IP and MIDAS. 3. The data of database consisted of on growing environment. control devices, operation and cultivation data in greenhouse. It was developed using MS-SQL server. 4. Remote monitoring of greenhouse was realized in a client/server environment. The client module. which was named as the client monitor. made requests to access the measurement data of greenhouse through the remote data module of the server monitor in internet environment.

• Proceedings of the Korean Society for Emotion and Sensibility Conference
• /
• 2000.04a
• /
• pp.120-125
• /
• 2000

We propose a semi-automatic and dynamic indexing algorithm for multi-media database(e.g. movie files, audio files), which are difficult to create indexes expressing their emotional or abstract contents, according to user's sensitivity by using user's histories of access to database. In this algorithm, we simply categorize data at first, create a vector space of each user's interest(user model) from the history of which categories the data belong to, and create vector space of each data(title model) from the history of which users the data had been accessed from. By continuing the above method, we could create suitable indexes, which show emotional content of each data. In this paper, we define the recurrence formulas based on the proposed algorithm. We also show the effectiveness of the algorithm by simulation result.

• International journal of advanced smart convergence
• /
• v.9 no.3
• /
• pp.239-245
• /
• 2020

The Ewha Music Database (EMDB) is an online database comprised of primary source materials related to music education from East Asia during the modern era (1880 to 1945) when Korea, Japan, and China were geopolitically and culturally intertwined. We developed the incipit search in EMDB as an embedded tool. This is the first attempt in Korea to implement a unique search function of musical data using alphabets of musical notes. Unlike in traditional search system that uses general literature information search conditions, such as author, title, publisher, year, number of pages, etc., it offers a new way of searching a musical piece/work and sheet music. This study confirms that digital information technology is an important methodology for research of music culture as a field of humanities.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.569-572
• /
• 1998

In this paper, we devised pulse rate diagnosis for provide basic index of cold-hot diagnosis. The system consist of database part and pulse rate detection part for detection pulse wave, respiration and ECG. The database is constructed windwos95 platform using DAO(data access object). Search algorithm used ISAM algorithm. The database consist of one's information and medical report for a subject and detected pulse wave.

• Convergence Security Journal
• /
• v.2 no.2
• /
• pp.209-216
• /
• 2002

This treatise deals with designing a database encryption model that interworks with Intranet within a system. Today attempts are being made to substitute legacy client/server computing environment with what interworks with web and database, and thus the question how the security for the database that interworks with Intranet can be secured is emerging as a matter of great importance. This treatise, therefore, offers an encryption model which offers how to create an encryption key using an ID and a password most widely used in Intranet access and by using this key, how to encipher information ill a DB table, providing a maintenance scheme for the Key as well.

• Proceedings of the KSRS Conference
• /
• 2008.10a
• /
• pp.398-401
• /
• 2008

With the advance of internet and computer processing technique, users can easily access and use the multimedia contents involving the various pictures, videos and audios information. And users request more convenient and accurate multimedia services. In these environments, it is difficulties to integrate and manage metadata standards because there are various standards in multimedia applications according to types of services and data formats individually. In this paper, we design and implement the multimedia metadata management system for integrating from heterogeneous sources. In our system, we managed heterogeneous metadata by integrating to unified schema using mapping table. Through proposed system, users can search multimedia data easily without considering variety of application services.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.04a
• /
• pp.31-34
• /
• 2002

최근 많은 웹 기반 서비스나 애플리케이션들이 XML 형태로 지원되면서 XML 데이터의 보안에 대해서 많은 연구가 이루어지고 있다. 기존의 XML 보안은 암호, 서명, 접근제어의 형태로 이루어지고 있으며 그 중에서 접근제어는 DTD기반과 문서기반으로 분류되어 임의적 접근제어 모델을 적용한 연구가 진행되어 왔다. 그러나 DTD의 대안으로서 객체지향개념을 수용하는 XML 스키마의 사용이 증가되고 있어 이를 위한 보안요구사항과 접근제어정책이 추가로 필요하게 되었다. XML문서의 데이터보호를 위해서 기존의 DTD기반과 문서기반 접근제어정책을 수용하면서 스키마 기반의 접근제어정책을 지원하기 위해서 이 논문에서는 역할기반접근제어 모델을 적용한 XML 스키마 기반의 접근제어 모델을 제안한다.

• Journal of Communications and Networks
• /
• v.16 no.4
• /
• pp.430-435
• /
• 2014

The performance of a distributed database system depends particularly on the site-allocation of the fragments. Queries access different fragments among the sites, and an originating site exists for each query. A data allocation algorithm should distribute the fragments to minimize the transfer and settlement costs of executing the query plans. The primary cost for a data allocation algorithm is the cost of the data transmission across the network. The data allocation problem in a distributed database is NP-complete, and scalable evolutionary algorithms were developed to minimize the execution costs of the query plans. In this paper, quadratic assignment problem heuristics were designed and implemented for the data allocation problem. The proposed algorithms find near-optimal solutions for the data allocation problem. In addition to the fast ant colony, robust tabu search, and genetic algorithm solutions to this problem, we propose a fast and scalable hybrid genetic multi-start tabu search algorithm that outperforms the other well-known heuristics in terms of execution time and solution quality.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10b
• /
• pp.43-45
• /
• 2003

Nowadays, with numerous emerging applications (e.g., traffic control, meteorology monitoring, mobile computing, etc.), access methods to process current and future queries for moving objects are becoming increasingly important. Among these methods, the time-parameterized R-tree (TPR-tree) seems likely the most flexible method in one, two, or three-dimensional space. A key point of TPR-tree is that the (conservative) bounding rectangles are expressed by functions of time. In this paper, we propose a new method, which takes into account positions of its moving objects against the rectangle's bounds. In proposed method, the size of bounding rectangle is significantly smaller than the traditional bounding rectangle in many cases. By this approach, we believe that the TPR-tree can improve query performance considerably.