• Journal of the Korea Society of Computer and Information
• /
• v.23 no.3
• /
• pp.49-54
• /
• 2018

A data warehouse is a system that collectively manages and integrates data of a company. And provides the basis for decision making for management strategy. Nowadays, analysis data volumes are reaching critical size challenging traditional data ware housing approaches. Current implemented solutions are mainly based on relational database that are no longer adapted to these data volume. NoSQL solutions allow us to consider new approaches for data warehousing, especially from the multidimensional data management point of view. In this paper, we extend the data warehouse design methodology based on relational database using star schema, and have developed a consistent design methodology from information requirement analysis to data warehouse construction for large scale data warehouse construction based on MongoDB, one of NoSQL.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10a
• /
• pp.254-256
• /
• 2000

전자 상거래 등에서 웹 클라이언트들은 시간이 갈수록 빠른 서비스를 요구하고 있다. 디스크 기반의 관계형 데이터베이스를 그대로 유지하면서도 빠른 응답을 가능하게 하는 방안으로, 메인 메모리 기반 데이터베이스 시스템(Main Memory-Based DBMS)을 Front- End로 사용하는 방법이 제안되고 있다. 본 논문에서는 관계형 데이터베이스 시스템에 객체-관계형 메인 메모리 기반 데이터베이스 시스템인 Tachyon[1]을 Front-End로 운용하여 성능을 개선하는 문제를 다룬다. 특히, 이 경우에 데이터 모델 상의 차이점으로 발생할 수 있는 문제를 정의하고, 그 해결책을 제시한다. 주요 내용으로는 관계 데이터베이스를 Tachyon에 적합한 객체 데이터베이스로 변환하는 기법과, 관계 질의를 객체 질의로의 변환 기법이다. 이러한 변환 기법은 관계 데이터베이스의 Front-End로 객체-관계 데이터베이스를 사용할 수 있도록 하는 연구의 출발점이 될 것이다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2012.07a
• /
• pp.325-328
• /
• 2012

본 연구는 사용자가 특정 전문지식에 대하여 검색하는데 있어 관계형 데이터베이스와 온톨로지를 결합해 보다 적합한 검색 결과를 반환하도록 하는 관계형 데이터베이스와 온톨로지 병행모델에 관한 것이다. 데이터나 정보 양의 급격한 증가는 검색 결과의 사용자 확신을 도리어 떨어트리는 big data 문제에 부딪히게 되었으며 모바일 기기의 사용 증가는 검색과 결과의 판단에 있어 인간의 관여를 줄이는 단순성을 높이는 것이 강조되고 있다. 따라서 본 연구는 고수준의 의사결정이 요구되는 분야에 있어서의 검색 성능을 높이기 위해 관계형 데이터베이스로 구성된 데이터에 온톨로지를 결합시켜 사용자에게 적합한 데이터를 반환할 수 있는 모델에 대해 지원해보고자 한다. 본 연구의 검증을 위해 전문 지식이 요구되는 의약품 분야의 데이터베이스를 기준으로 서비스를 제공하는 사이트에서의 검색을 통해 문제점을 제시하고 연구의 필요성을 제시한다.

• Journal of Society of Preventive Korean Medicine
• /
• v.13 no.2
• /
• pp.115-128
• /
• 2009

Background : Currently, ontology research has led the trend of technical development in medical informatics area. For Korean medicine, the reference terminology should be developed to facilitate the ontology research. Objective : This research aimed to design the management system for traditional Korean medical terms. Method :We built the internet-based system in which multi-users work simultaneously by using the relational database system(SQL Server2005) and visual studio 2005. Result : By this system, researchers can collect, refine, and inspect Korean medicine terms efficiently, and the terms can be transcribed into synonym, Korean, Chinese, and simplified Chinese. It enables the terms be input into the system accurately and managed by its classification. Conclusion : We developed the concept groups and its hierarchy system for Korean medicine terms which provides the basis for ontology system.

• The KIPS Transactions:PartD
• /
• v.9D no.2
• /
• pp.195-202
• /
• 2002

Information exchange on XML such as B2B electronic commerce is spreading. Therefore the systematic and stable management mechanism for storing the exchanged information is needed. For this goal there are many research activities for connection between XML application and relational database. But because XML data have hierarchical structures and relational database can store only flat-structured data, we need to store XML data in object-oriented database that support hierarchical structure. Accordingly the modeling methodology for storing XML data in object-oriented database is needed. In this parer, the transforming methods based on object model from XML DTD to object-oriented database schema is proposed. For this, we first introduce mapping methods that map XML DTD to object model and then we propose soem methods that transform from the object model to object-oriented database schema.

• Journal of IKEEE
• /
• v.7 no.2 s.13
• /
• pp.144-155
• /
• 2003

In this paper, a conceptual data model, called the UDM(Unified Data Model), to efficiently represent database structures related with object technology and complex structured data, is proposed. This model integrates major features of modern data models, such as E-R model, Semantic Object Model, and UML, especially from the viewpoint of database design. This model is basically a simplified, but extended version of the Object-Relationship Model, which was proposed to model complex structures of temporal-spatial multimedia data. This model incorporates some of the important semantic and structural information of modern database applications and it is designed to support all of the major logical database models, including relational, object-relational, object-oriented, and (semi-)structured databases. A special diagrammatic technique, called the UDD(Unified Data Diagram), is introduced as a tool for database design. Also, possible ways to derive logical views of data from this unified data model are presented. The proposed model can be utilized as a convenient and practical tool for conceptual database designs.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.4
• /
• pp.123-131
• /
• 2020

The pattern query in graph database has advantages of easy query expression and high query processing performance compared to relational database SQL. However, unlike the relational database, the graph database may not utilize the advantages of pattern query depending on modeling because the methodology for building the logical data model is not defined. In this study, in the is-a node modeling method that appears during the graph modeling process, we experiment that there is a difference in performance between graph pattern query when designing with a generalization model and designing with a specialization model. As a result of the experiment, it was shown that better performance can be obtained when the is-a node is designed as a specialization model. In addition, when writing a pattern query, we show that if a variable is bound to a node or edge, performance may be better than that of the variable of not bounded. The experimental results can be presented as an is-a node modeling method for pattern query and a graph query writing method in the graph database.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2005.11a
• /
• pp.71-76
• /
• 2005

XML is rapidly becoming one of the most widely adopted technologies for information exchange and representation on the World Wide Web. However, the large part of data is still stored in a relational database. Hence, we need to convert relational data into XML documents. The most important point of the conversion is to reflect referential integrities In relational schema model to XML schema model exactly. Until now, FT, NeT and CoT are suggested as existing approaches for conversion from the relational schema model to the XML schema model but these approaches only reflect referential integrities which are defined explicitly for conversion. In this paper, we suggest an algorithm for automatic extraction of implicit referential integrities such as foreign key constraints which is not defined explicitly in the initial relational schema model. We present translated XML documents by existing algorithms and suggested algorithms as comparison evaluation. We also compare suggested algorithm and conventional algorithms by simluation in accuracy part.

• The KIPS Transactions:PartD
• /
• v.13D no.2 s.105
• /
• pp.157-164
• /
• 2006

Since XML is emerging as the de facto standard for exchanging and representation of data on the web, the amount of XML data has rapidly increased. Thus, the need for effective store and retrieval of U data has arisen. Since the existing techniques such as XRel which is an XML storage and management technique using RDBMS simply record the existing all label paths, diverse classes of label path expressions could not be efficiently supported. In this paper, we present a technique which supports storage and retrieval for XML data using RDBMS efficiently compared with the existing approaches. Since the proposed technique keeps the XML path index on the relational database and replace label paths with path identifiers, diverse XML queries can be evaluated compared with existing approaches. Also, the proposed technique does not require the modification of the relational database engine and consumes the disk space less. Our experimental result demonstrates the better query performance compared with existing techniques.

• The KIPS Transactions:PartD
• /
• v.9D no.6
• /
• pp.999-1008
• /
• 2002

XML is emerging as a standard data format to exchange and to present data on the Web. There are increasing needs to efficiently store and to query XML data. In this paper. we propose a new schema transformation algorithm based on a common structure extracting technique from XML documents. The common structure is shared by all XML documents referenced by DTD and the uncommon structure is ununiformly appeared on all XML documents referenced by DTD. Based on the extracted common and uncommon structures, we transform XML DTD into relational database schema. We conduct a performance evaluation based on the number of the generated tables, the size of the record, query processing time and the number of joins on the query. The performance of our algorithm is compared with the existing algorithms, then in most cates, our algorithm is better than the existing ones with respect to the number of the generated tables and appearance of NULL values in the tables.