• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.11a
• /
• pp.220-224
• /
• 2000

데이터 마이닝란 대량의 실제 데이터에서 묵시적이고 잠재적으로 유용한 정보를 추출하는 작업이다. 본 논문에서 서로 관계가 정의되지 않은 데이터베이스의 각 테이블간에서 필요한 정보를 추출 또는 가공하기 위해 데이터 마이닝 기법을 사용한다. 마이닝 기법인 연관 규칙은 어떤 사건이 일어나면 다른 사건이 일어나는 관련성을 의미하는 것이고, 제시된 규칙 기반의 데이터 마이닝 기법은 연관 규칙의 한 분야로서 데이터를 규칙 맞게 분류하는 기법이다. 이런 마이닝 기법을 구현하기 위해 인공지능 분야의 규칙 기반의 전문가 시스템을 사용하였고, 실 시스템인 GDS(Grating automatic Drawing System)에 적용하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.731-733
• /
• 2003

기존의 데이타베이스 시스템에서 주요 성능문제는 대부분 응용프로그램의 SQL문에서 발생한다. 특히 다중 테이블을 이용한 SQL문에서 필수적으로 사용하는 JOIN 연산이 단순 질의 연산에 비해 많은 성능 문제점을 갖고 있다. 따라서 본 연구에서는 관계형 데이타베이스시스템에서 JOIN연산의 효율성을 높이기 위한 방안을 설정하고 이를 적용해 본다.

• KSCI Review
• /
• v.14 no.2
• /
• pp.185-197
• /
• 2006

A star schema consists of a central fact table, which is surrounded by one or more dimension tables. Each row int the fact table contains a multi-part primary key(or a composite foreign key) along with one or more columns containing various facts about the data stored in the row Each of the composit foreign key components is related to a dimensional table. The combination of keys in the fact table creates a composite foreign key that is unique to the fact table record. The composite foreign key, however, is rarely unique to the fact table record in real-world applications, particularly in financial applications. In order to make the composite foreign key be the determinant in real-world application, some precalculation might be performed in the SQL relational database, and cached in the OLAP database. However, there are many drawbacks to this approach. In some cases, this approach might give users the wrong results. In this paper, an approach to fact table modeling and related MDX query composing, which can be used in real-world applications without performing any precalculation and gives users the correct results, is proposed.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.1 s.45
• /
• pp.177-188
• /
• 2007

A star schema consists of a central fact table, which is surrounded by one or more dimension tables. Each row in the fact table contains a multi-part primary key(or a composite foreign key) along with one or more columns containing various facts about the data stored in the row. Each of the composit foreign key components is related to a dimensional table. The combination of keys in the fact table creates a composite foreign key that is unique to the fact table record. The composite foreign key, however, is rarely unique to the fact table retold in real-world applications, particularly in financial applications. In order to make the composite foreign key be the determinant in real-world application, some precalculation might be performed in the SQL relational database, and cached in the OLAP database. However, there are many drawbacks to this approach. In some cases, this approach might give users the wrong results. In this paper, an approach to fact table modeling and related MDX query composing, which can be used in real-world applications without performing any precalculation and gives users the correct results, is proposed.

• The Journal of the Korea Contents Association
• /
• v.6 no.10
• /
• pp.25-33
• /
• 2006

For semantic retrieval in semantic web environment, it is an important factor to manage and manipulate distributed resources. Ontology is essential for efficient search in distributed resources, but it is almost impossible to construct an unified ontology for all distributed resources in the web. In this paper, we assumed that most information in the web environment exist in the form of RDBMS, and propose a matching method between domain ontology and the existing RDBMS tables for semantic retrieval. Most previous studies about matching between RDBMS tables and domain ontology have extracted a local ontology from RDBMS tables at first, and conducted the matching between the local ontology and domain ontology. However in the processing of extracting a local ontology, some problems such as losing domain information can be occurred since its correlation with domain ontology has not been considered at all. In this paper, we propose a methods to prevent the loss of domain information through the similarity measure between instances of RDBMS tables and instances of ontology. And using the relational information between RDBMS tables and the relational information between classes in domain ontology, more efficient instance-based matching becomes possible.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.6
• /
• pp.837-844
• /
• 2001

XML has already been settled down as a standard for the exchange of commercial data on the web. Though most institutions have a wish to use XML document as an EDI form for all sorts of document exchange, it is unfortune that previous commercial data is still saved in the relational form of data base. Therefore, it is necessary that data saved in the relational form of data base be transformed into XML document form for the better use of document exchange. In order to transform relational form of data base to XML, one solution is to publish XML document by way of mapping each field of the relational form of data base table onto XML. However, in the case of building one XML document out of more i~km two data base tables, a join should be performed since a mere mapping associated with DTD tan not solve the problem. In this paper, we build the view for the XML in which alignments generated from the join are presented. and then through this view the contents with the relational form of data base should be transformed into XML. Briefly speaking, This paper aims to propose algorithm concerned with this transformation and to realize it.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.615-618
• /
• 2003

The design process of a relational database system consists of requirement analysis, conceptual design using ER diagram, logical design, and physical design. In logical design process, the conceptual schema is transformed to relational schema, and relational schema is normalized. This traditional design process is hard to applied in real database design process, since there is an ambiguity in conceptual design process. In this paper, we suggest a new design process, which provides more structural design steps by removing the conceptual design process. In new approach, we produce the data flow diagram by the structural methodology. From the attributes in the data store of data flow diagram, we construct relational table schema, and we normalize relational schema. Finally we produced table relationship diagram in order to figure out relationships between tables.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.3
• /
• pp.306-310
• /
• 2008

XQuery is a new recommendation for XML query. As an efforts for extending XQuery capabilities XML insertion and deletion are being studied and its standardization are going on. Initially XML databases are developed simply for XML document management. Now their functions are extending to OLTP. In this paper we are adding updating functions to XQuery processing system that is developed only for XQuery retrievals. We suggest the structure of tables, numbering schemes for hierarchical structures, and the methods for SQL translations for XQuery updates.

• The KIPS Transactions:PartD
• /
• v.9D no.1
• /
• pp.21-30
• /
• 2002

The active database system introduces the active rules detecting specified state. As the condition evaluation of the active rules is performed every time an event occurs, the performance of the system has a great influence, depending on the conditions processing method. In this paper, we propose the conditions processing system with the preprocessor which determines the delta tree structure, constructs the classification tree, and generates the aggregate function table. Due to the characteristics of the active database through which the active rules can be comprehended beforehand, the preprocessor can be introduced. In this paper, the delta tree which can effectively process the join, selection operations, and the aggregate function is suggested, and it can enhance the condition evaluation performance. And we propose the classification tree which effectively processes the join operation and the aggregate function table processing the aggregate function which demands high cost. In this paper, the conditions processing system can be expected to enhance the performance of conditions processing in the active rules as the number of conditions comparison decreases because of the structure which is made in the preprocessor.

• Journal of KIISE
• /
• v.42 no.9
• /
• pp.1147-1161
• /
• 2015

The ISO/IEC 11179 Metadata registry (MDR) is an international standard that was developed to register and share metadata. ISO/IEC 11179 represents an MDR as a metamodel that is an object model. However, it is difficult to develop an MDR based on ISO/IEC 11179 because the standard has no clear criteria to transform the metamodel into a database. In this paper, we suggest the design of an MDR data model that is based on object-relational transformation methodology (ORTM) for the MDR implementation. Hence, we classify the transformation methods of ORTM according to the corresponding relationships. After classification, we propose modeling rules by defining the standard use of the transformation. This paper builds the relational database tables as an implementation result of an MDR data model. Through experiments and evaluation, we verify the proposed modeling rules and evaluate the suitability of the created table structures. As the result, the proposed method shows that the table structures preserve classes and relationships of the standard metamodel well.