• Journal of KIISE:Databases
• /
• v.30 no.6
• /
• pp.641-650
• /
• 2003

The eXtensible Markup Language(XML) is emerging as a standard format of data representation and exchange on the Internet. There have been researches about storing and retrieving XML documents using the relational database which has techniques in full growth about large data processing, recovery, concurrency control and so on. Since in previous systems same structure information and fundamental operation are used for processing of various kinds of XML queries, only some specific query can be efficiently processed not all types of query. In this paper, we propose a flexible query processing system. To process query efficiently, the proposed system analyzes regular path expression queries, and uses $\theta$-join operation using region numbering values to check ancestor-descendent relationship and equi-join operation using parent's region start value to check parent-child relationship. Thus, the proposed system processes efficiently XML regular path expressions. From the experimental results, we show that proposed XML query processing system is more efficient than previous systems.

• Journal of KIISE:Databases
• /
• v.35 no.3
• /
• pp.286-295
• /
• 2008

Multimedia consumer electronics(CE) devices, such as MP3 players, PMPs, and digital cameras, are electronic equipments used to record, play or create multimedia data. Most multimedia CE devices provide uses with the ability to search multimedia stored in the device and browse the search results. One of the unique requirements in multimedia CE devices is that the search results displayed in the screen must be restored quickly when the device powers off and later back on. For this purpose, the existing methods (1) re-execute the original search query, and (2) move the cursor to the original position in the search results. However, this approach may be inefficient when the number of records in the result set is large. In this paper, we propose an efficient method for multimedia CE devices that can quickly restore the search results displayed in the screen when the device powers off and later back on. The proposed method can retrieve the original search results in the screen quickly by saving and loading some information about the query evaluation plan. Though the performance evaluation, we show that the proposed method provides excellent performance regardless of the number of records in tile result set or the original cursor position.

• Journal of KIISE:Databases
• /
• v.30 no.1
• /
• pp.80-94
• /
• 2003

In this paper. we propose an enhanced concurrency control algorithm that minimizes the query delay efficiently. The factors that delay search operations and deteriorate the concurrency of index structures are node splits and MBR updates in multi dimensional index structures. In our algorithm, to reduce the query delay by split operations, we optimize exclusive latching time on a split node. It holds exclusive latches not during whole split time but only during physical node split time that occupies small part of whole split time. Also to avoid the query delay by MBR updates we introduce partial lock coupling(PLC) technique. The PLC technique increases concurrency by using lock coupling only in case of MBR shrinking operations that are less frequent than MBR expansion operations. For performance evaluation, we implement the proposed algorithm and one of the existing link technique-based algorithms on MIDAS-III that is a storage system of a BADA-III DBMS. We show through various experiments that our proposed algorithm outperforms the existing algorithm In terms of throughput and response time.

• The Journal of the Korea Contents Association
• /
• v.12 no.7
• /
• pp.21-28
• /
• 2012

The data centric storage (DCS) scheme is one of representative methods to efficiently store and maintain data generated in wireless sensor networks. In the DCS schemes, each node has the specified data range for storing data. This feature is highly vulnerable to the faults of nodes. In this paper, we propose a new recovery scheme for the lost data caused by the faults of nodes in DCS environments. The proposed scheme improves the accuracy of query results by recovering the lost data using the spatial continuity of physical data. To show the superiority of our proposed scheme, we simulate it in the DCS environments with the faults of nodes. In the result, our proposed scheme improves the accuracy by about 28% through about 2.5% additional energy consumption over the existing scheme.

• Journal of KIISE:Databases
• /
• v.27 no.2
• /
• pp.216-226
• /
• 2000

This paper suggests a new access path, hashed B-tree which is an efficient access method for integrity checking. Hashed B-tree is based on the observation that most query patterns in enforcing integrity constraints are point queries. Hashed B-tree compresses the key by hashing procedure, which reduces the height of tree and results in fast node search. This method has the advantages such as it can be implemented easily and use the B-tree concurrency control and recovery algorithm with minor modifications.

• International Journal of Computer Science & Network Security
• /
• v.23 no.5
• /
• pp.33-40
• /
• 2023

The mainstay of current image recovery frameworks is Content-Based Image Retrieval (CBIR). The most distinctive retrieval method involves the submission of an image query, after which the system extracts visual characteristics such as shape, color, and texture from the images. Most of the techniques use RGB color space to extract and classify images as it is the default color space of the images when those techniques fail to change the color space of the images. To determine the most effective color space for retrieving images, this research discusses the transformation of RGB to different color spaces, feature extraction, and usage of Convolutional Neural Networks for retrieval.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2022.07a
• /
• pp.275-278
• /
• 2022

본 고는 일상생활 속 다양한 정보들을 제공하는 웹 사이트를 데이터베이스와 연계하여 제작하는 프로젝트를 소개한다. 해당 프로젝트는 코로나19 거리두기 완화 조치에 따라 학교에 익숙하지 못한 학생들에게 학교 주변 시설에 대하여 실용적이며 활용성 높은 정보를 제공하기 위한 웹 사이트를 제작한다. 해당 웹 사이트는 웹 사용자의 편의를 위한 콘텐츠 추가, 점진적인 제공 정보 확대가 예정되어 있어 코로나19 일상생활 회복에 도움이 될 것으로 기대된다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1994.04a
• /
• pp.49-57
• /
• 1994

진정한 의미의 다운사이징을 구현하기 위해서는 필요한 분산데이타베이스의 구현은 현재 여러가지 기술적인 문제점들을 안고 있다. 따라서 동시성 제어(concurrency control)와 갱신 (update propagation), 복구(recovery), 질의어 처리(query processing), 카달로그 관리(catalog management)등과 같은 분산 환경에서의 데이타베이스에 관련된 기술적인 문제점들을 해결하기 위해서는 어떠한 최적의 방법들을 개발해야만 한다. 이러한 방법들의 개발은 관계형 데이타베이스의 데이타관리 분류체계를 통한 대안들의 선택과 운용에 의해 가능할 것이다. 분산 환경하에서 사용되어질 수 있는 관계형 데이타베이스의 데이타관리 분류체계를 availability, expression, currency의 관점에서 Basic table과 view로 구분하여 정립해 보았다. Basic table은 current update가 필수적이므로 availability와 expression의 관점에서 분류하였고, view는 physical file의 존재성 유무와 시간적 실행의 차이를 기준으로 분류하였다. 그리고 이러한 분류기준에 따른 특성들을 분산데이타베이스 구축에 이용하는 방법들에 대해 이야기 하였다. 다시 말해 non-current materialized view 뿐만 아니라 current materialized view를 동시에 지원하는 하나의 distributed view update architecture를 개발하는 것에 대해 하나의 방법으로 제시하였다. 즉 immediate update와 deferred update는 current view를 이용하고 periodical update는 non-current view를 이용하여 100%의 distributed data resources를 관리 할 수 있는 효율적인 distributed system를 개발하는 것을 제시하였다. 본 논문은 데이타베이스론의 입장에서 아직 정립되어 있지 않은 분산 환경하에서의 관계형 데이타베이스의 데이타관리의 분류체계를 나름대로 정립하였다는데 그 의의가 있다. 또한 이것의 응용은 현재 분산데이타베이스 구축에 있어 나타나는 기술적인 문제점들을 어느정도 보완할 수 있다는 점에서 그 중요성이 있다.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1739-1752
• /
• 1996

Software reengineering involves improving the software maintenance process and improving existing systems by applying new technologies and software tools. Software reengineering can help us understand existing systems and discover software components that are common across systems. In the paper, we discuss the program analysis and environment to assist reengineering. Program analysis takesan existing program as input and generates information about structured part and object-oriented part. It is used to restructure the information by extracting code through reengineering methodology. These restructuring informations with object-oriented archilccture are mapping prolog form to query by using direct reation and summary relation.