• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.619-621
• /
• 2001

현재 JDBC를 통한 웹 어플리케이션의 제작은 데이터베이스 커넥션에 대한 관리 기능의 부재, 다중 데이터베이스에 대한 효율적인 접근 방법의 부재, 예외 처리(try…catch) 구문의 부담, 질의 결과(ResultSet)에 대한 subset을 처리 방법의 어려움이 존재하는 JDBC의 한계로 인해 개발에의 상당한 까다로움과 고려해야 할 사항이 다수 존재한다. 본 논문에서는 이러한 어려움을 해결함과 동시에 개발비용과 개발 시간을 단축하고 사용자 요구에의 응답 시간을 최소화할 수 있는 데이터베이스 connectivity를 위한 컴포넌트를 설계하고 그것을 구현한다. 본 컴포넌트는 다중 데이터베이스를 지원하고, 데이터베이스에 대한 커넥션을 관리하며 JDBC 드라이버의 등록과 로딩을 관장하며, 예외 상황을 내부적으로 처리하고 ResultSet을 효율적으로 다룰 수 있는 기능 및 다중 생성자 권한으로 관련 테이블에의 접근 용이성을 제공한다. 본 컴포넌트를 이용한 웹 어플리케이션을 제작에 필요한 코드의 양은 그렇지 않았을 때에 비해서 약 30%의 절감 효과가 있다. 더불어, 디버깅에 필요한 시간을 최소화 할 수 있어 개발해서 약 30%의 절감 효과가 있다. 더불어, 디버깅에 필요한 시간을 최소화 할 수 있어 개발 기간을 약 2/3 수준으로 단축할 수 있으며 시스템 성능 향상에 도움을 준다. 이것은 실제 프로젝트(한국통신 웹사이트-www.kt.co.kr-, 존슨앤존슨 웹사이트-www.cleanandclear.co.kr-)를 통해 검증되었다.

• Annual Conference on Human and Language Technology
• /
• 2022.10a
• /
• pp.491-496
• /
• 2022

최근 멀티-세션 데이터로 장기간 페르소나와 대화 일관성을 유지하며 인터넷에서 대화와 관련된 지식을 활용하는 대화모델 연구가 활발히 진행되고 있다. 하지만 이를 위한 한국어 멀티-세션 오픈 도메인 지식 기반 대화 데이터는 공개되지 않아 한국어 대화모델 연구에 어려움이 있다. 따라서 본 논문에서는 한국어 멀티-세션 오픈 도메인 지식 기반 데이터의 필요성을 시사하고, 데이터 수집을 위한 툴을 제안한다. 제안하는 수집 툴은 양질의 데이터 수집을 위해 작업자들이 사용하기 편하도록 UI/UX를 구성하였으며, 대화 생성 시 텍스트뿐만 아니라 정보가 밀집된 테이블도 대화에 활용할 지식으로 참조할 수 있도록 구현하였다. 제안하는 수집 툴은 웹 랜덤채팅 시스템에 기반을 두어 작업자가 여러 다른 작업자와 같은 확률로 매칭되게 구현되었으며, 일정 확률로 기존 대화로부터 대화를 시작하도록 함으로써 멀티-세션 대화 수집이 가능하도록 하였다.

• Journal of KIISE:Databases
• /
• v.35 no.3
• /
• pp.231-242
• /
• 2008

W3C has selected OWL as a standard for Web ontology description and a necessity of research on storage models that can store OWL ontologies effectively has been issued. Until now, relational model-based storage systems such as Jena, Sesame, and DLDB, have been developed, but there still remain several issues. Especially, they lead inefficient query processing performance. The structural problems of their low query processing performance are as follow: Jena has a simple structure which is not normalized and also stores most information in a single table. It exponentially decreases the performance because of comparison with unnecessary information for processing queries requiring join operations as well as simple search. The structures of storages(e.g., Sesame) have been completely normalized. Therefore it executes many join operations for query processing. The storages require many join operations to find simply a specific class. This paper proposes a storage model to resolve the problems that the query processing performance is decreased because of non-normalization or complete normalization of the existing storages. To achieve this goal, we analyze the problems of existing storage models as well as relations of OWL elements and query patterns. The proposed model, defined with the analysis results, provides an optimal normalized structure to minimize join operations or unnecessary information comparison. For the experiment of query processing performance, a LUBM data sets are used and query patterns are defined considering search targets and their hierarchical relations. In addition, this paper conducts experiments on correctness and completeness of query results to verify data loss of the proposed model, and the results are described. With the comparative evaluation results, our proposal showed a better performance than the existing storage models.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.1
• /
• pp.119-127
• /
• 2018

The formal data used in the business is managed in a table form without normalization due to lack of understanding and application of data modeling. If the balance of the database design is destroyed, it affects the speed of response to the data query, and the data obesity becomes high. In this paper, it is investigated how data obesity improved through database design through optimized data modeling. The data query path was clearly visualized by square design through data modeling based on the relationship between object (data) and object, from the radial and task - oriented isolation design where data obesity is excessive. In terms of data obesity, the obesity degree of the current research support database was 57.2%, but it was 16.2% in the new research support database, and the data obesity degree was reducd by 40.5%. In addition, by minimizing redundancy of data, the database has been improved to ensure the accuracy and integrity of the data.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2273-2286
• /
• 2000

In order to acquire the precise and fast response for an analytical query, proper selection of the views to materialize in data warehouse is very crucial. In traditional view selection algorithms, the whole relations are considered to be selected as materialized views. However, materializing the whole relations rather than a part of relations results in much worse performance in terms of time and space cost. Therefore, we present an improved algorithm for selection of views to materialize using clustering method to overcome the problem resulted from conventional view selection algorithms. In the presented algorithm, ASVMRT(Algorithm for Selection of Views to daterialize using Iteduced Table). we first generate reduced tables in clata warehouse using automatic clustering based on attrihute-values density, then we consider the combination of reduced tables as materialized views instead of the combination of the original hase relations. For the justification of the proposecl algorithm. we show the experimental results in which both time and space cost are approximately 1.8 times better than the conventional algorithms.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.3
• /
• pp.33-40
• /
• 2012

Recently, to enhance the quality and efficiency of health care services, smart health care services utilizing a smart phone and tablet pc are mainly being introduced into the large hospital and the interest for personal health record service which manages personal medical information utilizing PC and smart phone and technology development is actively underway. In order to build a next generation hospital information systems, the interoperability of data between the different hospital information systems and UX consistency between the various user devices must be assured. Therefore, in this paper, medical information standard and the study for improving the performance is conducted to design the gateway system which converting and integrating the medical information under multi-platform environment. In this paper, CCR standard is adapted to the mapping method between the data which is the key feature of the gateway system and design the system utilizing multi-table-based mapping method. To evaluate the performance of the system, experiment was done and the result has been improved approximately 20 percent for response rate.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.04a
• /
• pp.28-35
• /
• 2000

In order to acquire the precise and fast response for an analytical query, proper selection of the views to materialize in data warehouse is very crucial. In traditional algorithms, the whole relation is considered to be selected as materialized views. However, materializing the whole relation rather than a part of relation results in much worse performance in terms of time and space cost. Therefore, we present a new algorithm for selection of views to materialize using clustering method in order to improve the performance of data warehouse including this problem. In the presented algorithm, ASVMR(Algorithm for Selection of Views to Materialize using Reduced table), we first generate reduced tables in data warehouse using automatic clustering based on attribute-values density, then we consider the combination of reduced tables as materialized views instead of the combination of the original base relations. We also show the experimental results in which both time and space cost are approximately 1.8 times better than the conventional algorithms.

• Journal of Korea Multimedia Society
• /
• v.12 no.10
• /
• pp.1386-1396
• /
• 2009

Most decision support functions of spatial data warehouse rely on the OLAP operations upon a spatial cube. Meanwhile, higher performance is always guaranteed by indexing the cube, which stores huge amount of pre-aggregated information. Hierarchical Dwarf was proposed as a solution, which can be taken as an extension of the Dwarf, a compressed index for cube structures. However, it does not consider the spatial dimension and even aggregates incorrectly if there are redundant values at the lower levels. OLAP-favored Searching was proposed as a spatial hierarchy based OLAP operation, which employs the advantages of R-tree. Although it supports aggregating functions well against specified areas, it ignores the operations on the spatial dimensions. In this paper, an indexing approach, which aims at utilizing the concept hierarchy of the spatial cube for decision support, is proposed. The index consists of concept hierarchy trees of all dimensions, which are linked according to the tuples stored in the fact table. It saves storage cost by preventing identical trees from being created redundantly. Also, it reduces the OLAP operation cost by integrating the spatial and aspatial dimensions in the virtual concept hierarchy.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.2 s.17
• /
• pp.91-107
• /
• 2006

To handling the extreme situation that must manage positional information of a very large volume, at least millions of moving objects. A cluster-based sealable distributed computing system architecture, called the GALIS which consists of multiple data processors, each dedicated to keeping records relevant to a different geographical zone and a different time zone, was proposed. In this paper, we proposed a valid time management and time-zone shifting scheme, which are essential in realizing the long-term location data subsystem of GALIS, but missed in our previous prototype development. We explain how to manage valid time of moving objects to avoid ambiguity of location information. We also describe time-zone shifting algorithm with three variations, such as Real Time-Time Zone Shifting, Batch-Time Zone Shifting, Table Partitioned Batch-Time Zone Shifting, Through experiments related with query processing time and CPU utilization, we show the efficiency of the proposed time-zone shifting schemes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.11
• /
• pp.2052-2060
• /
• 2017

The SOLAS ship should carry at least 83 different types of equipment based on the SFI group codes and each of which consists of several to dozens of components. During ship operation, it is necessary to ensure the normal operation of such equipment, and remote maintenance is highly demanded for immediate repair in the event of a equipment fault. This study proposes to find suitable classification system and to derive database structure for remote maintenance of navigation and communication equipment. As a result of this study, the classification system of equipment should be layered into equipment type, model, and component, and main table in the database consists of FMEA, service history, case data through Q&A, Preventive Maintenance. A database was constructed for 140 navigation and communication equipment models and 750 components. In order to evaluate the practical effects, service engineer evaluated the usefulness using the cloud app.