• Proceedings of the Korea Database Society Conference
• /
• 1999.06a
• /
• pp.393-402
• /
• 1999

과거와 다르게 최근의 병원들은 정보화로 인해서 상당한 양의 의료 데이터가 저장되어 있어서 이의 효과적인 이용에 관심을 가지고 있다. 그러나 기존 통합병원정보시스템 (Integrated Hospital Information System)은 아직까지 일반관리와 원무관리 중심에서 벗어나지 못하고 있다. 품질 좋은 의료 서비스를 제공하기 위해서 환자 중심의 진료 및 진료지원, 임상연구 등을 종합적으로 지원하기 위한 데이터 웨어하우스 (Data Warehouse)의 필요성이 대두되기 시작했다. 이에 본 연구는 병원 전체 차원에서 데이터 웨어하우스의 아키텍쳐를 설계하고 개발하는 데 주안점을 두었다. 특히, 임상 데이터 웨어하우스 (Clinical Data Warehouse)에 초점을 두었으며 이에 대한 프로토타입은 J 병원에 적용되어서 개발되었다.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 1999.03a
• /
• pp.393-402
• /
• 1999

과거와 다르게 최근의 병원들은 정보화로 인해서 상당한 양의 의료 데이터가 저장되어 있어서 이의 효과적인 이용에 관심을 가지고 있다. 그러나 기존 통합병원정보시스템(Integrated Hospital Information System)은 아직까지 일반관리와 원무관리 중에서 벗어나지 못하고 있다. 품질 좋은 의료 서비스를 제공하기 위해서 환자 중심의 진료 및 진료지원, 임상연구 등을 종합적으로 지원하기 위한 데이터 웨어하우스(Data Warehouse)의 필요성이 대두되기 시작했다. 이에 본 연구는 병원 전체 차원에서 데이터 웨어하우스의 아키텍쳐를 설계하고 개발하는 데 주안점을 두었다. 특히, 임상 데이터 웨어하우스(Clinical Data Warehouse)에 초점을 두었으며 이에 대한 프로토타입은 J 병원에 적용되어서 개발되었다.

• Journal of Information Processing Systems
• /
• v.2 no.2
• /
• pp.67-75
• /
• 2006

In order to acquire a precise and quick response to an analytical query, proper selection of the views to materialize in the data warehouse is crucial. In traditional view selection algorithms, all relations are considered for selection as materialized views. However, materializing all relations rather than a part results in much worse performance in terms of time and space costs. Therefore, we present an improved algorithm for selection of views to materialize using the clustering method to overcome the problem resulting from conventional view selection algorithms. In the presented algorithm, ASVMRT (Algorithm for Selection of Views to Materialize using Reduced Table), we first generate reduced tables in the data warehouse using clustering based on attribute-values density, and then we consider the combination of reduced tables as materialized views instead of a combination of the original base relations. For the justification of the proposed algorithm, we reveal the experimental results in which both time and space costs are approximately 1.8 times better than conventional algorithms.

• IE interfaces
• /
• v.8 no.1
• /
• pp.61-78
• /
• 1995

Warehouse planning or design is not a static, one-time activity. To survive in the constantly changing market warehouse design should be a continuous process in which the anticipated requirment are reflected on the current warehouse status. Thus, the goal of warehouse management is to effectively utilize the various warehouse resources to meet the varying customer requirment. This paper presents an engineering framework for warehousing system analysis and design from the perspective of a total system approach. The complexity pertinent to warehousing system analysis and design is first discussed, which mainly come from the interplay among product data, order data, equipment types, operating strategies, and functional specification of the overall system. The understanding of the complexity leads to a general structure and a conceptual design procedure for a warehousing system. The general structure is comprehensive enough to represent most warehousing and flexible enough to accommodate the more sophisticated ones. The conceptual design procedure portrays the high-level interelationships the design issues.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.5
• /
• pp.225-233
• /
• 2007

This paper uses the taxonomy of 3 metadata schema(extraction metadata, warehouse, metadata, and user access metadata) to investigate how to manage metadata and what metadata to manage in data warehouse. In particular, this paper focuses on two kinds of metadata(warehouse metadata and user access metadata) and studies a case about metadata management in a real business world

• The KIPS Transactions:PartD
• /
• v.8D no.2
• /
• pp.117-124
• /
• 2001

A data mining system includes various data mining functions such as aggregation, association and classification, among others. To express these data mining function, a powerful data mining query language is needed. In addition, a graphic user interface(GUI) based on the data mining query language is needed for users. In addition, processing a data mining query targeted for a data warehouse, which is the appropriate data repository for decision making, is needed. In this paper, we first build a GUI to enable users to easily define data mining queries. We then propose a data mining query processing framework that can be used to process a data mining query targeted for a data warehouse. We also implement a schema generate a data warehouse schema that is needed to build a data warehouse. Lastly, we show the implementation details of a query processor that can process queries that discover association rules.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.2 s.40
• /
• pp.145-151
• /
• 2006

In conjunction with the rapid progress of IT(information technology) an increasing amount of data are being generated. The amount of new data is so big and the type of new data generated from clients or sensor devices needed to be in ubiquitous environment is so various that it is hard to manage and control them. Especially data to be occurred in ubiquitous environment are generated through PDA(personal digital assistant) smart phone, mobile device or sensor units etc. Therefore, to manage and control them generated from ubiquitous devices for decision making, we can use data warehouse as an integrated storage. A data warehouse integrates and aggregates data of several different DBMS into one DBMS. Also the updated data from source data have to be effectively propagated to the data warehouse. Therefore, in this paper, we proposed a mode) for an exact and efficient data management methodology in new IT paradigm environment, ubiquitous computing environment, to apply updated data on the warehouse to make decision. We also show brief result compared to conventional methodology.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8A
• /
• pp.1265-1272
• /
• 2000

A data warehouse is able to accommodate efficient data mining query processing and subsequent response by providing information needed for decision making. In such an environment, the data warehouse stores materialized view derived from various sources to enhance query processing. The compensating algorithm to maintain materialized view is well known for a single source site environment. In the compensating algorithm, several problems arise to get results in view maintenance. The problems are due to the overhead in query management within the data warehouse, increased complexity to manage queries in the warehouse as updates occur and increased volume of message traffic between the data source and the warehouse. In this paper, we propose a new algorithm that reduces the overhead in managing queries for new maintenance and that enhances the correctness. We also measured the performance of the new algorithm by evaluating the performance of the existing recomputing view and compensating algorithm and comparing the results with the proposed algorithm.

• Journal of Korea Spatial Information System Society
• /
• v.9 no.2
• /
• pp.81-91
• /
• 2007

In this paper, we have proposed the non-duplication loading method for supporting spatio-temporal analysis in spatial data warehouse. SDW(Spatial Data Warehouse) extracts spatial data from SDBMS that support various service of different machine. In proposed methods, it extracts updated parts of SDBMS that is participated to source in SDW. And it removes the duplicated data by spatial operation, then loads it by integrated forms. By this manner, it can support fast analysis operation for spatial data and reduce a waste of storage space. Proposed method loads spatial data by efficient form at application of analysis and prospect by time like spatial mining.

• Korean Journal of Computational Design and Engineering
• /
• v.12 no.1
• /
• pp.74-85
• /
• 2007

During the lifecycle of a nuclear power plant many organizations are involved in KOREA. Korea Plant Engineering Co. (KOPEC) participates in the design stage, Korea Hydraulic and Nuclear Power (KHNP) operates and manages all nuclear power plants in KOREA, Dusan Heavy Industries manufactures the main equipment, and a construction company constructs the plant. Even though each organization has a digital data management system inside and obtains a certain level of automation, data sharing among organizations is poor. KHNP gets drawing and technical specifications from KOPEC in the form of paper. It results in manual re-work of definition and there are potential errors in the process. A data warehouse based on a neutral model has been constructed in order to make an information bridge between design and O&M phases. GPM(generic product model), a data model from Hitachi, Japan is addressed and extended in this study. GPM has a similar architecture with ISO 15926 "life cycle data for process plant". The extension is oriented to nuclear power plants. This paper introduces some of implementation results: 1) 2D piping and instrument diagram (P&ID) and 3D CAD model exchanges and their visualization; 2) Interface between GPM-based data warehouse and KHNP ERP system.